./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:43:29,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:43:29,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:43:29,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:43:29,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:43:29,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:43:29,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:43:29,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:43:29,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:43:29,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:43:29,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:43:29,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:43:29,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:43:29,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:43:29,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:43:29,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:43:29,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:43:29,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:43:29,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:43:29,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:43:29,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:43:29,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:43:29,189 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:43:29,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:43:29,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:43:29,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:43:29,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:43:29,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:43:29,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:43:29,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:43:29,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:43:29,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:29,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:43:29,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:43:29,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:43:29,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:43:29,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:43:29,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:43:29,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:43:29,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:43:29,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:43:29,195 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2024-11-10 14:43:29,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:43:29,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:43:29,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:43:29,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:43:29,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:43:29,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-10 14:43:30,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:43:30,961 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:43:30,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-11-10 14:43:30,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5987572c2/4bbbcf30e8654f52bbcf5adfc4716a72/FLAG1d4a67753 [2024-11-10 14:43:31,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5987572c2/4bbbcf30e8654f52bbcf5adfc4716a72 [2024-11-10 14:43:31,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:43:31,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:43:31,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:31,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:43:31,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:43:31,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26765175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31, skipping insertion in model container [2024-11-10 14:43:31,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:43:31,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:31,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:43:31,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:31,857 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:43:31,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31 WrapperNode [2024-11-10 14:43:31,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:31,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:31,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:43:31,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:43:31,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,912 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-10 14:43:31,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:31,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:43:31,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:43:31,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:43:31,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:43:31,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:43:31,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:43:31,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:43:31,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (1/1) ... [2024-11-10 14:43:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:31,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:31,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:43:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:43:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:43:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:43:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:43:32,045 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:43:32,137 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:43:32,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:43:32,321 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:43:32,321 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:43:32,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:43:32,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:43:32,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:32 BoogieIcfgContainer [2024-11-10 14:43:32,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:43:32,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:43:32,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:43:32,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:43:32,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:43:31" (1/3) ... [2024-11-10 14:43:32,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196dca89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:32, skipping insertion in model container [2024-11-10 14:43:32,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:31" (2/3) ... [2024-11-10 14:43:32,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196dca89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:32, skipping insertion in model container [2024-11-10 14:43:32,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:32" (3/3) ... [2024-11-10 14:43:32,345 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2024-11-10 14:43:32,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:43:32,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 14:43:32,358 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:43:32,404 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:43:32,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 181 flow [2024-11-10 14:43:32,477 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2024-11-10 14:43:32,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:43:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 123 events. 6/123 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2024-11-10 14:43:32,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 181 flow [2024-11-10 14:43:32,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 87 transitions, 181 flow [2024-11-10 14:43:32,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:32,500 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;@7de1fbd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:32,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 14:43:32,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:32,513 INFO L124 PetriNetUnfolderBase]: 3/51 cut-off events. [2024-11-10 14:43:32,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:32,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:32,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:32,515 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-10 14:43:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 731626022, now seen corresponding path program 1 times [2024-11-10 14:43:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812388486] [2024-11-10 14:43:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812388486] [2024-11-10 14:43:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812388486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:32,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001981716] [2024-11-10 14:43:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:32,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:32,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:32,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 87 [2024-11-10 14:43:32,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 181 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:32,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:32,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 87 [2024-11-10 14:43:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:32,771 INFO L124 PetriNetUnfolderBase]: 1/118 cut-off events. [2024-11-10 14:43:32,773 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:43:32,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 118 events. 1/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 180 event pairs, 0 based on Foata normal form. 5/113 useless extension candidates. Maximal degree in co-relation 4. Up to 3 conditions per place. [2024-11-10 14:43:32,774 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 2 selfloop transitions, 0 changer transitions 1/84 dead transitions. [2024-11-10 14:43:32,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 179 flow [2024-11-10 14:43:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 169 transitions. [2024-11-10 14:43:32,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9712643678160919 [2024-11-10 14:43:32,812 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 181 flow. Second operand 2 states and 169 transitions. [2024-11-10 14:43:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 179 flow [2024-11-10 14:43:32,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 179 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:32,821 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 173 flow [2024-11-10 14:43:32,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=173, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-11-10 14:43:32,831 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2024-11-10 14:43:32,832 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 173 flow [2024-11-10 14:43:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:32,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:32,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:32,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:43:32,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:43:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 464969859, now seen corresponding path program 1 times [2024-11-10 14:43:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961933671] [2024-11-10 14:43:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:33,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961933671] [2024-11-10 14:43:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961933671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676783964] [2024-11-10 14:43:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:33,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:33,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 87 [2024-11-10 14:43:33,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:33,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:33,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 87 [2024-11-10 14:43:33,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:33,593 INFO L124 PetriNetUnfolderBase]: 64/337 cut-off events. [2024-11-10 14:43:33,594 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:43:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 337 events. 64/337 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1541 event pairs, 28 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 510. Up to 135 conditions per place. [2024-11-10 14:43:33,595 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 19 selfloop transitions, 21 changer transitions 7/105 dead transitions. [2024-11-10 14:43:33,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 105 transitions, 308 flow [2024-11-10 14:43:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 417 transitions. [2024-11-10 14:43:33,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7988505747126436 [2024-11-10 14:43:33,600 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 173 flow. Second operand 6 states and 417 transitions. [2024-11-10 14:43:33,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 105 transitions, 308 flow [2024-11-10 14:43:33,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 105 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:33,603 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 302 flow [2024-11-10 14:43:33,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2024-11-10 14:43:33,604 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 10 predicate places. [2024-11-10 14:43:33,605 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 302 flow [2024-11-10 14:43:33,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:33,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:33,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:33,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:43:33,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:43:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1364637296, now seen corresponding path program 1 times [2024-11-10 14:43:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:33,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292562814] [2024-11-10 14:43:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292562814] [2024-11-10 14:43:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292562814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:33,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:33,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000405276] [2024-11-10 14:43:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:33,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:33,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:33,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 87 [2024-11-10 14:43:33,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:33,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:33,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 87 [2024-11-10 14:43:33,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:34,041 INFO L124 PetriNetUnfolderBase]: 85/430 cut-off events. [2024-11-10 14:43:34,041 INFO L125 PetriNetUnfolderBase]: For 75/87 co-relation queries the response was YES. [2024-11-10 14:43:34,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 430 events. 85/430 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2174 event pairs, 19 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 842. Up to 181 conditions per place. [2024-11-10 14:43:34,046 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 41 selfloop transitions, 22 changer transitions 0/119 dead transitions. [2024-11-10 14:43:34,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 119 transitions, 502 flow [2024-11-10 14:43:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2024-11-10 14:43:34,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7758620689655172 [2024-11-10 14:43:34,050 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 302 flow. Second operand 6 states and 405 transitions. [2024-11-10 14:43:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 119 transitions, 502 flow [2024-11-10 14:43:34,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 119 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:34,055 INFO L231 Difference]: Finished difference. Result has 102 places, 119 transitions, 484 flow [2024-11-10 14:43:34,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=484, PETRI_PLACES=102, PETRI_TRANSITIONS=119} [2024-11-10 14:43:34,056 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 16 predicate places. [2024-11-10 14:43:34,057 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 119 transitions, 484 flow [2024-11-10 14:43:34,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:34,058 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] [2024-11-10 14:43:34,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:43:34,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 14:43:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1981166045, now seen corresponding path program 1 times [2024-11-10 14:43:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663746789] [2024-11-10 14:43:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663746789] [2024-11-10 14:43:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663746789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:34,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194147550] [2024-11-10 14:43:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:34,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:34,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 87 [2024-11-10 14:43:34,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 119 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:34,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 87 [2024-11-10 14:43:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:34,406 INFO L124 PetriNetUnfolderBase]: 159/582 cut-off events. [2024-11-10 14:43:34,406 INFO L125 PetriNetUnfolderBase]: For 327/391 co-relation queries the response was YES. [2024-11-10 14:43:34,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 582 events. 159/582 cut-off events. For 327/391 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3133 event pairs, 22 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 1518. Up to 288 conditions per place. [2024-11-10 14:43:34,409 INFO L140 encePairwiseOnDemand]: 72/87 looper letters, 47 selfloop transitions, 55 changer transitions 10/168 dead transitions. [2024-11-10 14:43:34,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 168 transitions, 938 flow [2024-11-10 14:43:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 446 transitions. [2024-11-10 14:43:34,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8544061302681992 [2024-11-10 14:43:34,411 INFO L175 Difference]: Start difference. First operand has 102 places, 119 transitions, 484 flow. Second operand 6 states and 446 transitions. [2024-11-10 14:43:34,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 168 transitions, 938 flow [2024-11-10 14:43:34,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 168 transitions, 900 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:34,417 INFO L231 Difference]: Finished difference. Result has 112 places, 158 transitions, 930 flow [2024-11-10 14:43:34,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=112, PETRI_TRANSITIONS=158} [2024-11-10 14:43:34,418 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2024-11-10 14:43:34,418 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 158 transitions, 930 flow [2024-11-10 14:43:34,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:34,419 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2024-11-10 14:43:34,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:43:34,419 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-10 14:43:34,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1334137570, now seen corresponding path program 1 times [2024-11-10 14:43:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416368242] [2024-11-10 14:43:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:34,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:34,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:43:34,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:34,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 14:43:34,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-10 14:43:34,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-10 14:43:34,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-10 14:43:34,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-10 14:43:34,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:43:34,469 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 14:43:34,471 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:43:34,471 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:43:34,483 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:43:34,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 106 transitions, 228 flow [2024-11-10 14:43:34,498 INFO L124 PetriNetUnfolderBase]: 11/212 cut-off events. [2024-11-10 14:43:34,499 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:43:34,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 212 events. 11/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 401 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2024-11-10 14:43:34,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 106 transitions, 228 flow [2024-11-10 14:43:34,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 106 transitions, 228 flow [2024-11-10 14:43:34,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:34,502 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;@7de1fbd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:34,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 14:43:34,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:34,505 INFO L124 PetriNetUnfolderBase]: 3/51 cut-off events. [2024-11-10 14:43:34,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:34,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:34,505 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] [2024-11-10 14:43:34,505 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-10 14:43:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -87383792, now seen corresponding path program 1 times [2024-11-10 14:43:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037189659] [2024-11-10 14:43:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037189659] [2024-11-10 14:43:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037189659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:34,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461643350] [2024-11-10 14:43:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:34,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 106 [2024-11-10 14:43:34,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 228 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:34,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 106 [2024-11-10 14:43:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:34,559 INFO L124 PetriNetUnfolderBase]: 3/204 cut-off events. [2024-11-10 14:43:34,560 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-10 14:43:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 204 events. 3/204 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 395 event pairs, 0 based on Foata normal form. 8/195 useless extension candidates. Maximal degree in co-relation 122. Up to 7 conditions per place. [2024-11-10 14:43:34,560 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 4 selfloop transitions, 0 changer transitions 1/103 dead transitions. [2024-11-10 14:43:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 230 flow [2024-11-10 14:43:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2024-11-10 14:43:34,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9669811320754716 [2024-11-10 14:43:34,562 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 228 flow. Second operand 2 states and 205 transitions. [2024-11-10 14:43:34,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 230 flow [2024-11-10 14:43:34,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:34,563 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 220 flow [2024-11-10 14:43:34,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-10 14:43:34,564 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-10 14:43:34,564 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 220 flow [2024-11-10 14:43:34,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:34,565 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] [2024-11-10 14:43:34,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:43:34,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:43:34,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 845469507, now seen corresponding path program 1 times [2024-11-10 14:43:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:34,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853462754] [2024-11-10 14:43:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:34,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:34,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853462754] [2024-11-10 14:43:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853462754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030646476] [2024-11-10 14:43:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:34,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:34,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2024-11-10 14:43:34,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:34,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:34,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2024-11-10 14:43:34,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:35,076 INFO L124 PetriNetUnfolderBase]: 851/2408 cut-off events. [2024-11-10 14:43:35,076 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-10 14:43:35,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 2408 events. 851/2408 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17373 event pairs, 444 based on Foata normal form. 0/2236 useless extension candidates. Maximal degree in co-relation 3958. Up to 1286 conditions per place. [2024-11-10 14:43:35,087 INFO L140 encePairwiseOnDemand]: 91/106 looper letters, 29 selfloop transitions, 38 changer transitions 0/141 dead transitions. [2024-11-10 14:43:35,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 438 flow [2024-11-10 14:43:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 518 transitions. [2024-11-10 14:43:35,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8144654088050315 [2024-11-10 14:43:35,089 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 220 flow. Second operand 6 states and 518 transitions. [2024-11-10 14:43:35,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 438 flow [2024-11-10 14:43:35,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 141 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:35,092 INFO L231 Difference]: Finished difference. Result has 116 places, 139 transitions, 474 flow [2024-11-10 14:43:35,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2024-11-10 14:43:35,092 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2024-11-10 14:43:35,093 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 474 flow [2024-11-10 14:43:35,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:35,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:35,093 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:35,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:43:35,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:43:35,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash -776692336, now seen corresponding path program 1 times [2024-11-10 14:43:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978297167] [2024-11-10 14:43:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:35,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978297167] [2024-11-10 14:43:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978297167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:35,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685707011] [2024-11-10 14:43:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:35,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:35,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:35,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2024-11-10 14:43:35,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:35,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:35,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2024-11-10 14:43:35,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:35,645 INFO L124 PetriNetUnfolderBase]: 1167/3426 cut-off events. [2024-11-10 14:43:35,646 INFO L125 PetriNetUnfolderBase]: For 903/1077 co-relation queries the response was YES. [2024-11-10 14:43:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 3426 events. 1167/3426 cut-off events. For 903/1077 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 26746 event pairs, 408 based on Foata normal form. 0/3143 useless extension candidates. Maximal degree in co-relation 7466. Up to 1777 conditions per place. [2024-11-10 14:43:35,665 INFO L140 encePairwiseOnDemand]: 91/106 looper letters, 65 selfloop transitions, 38 changer transitions 0/177 dead transitions. [2024-11-10 14:43:35,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 177 transitions, 825 flow [2024-11-10 14:43:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2024-11-10 14:43:35,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971698113207547 [2024-11-10 14:43:35,667 INFO L175 Difference]: Start difference. First operand has 116 places, 139 transitions, 474 flow. Second operand 6 states and 507 transitions. [2024-11-10 14:43:35,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 177 transitions, 825 flow [2024-11-10 14:43:35,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 177 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:35,673 INFO L231 Difference]: Finished difference. Result has 126 places, 176 transitions, 792 flow [2024-11-10 14:43:35,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=126, PETRI_TRANSITIONS=176} [2024-11-10 14:43:35,675 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 20 predicate places. [2024-11-10 14:43:35,675 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 176 transitions, 792 flow [2024-11-10 14:43:35,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:35,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:35,676 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] [2024-11-10 14:43:35,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:43:35,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:43:35,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -69419790, now seen corresponding path program 1 times [2024-11-10 14:43:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326362905] [2024-11-10 14:43:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:35,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326362905] [2024-11-10 14:43:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326362905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782997503] [2024-11-10 14:43:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:35,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:35,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2024-11-10 14:43:35,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 176 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:35,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:35,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2024-11-10 14:43:35,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:36,600 INFO L124 PetriNetUnfolderBase]: 2454/6069 cut-off events. [2024-11-10 14:43:36,600 INFO L125 PetriNetUnfolderBase]: For 4103/4586 co-relation queries the response was YES. [2024-11-10 14:43:36,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16836 conditions, 6069 events. 2454/6069 cut-off events. For 4103/4586 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 49067 event pairs, 341 based on Foata normal form. 1/5706 useless extension candidates. Maximal degree in co-relation 16821. Up to 3349 conditions per place. [2024-11-10 14:43:36,646 INFO L140 encePairwiseOnDemand]: 87/106 looper letters, 94 selfloop transitions, 130 changer transitions 0/305 dead transitions. [2024-11-10 14:43:36,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 305 transitions, 2020 flow [2024-11-10 14:43:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2024-11-10 14:43:36,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8726415094339622 [2024-11-10 14:43:36,648 INFO L175 Difference]: Start difference. First operand has 126 places, 176 transitions, 792 flow. Second operand 6 states and 555 transitions. [2024-11-10 14:43:36,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 305 transitions, 2020 flow [2024-11-10 14:43:36,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 305 transitions, 1894 flow, removed 63 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:36,664 INFO L231 Difference]: Finished difference. Result has 136 places, 297 transitions, 2042 flow [2024-11-10 14:43:36,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2042, PETRI_PLACES=136, PETRI_TRANSITIONS=297} [2024-11-10 14:43:36,665 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 30 predicate places. [2024-11-10 14:43:36,665 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 297 transitions, 2042 flow [2024-11-10 14:43:36,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:36,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:36,666 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:43:36,666 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-10 14:43:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -278873727, now seen corresponding path program 1 times [2024-11-10 14:43:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770206067] [2024-11-10 14:43:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770206067] [2024-11-10 14:43:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770206067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856675262] [2024-11-10 14:43:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:37,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:37,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:37,112 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-10 14:43:37,114 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-10 14:43:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:37,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 14:43:37,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:37,275 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-10 14:43:37,319 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:43:37,320 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-10 14:43:37,374 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-10 14:43:37,406 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-10 14:43:37,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:37,441 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-10 14:43:37,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:37,484 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-10 14:43:37,710 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-10 14:43:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:37,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:39,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0)))) (and (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)))))) is different from false [2024-11-10 14:43:39,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 0) .cse1 0)))) (and (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_202) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2024-11-10 14:43:41,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:41,723 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-10 14:43:41,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:41,729 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 83 treesize of output 39 [2024-11-10 14:43:41,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-10 14:43:41,737 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:41,737 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-10 14:43:41,741 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:41,742 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-10 14:43:41,745 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:41,746 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-10 14:43:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:41,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856675262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:41,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-11-10 14:43:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700988758] [2024-11-10 14:43:41,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:41,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 14:43:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 14:43:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=592, Unknown=52, NotChecked=106, Total=870 [2024-11-10 14:43:41,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 106 [2024-11-10 14:43:41,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 297 transitions, 2042 flow. Second operand has 30 states, 30 states have (on average 52.733333333333334) internal successors, (1582), 30 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:41,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:41,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 106 [2024-11-10 14:43:41,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:46,282 INFO L124 PetriNetUnfolderBase]: 9113/19715 cut-off events. [2024-11-10 14:43:46,283 INFO L125 PetriNetUnfolderBase]: For 30434/30490 co-relation queries the response was YES. [2024-11-10 14:43:46,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61391 conditions, 19715 events. 9113/19715 cut-off events. For 30434/30490 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 180066 event pairs, 1200 based on Foata normal form. 80/18870 useless extension candidates. Maximal degree in co-relation 61371. Up to 4444 conditions per place. [2024-11-10 14:43:46,398 INFO L140 encePairwiseOnDemand]: 75/106 looper letters, 771 selfloop transitions, 278 changer transitions 90/1191 dead transitions. [2024-11-10 14:43:46,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1191 transitions, 10175 flow [2024-11-10 14:43:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 14:43:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-11-10 14:43:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2715 transitions. [2024-11-10 14:43:46,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6247123791992637 [2024-11-10 14:43:46,403 INFO L175 Difference]: Start difference. First operand has 136 places, 297 transitions, 2042 flow. Second operand 41 states and 2715 transitions. [2024-11-10 14:43:46,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1191 transitions, 10175 flow [2024-11-10 14:43:46,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1191 transitions, 10067 flow, removed 54 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:46,491 INFO L231 Difference]: Finished difference. Result has 189 places, 510 transitions, 4461 flow [2024-11-10 14:43:46,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=4461, PETRI_PLACES=189, PETRI_TRANSITIONS=510} [2024-11-10 14:43:46,492 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 83 predicate places. [2024-11-10 14:43:46,493 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 510 transitions, 4461 flow [2024-11-10 14:43:46,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 52.733333333333334) internal successors, (1582), 30 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:46,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,493 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:46,510 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-10 14:43:46,694 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-10 14:43:46,695 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-10 14:43:46,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1917986547, now seen corresponding path program 1 times [2024-11-10 14:43:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606290926] [2024-11-10 14:43:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:47,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606290926] [2024-11-10 14:43:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606290926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931735946] [2024-11-10 14:43:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:47,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:47,166 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-10 14:43:47,174 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-10 14:43:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:47,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 14:43:47,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:47,250 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-10 14:43:47,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:43:47,263 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-10 14:43:47,290 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-10 14:43:47,320 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-10 14:43:47,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:47,333 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-10 14:43:47,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:47,354 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-10 14:43:47,409 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-10 14:43:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:47,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:47,437 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-11-10 14:43:47,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_263 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_263) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2024-11-10 14:43:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931735946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:51,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-10 14:43:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013838699] [2024-11-10 14:43:51,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 14:43:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:51,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 14:43:51,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=9, NotChecked=62, Total=342 [2024-11-10 14:43:51,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 106 [2024-11-10 14:43:51,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 510 transitions, 4461 flow. Second operand has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:51,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:51,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 106 [2024-11-10 14:43:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:57,048 INFO L124 PetriNetUnfolderBase]: 9961/20969 cut-off events. [2024-11-10 14:43:57,048 INFO L125 PetriNetUnfolderBase]: For 47558/47975 co-relation queries the response was YES. [2024-11-10 14:43:57,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77346 conditions, 20969 events. 9961/20969 cut-off events. For 47558/47975 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 194030 event pairs, 419 based on Foata normal form. 367/20438 useless extension candidates. Maximal degree in co-relation 77312. Up to 4528 conditions per place. [2024-11-10 14:43:57,249 INFO L140 encePairwiseOnDemand]: 82/106 looper letters, 1021 selfloop transitions, 726 changer transitions 45/1858 dead transitions. [2024-11-10 14:43:57,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1858 transitions, 18107 flow [2024-11-10 14:43:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-10 14:43:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2024-11-10 14:43:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4356 transitions. [2024-11-10 14:43:57,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6322206095791001 [2024-11-10 14:43:57,256 INFO L175 Difference]: Start difference. First operand has 189 places, 510 transitions, 4461 flow. Second operand 65 states and 4356 transitions. [2024-11-10 14:43:57,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1858 transitions, 18107 flow [2024-11-10 14:43:57,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 1858 transitions, 17610 flow, removed 68 selfloop flow, removed 9 redundant places. [2024-11-10 14:43:57,450 INFO L231 Difference]: Finished difference. Result has 272 places, 1173 transitions, 12917 flow [2024-11-10 14:43:57,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=4262, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=12917, PETRI_PLACES=272, PETRI_TRANSITIONS=1173} [2024-11-10 14:43:57,451 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 166 predicate places. [2024-11-10 14:43:57,451 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 1173 transitions, 12917 flow [2024-11-10 14:43:57,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 56.89473684210526) internal successors, (1081), 19 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:57,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:57,452 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:57,466 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-10 14:43:57,655 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-10 14:43:57,656 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-10 14:43:57,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash 452268479, now seen corresponding path program 2 times [2024-11-10 14:43:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877712526] [2024-11-10 14:43:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:57,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877712526] [2024-11-10 14:43:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877712526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668399170] [2024-11-10 14:43:57,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:43:57,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:57,996 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-10 14:43:57,997 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-10 14:43:58,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:43:58,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:43:58,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 14:43:58,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:58,089 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-10 14:43:58,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:43:58,130 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-10 14:43:58,261 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-10 14:43:58,286 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 19 treesize of output 18 [2024-11-10 14:43:58,318 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 26 treesize of output 28 [2024-11-10 14:43:58,361 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 33 treesize of output 38 [2024-11-10 14:43:58,536 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 37 treesize of output 26 [2024-11-10 14:43:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:58,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:58,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_323 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)))) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)))) is different from false [2024-11-10 14:43:58,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-11-10 14:43:58,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0)))) (and (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)))))) is different from false [2024-11-10 14:43:58,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0) .cse3 0)))) (and (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2024-11-10 14:43:58,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse4))) (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|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_323 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_323) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) 0)))))) is different from false [2024-11-10 14:43:58,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:58,681 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-10 14:43:58,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:58,685 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 83 treesize of output 39 [2024-11-10 14:43:58,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-10 14:43:58,693 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:58,693 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-10 14:43:58,699 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:58,699 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-10 14:43:58,705 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:43:58,705 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-10 14:43:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668399170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:58,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:58,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2024-11-10 14:43:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588081957] [2024-11-10 14:43:58,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:58,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 14:43:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 14:43:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=704, Unknown=5, NotChecked=290, Total=1122 [2024-11-10 14:43:58,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 106 [2024-11-10 14:43:58,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1173 transitions, 12917 flow. Second operand has 34 states, 34 states have (on average 52.911764705882355) internal successors, (1799), 34 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:58,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:58,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 106 [2024-11-10 14:43:58,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:07,984 INFO L124 PetriNetUnfolderBase]: 15208/32156 cut-off events. [2024-11-10 14:44:07,984 INFO L125 PetriNetUnfolderBase]: For 239089/240684 co-relation queries the response was YES. [2024-11-10 14:44:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157789 conditions, 32156 events. 15208/32156 cut-off events. For 239089/240684 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 315000 event pairs, 1146 based on Foata normal form. 534/31039 useless extension candidates. Maximal degree in co-relation 157728. Up to 7974 conditions per place. [2024-11-10 14:44:08,612 INFO L140 encePairwiseOnDemand]: 75/106 looper letters, 1296 selfloop transitions, 988 changer transitions 46/2397 dead transitions. [2024-11-10 14:44:08,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 2397 transitions, 31024 flow [2024-11-10 14:44:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 14:44:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2024-11-10 14:44:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3182 transitions. [2024-11-10 14:44:08,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253930817610063 [2024-11-10 14:44:08,616 INFO L175 Difference]: Start difference. First operand has 272 places, 1173 transitions, 12917 flow. Second operand 48 states and 3182 transitions. [2024-11-10 14:44:08,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 2397 transitions, 31024 flow [2024-11-10 14:44:10,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 2397 transitions, 30386 flow, removed 313 selfloop flow, removed 6 redundant places. [2024-11-10 14:44:10,663 INFO L231 Difference]: Finished difference. Result has 340 places, 1757 transitions, 23776 flow [2024-11-10 14:44:10,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=12315, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=23776, PETRI_PLACES=340, PETRI_TRANSITIONS=1757} [2024-11-10 14:44:10,665 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 234 predicate places. [2024-11-10 14:44:10,665 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 1757 transitions, 23776 flow [2024-11-10 14:44:10,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 52.911764705882355) internal successors, (1799), 34 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:44:10,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:10,666 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:10,678 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-10 14:44:10,871 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-10 14:44:10,872 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-10 14:44:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 164088059, now seen corresponding path program 3 times [2024-11-10 14:44:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225270454] [2024-11-10 14:44:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:11,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225270454] [2024-11-10 14:44:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225270454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980885179] [2024-11-10 14:44:11,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:44:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:11,148 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-10 14:44:11,150 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-10 14:44:11,216 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:44:11,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:44:11,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 14:44:11,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:11,284 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-10 14:44:11,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:44:11,342 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-10 14:44:11,572 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-10 14:44:11,600 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 19 treesize of output 18 [2024-11-10 14:44:11,633 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 26 treesize of output 28 [2024-11-10 14:44:11,671 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 33 treesize of output 38 [2024-11-10 14:44:11,722 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 37 treesize of output 26 [2024-11-10 14:44:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:11,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:11,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)))) is different from false [2024-11-10 14:44:11,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 0)))) (and (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)))))) is different from false [2024-11-10 14:44:11,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0) .cse3 0)))) (and (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-11-10 14:44:11,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_383 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_383) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-11-10 14:44:11,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:44:11,818 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-10 14:44:11,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:44:11,822 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 83 treesize of output 39 [2024-11-10 14:44:11,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-10 14:44:11,828 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:11,828 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-10 14:44:11,832 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:11,832 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-10 14:44:11,835 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:11,836 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-10 14:44:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980885179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:12,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:12,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-11-10 14:44:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597839301] [2024-11-10 14:44:12,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-10 14:44:12,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:12,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-10 14:44:12,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1318, Unknown=4, NotChecked=308, Total=1806 [2024-11-10 14:44:12,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 106 [2024-11-10 14:44:12,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1757 transitions, 23776 flow. Second operand has 43 states, 43 states have (on average 43.25581395348837) internal successors, (1860), 43 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:44:12,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:12,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 106 [2024-11-10 14:44:12,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:29,644 INFO L124 PetriNetUnfolderBase]: 22579/46116 cut-off events. [2024-11-10 14:44:29,644 INFO L125 PetriNetUnfolderBase]: For 469634/471889 co-relation queries the response was YES. [2024-11-10 14:44:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261917 conditions, 46116 events. 22579/46116 cut-off events. For 469634/471889 co-relation queries the response was YES. Maximal size of possible extension queue 1706. Compared 469985 event pairs, 1498 based on Foata normal form. 1545/45151 useless extension candidates. Maximal degree in co-relation 261828. Up to 11391 conditions per place. [2024-11-10 14:44:30,897 INFO L140 encePairwiseOnDemand]: 73/106 looper letters, 1924 selfloop transitions, 1457 changer transitions 183/3622 dead transitions. [2024-11-10 14:44:30,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 3622 transitions, 56553 flow [2024-11-10 14:44:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 14:44:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2024-11-10 14:44:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 3813 transitions. [2024-11-10 14:44:30,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49276298785215816 [2024-11-10 14:44:30,901 INFO L175 Difference]: Start difference. First operand has 340 places, 1757 transitions, 23776 flow. Second operand 73 states and 3813 transitions. [2024-11-10 14:44:30,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 3622 transitions, 56553 flow [2024-11-10 14:44:39,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 3622 transitions, 56233 flow, removed 102 selfloop flow, removed 16 redundant places. [2024-11-10 14:44:39,251 INFO L231 Difference]: Finished difference. Result has 424 places, 2567 transitions, 42474 flow [2024-11-10 14:44:39,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=23555, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=738, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=42474, PETRI_PLACES=424, PETRI_TRANSITIONS=2567} [2024-11-10 14:44:39,253 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 318 predicate places. [2024-11-10 14:44:39,253 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 2567 transitions, 42474 flow [2024-11-10 14:44:39,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 43.25581395348837) internal successors, (1860), 43 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:44:39,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:39,255 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:39,268 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-10 14:44:39,458 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-10 14:44:39,458 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-10 14:44:39,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1075287955, now seen corresponding path program 4 times [2024-11-10 14:44:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674647412] [2024-11-10 14:44:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674647412] [2024-11-10 14:44:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674647412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284211064] [2024-11-10 14:44:39,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 14:44:39,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:39,822 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-10 14:44:39,826 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-10 14:44:39,903 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 14:44:39,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:44:39,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 14:44:39,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:39,970 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-10 14:44:40,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 14:44:40,065 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-10 14:44:40,235 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-10 14:44:40,271 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 19 treesize of output 18 [2024-11-10 14:44:40,311 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 26 treesize of output 28 [2024-11-10 14:44:40,397 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 33 treesize of output 38 [2024-11-10 14:44:40,597 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 37 treesize of output 26 [2024-11-10 14:44:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:40,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:40,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)))) is different from false [2024-11-10 14:44:40,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 0)))) (and (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))))))) is different from false [2024-11-10 14:44:40,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (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 0)))) (and (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)))))) is different from false [2024-11-10 14:44:40,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 0) .cse3 0)))) (and (forall ((v_ArrVal_443 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2024-11-10 14:44:40,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (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 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_443 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_443) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-11-10 14:44:40,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:44:40,808 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-10 14:44:40,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:44:40,813 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 83 treesize of output 39 [2024-11-10 14:44:40,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-10 14:44:40,820 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:40,820 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-10 14:44:40,824 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:40,824 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-10 14:44:40,828 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-10 14:44:40,828 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-10 14:44:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284211064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:40,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 40 [2024-11-10 14:44:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831881033] [2024-11-10 14:44:40,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 14:44:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 14:44:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1126, Unknown=11, NotChecked=360, Total=1640 [2024-11-10 14:44:41,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 106 [2024-11-10 14:44:41,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 2567 transitions, 42474 flow. Second operand has 41 states, 41 states have (on average 39.24390243902439) internal successors, (1609), 41 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:44:41,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:41,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 106 [2024-11-10 14:44:41,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand