./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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/pthread-race-challenges/per-thread-array-ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:05:18,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:05:18,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:05:18,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:05:18,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:05:18,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:05:18,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:05:18,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:05:18,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:05:18,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:05:18,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:05:18,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:05:18,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:05:18,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:05:18,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:05:18,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:05:18,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:05:18,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:05:18,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:05:18,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:05:18,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:05:18,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:05:18,504 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:05:18,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:05:18,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:05:18,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:05:18,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:05:18,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:05:18,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:05:18,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:05:18,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:05:18,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:18,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:05:18,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:05:18,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:05:18,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:05:18,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:05:18,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:05:18,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:05:18,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:05:18,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:05:18,509 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2024-11-09 07:05:18,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:05:18,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:05:18,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:05:18,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:05:18,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:05:18,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-11-09 07:05:20,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:05:20,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:05:20,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-11-09 07:05:20,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eddbb17/9e7e603676c248cb8e28b3aab627884b/FLAG01735b129 [2024-11-09 07:05:20,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eddbb17/9e7e603676c248cb8e28b3aab627884b [2024-11-09 07:05:20,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:05:20,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:05:20,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:20,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:05:20,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:05:20,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393ce55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20, skipping insertion in model container [2024-11-09 07:05:20,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:05:20,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:20,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:05:20,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:20,830 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:05:20,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20 WrapperNode [2024-11-09 07:05:20,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:20,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:20,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:05:20,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:05:20,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,865 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-09 07:05:20,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:20,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:05:20,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:05:20,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:05:20,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:05:20,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:05:20,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:05:20,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:05:20,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (1/1) ... [2024-11-09 07:05:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:05:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:20,920 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-09 07:05:20,926 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-09 07:05:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:05:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:05:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:05:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:05:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:05:20,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:05:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:05:20,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:05:20,964 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:05:21,072 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:05:21,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:05:21,212 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:05:21,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:05:21,226 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:05:21,228 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:05:21,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:21 BoogieIcfgContainer [2024-11-09 07:05:21,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:05:21,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:05:21,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:05:21,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:05:21,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:05:20" (1/3) ... [2024-11-09 07:05:21,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60923fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:21, skipping insertion in model container [2024-11-09 07:05:21,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:20" (2/3) ... [2024-11-09 07:05:21,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60923fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:21, skipping insertion in model container [2024-11-09 07:05:21,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:21" (3/3) ... [2024-11-09 07:05:21,236 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2024-11-09 07:05:21,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:05:21,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 07:05:21,249 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:05:21,325 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 07:05:21,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 175 flow [2024-11-09 07:05:21,408 INFO L124 PetriNetUnfolderBase]: 6/116 cut-off events. [2024-11-09 07:05:21,408 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:05:21,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 6/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 196 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2024-11-09 07:05:21,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 175 flow [2024-11-09 07:05:21,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 175 flow [2024-11-09 07:05:21,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:05:21,433 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;@2d503578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:05:21,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 07:05:21,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:05:21,446 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-11-09 07:05:21,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:05:21,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:21,447 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] [2024-11-09 07:05:21,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:05:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2102882945, now seen corresponding path program 1 times [2024-11-09 07:05:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:21,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249902855] [2024-11-09 07:05:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249902855] [2024-11-09 07:05:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249902855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836810882] [2024-11-09 07:05:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:22,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:22,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 84 [2024-11-09 07:05:22,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-09 07:05:22,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 84 [2024-11-09 07:05:22,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:22,543 INFO L124 PetriNetUnfolderBase]: 71/365 cut-off events. [2024-11-09 07:05:22,543 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:05:22,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 365 events. 71/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1796 event pairs, 32 based on Foata normal form. 13/339 useless extension candidates. Maximal degree in co-relation 471. Up to 151 conditions per place. [2024-11-09 07:05:22,547 INFO L140 encePairwiseOnDemand]: 70/84 looper letters, 23 selfloop transitions, 22 changer transitions 1/102 dead transitions. [2024-11-09 07:05:22,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 301 flow [2024-11-09 07:05:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2024-11-09 07:05:22,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757936507936508 [2024-11-09 07:05:22,560 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 175 flow. Second operand 6 states and 391 transitions. [2024-11-09 07:05:22,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 301 flow [2024-11-09 07:05:22,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:22,565 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 317 flow [2024-11-09 07:05:22,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-11-09 07:05:22,569 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2024-11-09 07:05:22,570 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 317 flow [2024-11-09 07:05:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-09 07:05:22,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:22,570 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] [2024-11-09 07:05:22,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:05:22,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:05:22,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1651711161, now seen corresponding path program 1 times [2024-11-09 07:05:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328849543] [2024-11-09 07:05:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:22,655 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-09 07:05:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328849543] [2024-11-09 07:05:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328849543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891891571] [2024-11-09 07:05:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:22,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:22,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 84 [2024-11-09 07:05:22,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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-09 07:05:22,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:22,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 84 [2024-11-09 07:05:22,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:22,796 INFO L124 PetriNetUnfolderBase]: 33/232 cut-off events. [2024-11-09 07:05:22,797 INFO L125 PetriNetUnfolderBase]: For 38/47 co-relation queries the response was YES. [2024-11-09 07:05:22,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 232 events. 33/232 cut-off events. For 38/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 743 event pairs, 0 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 304. Up to 45 conditions per place. [2024-11-09 07:05:22,800 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 11 selfloop transitions, 2 changer transitions 5/106 dead transitions. [2024-11-09 07:05:22,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 363 flow [2024-11-09 07:05:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2024-11-09 07:05:22,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2024-11-09 07:05:22,805 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 317 flow. Second operand 6 states and 427 transitions. [2024-11-09 07:05:22,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 363 flow [2024-11-09 07:05:22,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:22,809 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 335 flow [2024-11-09 07:05:22,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2024-11-09 07:05:22,809 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2024-11-09 07:05:22,810 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 335 flow [2024-11-09 07:05:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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-09 07:05:22,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:22,810 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] [2024-11-09 07:05:22,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:05:22,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:05:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1712778762, now seen corresponding path program 1 times [2024-11-09 07:05:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:22,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338775497] [2024-11-09 07:05:22,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:23,076 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-09 07:05:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338775497] [2024-11-09 07:05:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338775497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:23,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984138150] [2024-11-09 07:05:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:23,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2024-11-09 07:05:23,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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-09 07:05:23,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:23,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2024-11-09 07:05:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:23,288 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2024-11-09 07:05:23,289 INFO L125 PetriNetUnfolderBase]: For 139/151 co-relation queries the response was YES. [2024-11-09 07:05:23,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 477 events. 130/477 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2447 event pairs, 23 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 992. Up to 238 conditions per place. [2024-11-09 07:05:23,294 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2024-11-09 07:05:23,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 653 flow [2024-11-09 07:05:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2024-11-09 07:05:23,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2024-11-09 07:05:23,297 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 335 flow. Second operand 6 states and 429 transitions. [2024-11-09 07:05:23,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 653 flow [2024-11-09 07:05:23,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 07:05:23,304 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2024-11-09 07:05:23,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2024-11-09 07:05:23,305 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2024-11-09 07:05:23,305 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2024-11-09 07:05:23,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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-09 07:05:23,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:23,306 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-09 07:05:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:05:23,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:05:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash 556796804, now seen corresponding path program 1 times [2024-11-09 07:05:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820443337] [2024-11-09 07:05:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820443337] [2024-11-09 07:05:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820443337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:23,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:23,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:23,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954817252] [2024-11-09 07:05:23,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:23,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:23,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:23,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2024-11-09 07:05:23,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-09 07:05:23,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:23,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2024-11-09 07:05:23,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:23,744 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2024-11-09 07:05:23,745 INFO L125 PetriNetUnfolderBase]: For 464/488 co-relation queries the response was YES. [2024-11-09 07:05:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/488 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2811 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2024-11-09 07:05:23,748 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2024-11-09 07:05:23,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2024-11-09 07:05:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2024-11-09 07:05:23,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7876984126984127 [2024-11-09 07:05:23,749 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2024-11-09 07:05:23,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2024-11-09 07:05:23,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:23,761 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2024-11-09 07:05:23,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2024-11-09 07:05:23,762 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2024-11-09 07:05:23,762 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2024-11-09 07:05:23,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-09 07:05:23,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:23,763 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:05:23,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 07:05:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1182255393, now seen corresponding path program 1 times [2024-11-09 07:05:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188697478] [2024-11-09 07:05:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:05:23,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:05:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:05:23,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:05:23,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:05:23,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 07:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-09 07:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-09 07:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-09 07:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-09 07:05:23,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:05:23,832 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 07:05:23,834 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:05:23,834 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 07:05:23,851 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:05:23,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 220 flow [2024-11-09 07:05:23,871 INFO L124 PetriNetUnfolderBase]: 11/199 cut-off events. [2024-11-09 07:05:23,873 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:05:23,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 199 events. 11/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 118. Up to 8 conditions per place. [2024-11-09 07:05:23,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 220 flow [2024-11-09 07:05:23,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 220 flow [2024-11-09 07:05:23,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:05:23,876 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;@2d503578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:05:23,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 07:05:23,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:05:23,879 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-11-09 07:05:23,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:05:23,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:23,879 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] [2024-11-09 07:05:23,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:23,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1295496281, now seen corresponding path program 1 times [2024-11-09 07:05:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026357470] [2024-11-09 07:05:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:24,030 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-09 07:05:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026357470] [2024-11-09 07:05:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026357470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2927835] [2024-11-09 07:05:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:24,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-11-09 07:05:24,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-09 07:05:24,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:24,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-11-09 07:05:24,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:24,467 INFO L124 PetriNetUnfolderBase]: 903/2672 cut-off events. [2024-11-09 07:05:24,468 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-09 07:05:24,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 2672 events. 903/2672 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20559 event pairs, 529 based on Foata normal form. 68/2471 useless extension candidates. Maximal degree in co-relation 2356. Up to 1385 conditions per place. [2024-11-09 07:05:24,481 INFO L140 encePairwiseOnDemand]: 84/102 looper letters, 30 selfloop transitions, 38 changer transitions 1/137 dead transitions. [2024-11-09 07:05:24,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 431 flow [2024-11-09 07:05:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2024-11-09 07:05:24,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-11-09 07:05:24,483 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 220 flow. Second operand 6 states and 486 transitions. [2024-11-09 07:05:24,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 431 flow [2024-11-09 07:05:24,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:24,486 INFO L231 Difference]: Finished difference. Result has 112 places, 135 transitions, 466 flow [2024-11-09 07:05:24,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=112, PETRI_TRANSITIONS=135} [2024-11-09 07:05:24,487 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2024-11-09 07:05:24,487 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 135 transitions, 466 flow [2024-11-09 07:05:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-09 07:05:24,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:24,487 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] [2024-11-09 07:05:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:05:24,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1746668065, now seen corresponding path program 1 times [2024-11-09 07:05:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:24,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848280776] [2024-11-09 07:05:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:24,545 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-09 07:05:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848280776] [2024-11-09 07:05:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848280776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265056783] [2024-11-09 07:05:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:24,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 102 [2024-11-09 07:05:24,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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-09 07:05:24,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:24,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 102 [2024-11-09 07:05:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:24,747 INFO L124 PetriNetUnfolderBase]: 420/1426 cut-off events. [2024-11-09 07:05:24,747 INFO L125 PetriNetUnfolderBase]: For 368/444 co-relation queries the response was YES. [2024-11-09 07:05:24,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1426 events. 420/1426 cut-off events. For 368/444 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9313 event pairs, 112 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 2141. Up to 520 conditions per place. [2024-11-09 07:05:24,756 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 14 selfloop transitions, 2 changer transitions 5/141 dead transitions. [2024-11-09 07:05:24,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 520 flow [2024-11-09 07:05:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-11-09 07:05:24,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2024-11-09 07:05:24,758 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 466 flow. Second operand 6 states and 526 transitions. [2024-11-09 07:05:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 520 flow [2024-11-09 07:05:24,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:24,763 INFO L231 Difference]: Finished difference. Result has 120 places, 136 transitions, 488 flow [2024-11-09 07:05:24,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=120, PETRI_TRANSITIONS=136} [2024-11-09 07:05:24,764 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2024-11-09 07:05:24,765 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 136 transitions, 488 flow [2024-11-09 07:05:24,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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-09 07:05:24,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:24,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] [2024-11-09 07:05:24,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:05:24,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 304559244, now seen corresponding path program 1 times [2024-11-09 07:05:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254979561] [2024-11-09 07:05:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:24,956 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-09 07:05:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254979561] [2024-11-09 07:05:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254979561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:24,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859514896] [2024-11-09 07:05:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:24,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:25,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-09 07:05:25,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 136 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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-09 07:05:25,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:25,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-09 07:05:25,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:25,485 INFO L124 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2024-11-09 07:05:25,485 INFO L125 PetriNetUnfolderBase]: For 1536/1621 co-relation queries the response was YES. [2024-11-09 07:05:25,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10823 conditions, 4588 events. 1866/4588 cut-off events. For 1536/1621 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 35949 event pairs, 434 based on Foata normal form. 0/4306 useless extension candidates. Maximal degree in co-relation 10729. Up to 2580 conditions per place. [2024-11-09 07:05:25,511 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2024-11-09 07:05:25,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1234 flow [2024-11-09 07:05:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2024-11-09 07:05:25,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-11-09 07:05:25,513 INFO L175 Difference]: Start difference. First operand has 120 places, 136 transitions, 488 flow. Second operand 6 states and 531 transitions. [2024-11-09 07:05:25,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1234 flow [2024-11-09 07:05:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 07:05:25,521 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2024-11-09 07:05:25,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2024-11-09 07:05:25,522 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2024-11-09 07:05:25,522 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2024-11-09 07:05:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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-09 07:05:25,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:25,523 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-09 07:05:25,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:05:25,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 708533652, now seen corresponding path program 1 times [2024-11-09 07:05:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068248044] [2024-11-09 07:05:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:05:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068248044] [2024-11-09 07:05:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068248044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005972140] [2024-11-09 07:05:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:25,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2024-11-09 07:05:25,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:05:25,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:25,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2024-11-09 07:05:25,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:26,441 INFO L124 PetriNetUnfolderBase]: 2323/5525 cut-off events. [2024-11-09 07:05:26,443 INFO L125 PetriNetUnfolderBase]: For 5295/5499 co-relation queries the response was YES. [2024-11-09 07:05:26,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 5525 events. 2323/5525 cut-off events. For 5295/5499 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44282 event pairs, 290 based on Foata normal form. 2/5296 useless extension candidates. Maximal degree in co-relation 13995. Up to 3131 conditions per place. [2024-11-09 07:05:26,479 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2024-11-09 07:05:26,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2024-11-09 07:05:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-11-09 07:05:26,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2024-11-09 07:05:26,481 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2024-11-09 07:05:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2024-11-09 07:05:26,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:26,508 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2024-11-09 07:05:26,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2024-11-09 07:05:26,509 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-11-09 07:05:26,510 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2024-11-09 07:05:26,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:05:26,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:26,510 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:05:26,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1881560913, now seen corresponding path program 1 times [2024-11-09 07:05:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004836190] [2024-11-09 07:05:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004836190] [2024-11-09 07:05:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004836190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008715988] [2024-11-09 07:05:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:26,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:26,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:05:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:27,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:05:27,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:27,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:05:27,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:05:27,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:05:27,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:05:27,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:05:27,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:27,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:05:27,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:27,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:05:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 07:05:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:27,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:27,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))))) is different from false [2024-11-09 07:05:27,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-09 07:05:27,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:05:27,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:05:29,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:29,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:05:29,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:29,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-11-09 07:05:29,497 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:29,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:05:29,502 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:05:29,507 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:29,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:05:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:05:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008715988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:29,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-09 07:05:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741815188] [2024-11-09 07:05:29,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:29,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:05:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:05:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=241, Unknown=20, NotChecked=140, Total=462 [2024-11-09 07:05:29,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-09 07:05:29,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 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-09 07:05:29,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:29,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-09 07:05:29,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:31,979 INFO L124 PetriNetUnfolderBase]: 6647/14233 cut-off events. [2024-11-09 07:05:31,979 INFO L125 PetriNetUnfolderBase]: For 20772/21073 co-relation queries the response was YES. [2024-11-09 07:05:32,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46842 conditions, 14233 events. 6647/14233 cut-off events. For 20772/21073 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 125124 event pairs, 1478 based on Foata normal form. 91/13625 useless extension candidates. Maximal degree in co-relation 36624. Up to 8488 conditions per place. [2024-11-09 07:05:32,083 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 285 selfloop transitions, 135 changer transitions 0/468 dead transitions. [2024-11-09 07:05:32,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 468 transitions, 4231 flow [2024-11-09 07:05:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:05:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-09 07:05:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 981 transitions. [2024-11-09 07:05:32,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657439446366782 [2024-11-09 07:05:32,086 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 981 transitions. [2024-11-09 07:05:32,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 468 transitions, 4231 flow [2024-11-09 07:05:32,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 468 transitions, 4087 flow, removed 72 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:32,176 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2024-11-09 07:05:32,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3118, PETRI_PLACES=157, PETRI_TRANSITIONS=353} [2024-11-09 07:05:32,178 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2024-11-09 07:05:32,178 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2024-11-09 07:05:32,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 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-09 07:05:32,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:32,179 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:32,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:05:32,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:05:32,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:32,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1785825861, now seen corresponding path program 1 times [2024-11-09 07:05:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787763781] [2024-11-09 07:05:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787763781] [2024-11-09 07:05:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787763781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062266874] [2024-11-09 07:05:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:32,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:32,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:05:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:05:32,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:32,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:05:32,937 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:05:32,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:05:32,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:05:32,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:05:33,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:33,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 07:05:33,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:33,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-09 07:05:33,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 07:05:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:33,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:33,070 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2024-11-09 07:05:33,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2024-11-09 07:05:33,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2024-11-09 07:05:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:05:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062266874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-09 07:05:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129635479] [2024-11-09 07:05:39,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:39,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:05:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:39,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:05:39,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2024-11-09 07:05:39,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2024-11-09 07:05:39,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 353 transitions, 3118 flow. Second operand has 19 states, 19 states have (on average 54.78947368421053) internal successors, (1041), 19 states have internal predecessors, (1041), 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-09 07:05:39,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:39,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2024-11-09 07:05:39,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:41,965 INFO L124 PetriNetUnfolderBase]: 7073/14388 cut-off events. [2024-11-09 07:05:41,966 INFO L125 PetriNetUnfolderBase]: For 28890/29386 co-relation queries the response was YES. [2024-11-09 07:05:42,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54579 conditions, 14388 events. 7073/14388 cut-off events. For 28890/29386 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 122514 event pairs, 997 based on Foata normal form. 298/14008 useless extension candidates. Maximal degree in co-relation 41065. Up to 5903 conditions per place. [2024-11-09 07:05:42,073 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 459 selfloop transitions, 366 changer transitions 7/890 dead transitions. [2024-11-09 07:05:42,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 890 transitions, 9226 flow [2024-11-09 07:05:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:05:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-09 07:05:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1512 transitions. [2024-11-09 07:05:42,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6445012787723785 [2024-11-09 07:05:42,077 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1512 transitions. [2024-11-09 07:05:42,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 890 transitions, 9226 flow [2024-11-09 07:05:42,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 890 transitions, 9168 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-09 07:05:42,187 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2024-11-09 07:05:42,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7920, PETRI_PLACES=183, PETRI_TRANSITIONS=671} [2024-11-09 07:05:42,188 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2024-11-09 07:05:42,189 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2024-11-09 07:05:42,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 54.78947368421053) internal successors, (1041), 19 states have internal predecessors, (1041), 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-09 07:05:42,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:42,189 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:42,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:05:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:05:42,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 860732203, now seen corresponding path program 2 times [2024-11-09 07:05:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263336613] [2024-11-09 07:05:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263336613] [2024-11-09 07:05:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263336613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918795464] [2024-11-09 07:05:42,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:05:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:42,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:42,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:05:42,802 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:05:42,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:05:42,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:05:42,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:42,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:05:42,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:05:42,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:05:42,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:05:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:05:42,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:05:42,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:42,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:05:42,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 07:05:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:42,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:44,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_361 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:05:44,888 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:05:44,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:05:44,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:44,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:05:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:05:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-09 07:05:44,953 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:44,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:05:44,957 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:44,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:05:44,962 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:05:44,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:05:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 07:05:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918795464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:45,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-11-09 07:05:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163720051] [2024-11-09 07:05:45,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:05:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:05:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=9, NotChecked=96, Total=380 [2024-11-09 07:05:45,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-09 07:05:45,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 671 transitions, 7920 flow. Second operand has 20 states, 20 states have (on average 49.15) internal successors, (983), 20 states have internal predecessors, (983), 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-09 07:05:45,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:45,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-09 07:05:45,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:48,778 INFO L124 PetriNetUnfolderBase]: 8499/17715 cut-off events. [2024-11-09 07:05:48,778 INFO L125 PetriNetUnfolderBase]: For 83327/83897 co-relation queries the response was YES. [2024-11-09 07:05:48,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81589 conditions, 17715 events. 8499/17715 cut-off events. For 83327/83897 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 157341 event pairs, 1750 based on Foata normal form. 203/17100 useless extension candidates. Maximal degree in co-relation 79833. Up to 9010 conditions per place. [2024-11-09 07:05:48,903 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 644 selfloop transitions, 371 changer transitions 2/1070 dead transitions. [2024-11-09 07:05:48,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1070 transitions, 14570 flow [2024-11-09 07:05:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:05:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-09 07:05:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1227 transitions. [2024-11-09 07:05:48,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.572829131652661 [2024-11-09 07:05:48,907 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1227 transitions. [2024-11-09 07:05:48,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1070 transitions, 14570 flow [2024-11-09 07:05:49,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1070 transitions, 14346 flow, removed 106 selfloop flow, removed 6 redundant places. [2024-11-09 07:05:49,271 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2024-11-09 07:05:49,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=7696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12467, PETRI_PLACES=204, PETRI_TRANSITIONS=894} [2024-11-09 07:05:49,272 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2024-11-09 07:05:49,272 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2024-11-09 07:05:49,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 49.15) internal successors, (983), 20 states have internal predecessors, (983), 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-09 07:05:49,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:49,272 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:49,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:05:49,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:49,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:05:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -414038941, now seen corresponding path program 3 times [2024-11-09 07:05:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:49,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428438118] [2024-11-09 07:05:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428438118] [2024-11-09 07:05:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428438118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715044984] [2024-11-09 07:05:49,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:05:49,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:49,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:05:49,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:49,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:05:49,967 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:05:49,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:05:49,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:05:49,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:49,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:05:50,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:05:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:05:50,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:05:50,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:05:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:05:50,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:05:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2024-11-09 07:05:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:50,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:05:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715044984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:52,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:52,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-11-09 07:05:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407978714] [2024-11-09 07:05:52,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:52,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 07:05:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 07:05:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:05:57,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:59,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-11-09 07:05:59,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 894 transitions, 12467 flow. Second operand has 41 states, 41 states have (on average 59.97560975609756) internal successors, (2459), 41 states have internal predecessors, (2459), 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-09 07:05:59,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:59,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-11-09 07:05:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:05,604 INFO L124 PetriNetUnfolderBase]: 7747/17421 cut-off events. [2024-11-09 07:06:05,605 INFO L125 PetriNetUnfolderBase]: For 153182/155279 co-relation queries the response was YES. [2024-11-09 07:06:05,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102481 conditions, 17421 events. 7747/17421 cut-off events. For 153182/155279 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 162929 event pairs, 527 based on Foata normal form. 665/17507 useless extension candidates. Maximal degree in co-relation 101009. Up to 6164 conditions per place. [2024-11-09 07:06:05,777 INFO L140 encePairwiseOnDemand]: 72/102 looper letters, 952 selfloop transitions, 633 changer transitions 0/1655 dead transitions. [2024-11-09 07:06:05,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1655 transitions, 28532 flow [2024-11-09 07:06:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 07:06:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-09 07:06:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2122 transitions. [2024-11-09 07:06:05,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6501225490196079 [2024-11-09 07:06:05,781 INFO L175 Difference]: Start difference. First operand has 204 places, 894 transitions, 12467 flow. Second operand 32 states and 2122 transitions. [2024-11-09 07:06:05,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1655 transitions, 28532 flow [2024-11-09 07:06:06,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1655 transitions, 28004 flow, removed 243 selfloop flow, removed 12 redundant places. [2024-11-09 07:06:06,386 INFO L231 Difference]: Finished difference. Result has 237 places, 1310 transitions, 22381 flow [2024-11-09 07:06:06,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=12177, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22381, PETRI_PLACES=237, PETRI_TRANSITIONS=1310} [2024-11-09 07:06:06,388 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 135 predicate places. [2024-11-09 07:06:06,388 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 1310 transitions, 22381 flow [2024-11-09 07:06:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 59.97560975609756) internal successors, (2459), 41 states have internal predecessors, (2459), 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-09 07:06:06,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:06,389 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:06,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:06:06,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:06,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:06,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash 947131673, now seen corresponding path program 4 times [2024-11-09 07:06:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868761920] [2024-11-09 07:06:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868761920] [2024-11-09 07:06:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868761920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016158874] [2024-11-09 07:06:06,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:06:06,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:06,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:06,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:06,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:06:07,087 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:06:07,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:07,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:06:07,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:07,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:06:07,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:07,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:06:07,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:06:07,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:06:07,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:06:07,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:07,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:06:07,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 07:06:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:07,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:07,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))))) is different from false [2024-11-09 07:06:07,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2024-11-09 07:06:07,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_489 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_489) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:06:09,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:09,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-09 07:06:09,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:09,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-11-09 07:06:09,797 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:09,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:09,804 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:09,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:09,814 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:09,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:06:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016158874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:09,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:09,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-09 07:06:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613399468] [2024-11-09 07:06:09,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:09,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:06:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:06:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=248, Unknown=18, NotChecked=102, Total=420 [2024-11-09 07:06:09,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-09 07:06:09,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 1310 transitions, 22381 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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-09 07:06:09,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:09,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-09 07:06:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:18,705 INFO L124 PetriNetUnfolderBase]: 15977/33588 cut-off events. [2024-11-09 07:06:18,705 INFO L125 PetriNetUnfolderBase]: For 340012/343663 co-relation queries the response was YES. [2024-11-09 07:06:18,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194141 conditions, 33588 events. 15977/33588 cut-off events. For 340012/343663 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 334241 event pairs, 3146 based on Foata normal form. 598/32628 useless extension candidates. Maximal degree in co-relation 191818. Up to 17737 conditions per place. [2024-11-09 07:06:19,102 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 817 selfloop transitions, 973 changer transitions 1/1845 dead transitions. [2024-11-09 07:06:19,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1845 transitions, 35599 flow [2024-11-09 07:06:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:06:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 07:06:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2024-11-09 07:06:19,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5730392156862745 [2024-11-09 07:06:19,105 INFO L175 Difference]: Start difference. First operand has 237 places, 1310 transitions, 22381 flow. Second operand 20 states and 1169 transitions. [2024-11-09 07:06:19,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1845 transitions, 35599 flow [2024-11-09 07:06:20,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 1845 transitions, 35344 flow, removed 95 selfloop flow, removed 13 redundant places. [2024-11-09 07:06:20,881 INFO L231 Difference]: Finished difference. Result has 249 places, 1694 transitions, 33347 flow [2024-11-09 07:06:20,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=22126, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=33347, PETRI_PLACES=249, PETRI_TRANSITIONS=1694} [2024-11-09 07:06:20,883 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 147 predicate places. [2024-11-09 07:06:20,883 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 1694 transitions, 33347 flow [2024-11-09 07:06:20,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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-09 07:06:20,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:20,883 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:20,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:21,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 07:06:21,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:21,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash -875174873, now seen corresponding path program 5 times [2024-11-09 07:06:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002484720] [2024-11-09 07:06:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002484720] [2024-11-09 07:06:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002484720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442329792] [2024-11-09 07:06:21,474 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:06:21,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:21,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:21,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:06:21,548 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:06:21,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:21,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:06:21,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:21,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:06:21,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:21,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:06:21,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:06:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:06:21,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:21,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:06:21,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:21,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:06:21,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 07:06:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:21,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:21,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-09 07:06:21,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))))))) is different from false [2024-11-09 07:06:24,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_553 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_553) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-11-09 07:06:24,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:06:24,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:24,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-09 07:06:24,157 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:24,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:06:24,162 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:24,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:24,168 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:24,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 07:06:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442329792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:24,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-09 07:06:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087160441] [2024-11-09 07:06:24,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:24,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:06:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:24,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:06:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=241, Unknown=24, NotChecked=102, Total=420 [2024-11-09 07:06:24,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-09 07:06:24,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1694 transitions, 33347 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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-09 07:06:24,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:24,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-09 07:06:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:06:35,172 INFO L124 PetriNetUnfolderBase]: 16817/35919 cut-off events. [2024-11-09 07:06:35,172 INFO L125 PetriNetUnfolderBase]: For 490351/495449 co-relation queries the response was YES. [2024-11-09 07:06:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226442 conditions, 35919 events. 16817/35919 cut-off events. For 490351/495449 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 366909 event pairs, 3474 based on Foata normal form. 905/35171 useless extension candidates. Maximal degree in co-relation 224113. Up to 20649 conditions per place. [2024-11-09 07:06:35,701 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 958 selfloop transitions, 1003 changer transitions 1/2016 dead transitions. [2024-11-09 07:06:35,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2016 transitions, 43582 flow [2024-11-09 07:06:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:06:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-09 07:06:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1167 transitions. [2024-11-09 07:06:35,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5720588235294117 [2024-11-09 07:06:35,703 INFO L175 Difference]: Start difference. First operand has 249 places, 1694 transitions, 33347 flow. Second operand 20 states and 1167 transitions. [2024-11-09 07:06:35,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2016 transitions, 43582 flow [2024-11-09 07:06:37,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 2016 transitions, 42623 flow, removed 449 selfloop flow, removed 12 redundant places. [2024-11-09 07:06:37,953 INFO L231 Difference]: Finished difference. Result has 261 places, 1899 transitions, 41412 flow [2024-11-09 07:06:37,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=32504, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=818, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41412, PETRI_PLACES=261, PETRI_TRANSITIONS=1899} [2024-11-09 07:06:37,954 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 159 predicate places. [2024-11-09 07:06:37,954 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 1899 transitions, 41412 flow [2024-11-09 07:06:37,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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-09 07:06:37,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:06:37,955 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:37,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:06:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:06:38,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:06:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1156433565, now seen corresponding path program 6 times [2024-11-09 07:06:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:06:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344029432] [2024-11-09 07:06:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:38,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:06:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344029432] [2024-11-09 07:06:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344029432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464808388] [2024-11-09 07:06:38,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:06:38,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:06:38,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:06:38,632 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-09 07:06:38,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:38,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:06:38,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:38,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:06:38,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:38,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:06:38,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:06:38,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 07:06:38,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 07:06:38,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:38,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 07:06:38,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 07:06:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:06:38,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:38,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-11-09 07:06:38,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2024-11-09 07:06:41,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_617) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-09 07:06:41,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:41,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 07:06:41,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:41,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-11-09 07:06:41,163 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:41,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:41,166 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:41,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 07:06:41,169 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 07:06:41,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 07:06:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:06:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464808388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:41,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-09 07:06:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573010816] [2024-11-09 07:06:41,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:06:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:06:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:06:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=245, Unknown=22, NotChecked=102, Total=420 [2024-11-09 07:06:41,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-11-09 07:06:41,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1899 transitions, 41412 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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-09 07:06:41,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:06:41,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-11-09 07:06:41,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand