./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 17:18:22,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:18:22,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:18:22,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:18:22,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:18:22,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:18:22,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:18:22,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:18:22,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:18:22,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:18:22,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:18:22,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:18:22,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:18:22,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:18:22,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:18:22,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:18:22,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:18:22,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:18:22,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:18:22,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:18:22,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:18:22,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:18:22,121 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:18:22,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:18:22,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:18:22,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:18:22,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:18:22,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:18:22,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:18:22,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:18:22,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:18:22,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:18:22,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:18:22,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:18:22,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:18:22,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:18:22,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:18:22,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:18:22,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:18:22,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:18:22,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:18:22,126 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-10-14 17:18:22,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:18:22,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:18:22,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:18:22,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:18:22,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:18:22,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-10-14 17:18:23,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:18:23,725 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:18:23,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2024-10-14 17:18:23,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98483a790/2bce3d3accef4035b2cdab1ac85f141a/FLAG548ccb461 [2024-10-14 17:18:23,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98483a790/2bce3d3accef4035b2cdab1ac85f141a [2024-10-14 17:18:23,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:18:23,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:18:23,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:18:23,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:18:23,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:18:23,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:18:23" (1/1) ... [2024-10-14 17:18:23,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b2a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:23, skipping insertion in model container [2024-10-14 17:18:23,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:18:23" (1/1) ... [2024-10-14 17:18:23,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:18:24,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:18:24,148 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:18:24,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:18:24,240 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:18:24,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24 WrapperNode [2024-10-14 17:18:24,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:18:24,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:18:24,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:18:24,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:18:24,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,284 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-10-14 17:18:24,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:18:24,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:18:24,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:18:24,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:18:24,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:18:24,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:18:24,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:18:24,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:18:24,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (1/1) ... [2024-10-14 17:18:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:18:24,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:18:24,346 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-10-14 17:18:24,348 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-10-14 17:18:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:18:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:18:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:18:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:18:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-14 17:18:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-14 17:18:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:18:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:18:24,384 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:18:24,471 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:18:24,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:18:24,606 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:18:24,607 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:18:24,618 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:18:24,618 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:18:24,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:18:24 BoogieIcfgContainer [2024-10-14 17:18:24,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:18:24,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:18:24,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:18:24,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:18:24,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:18:23" (1/3) ... [2024-10-14 17:18:24,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9ee03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:18:24, skipping insertion in model container [2024-10-14 17:18:24,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:18:24" (2/3) ... [2024-10-14 17:18:24,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9ee03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:18:24, skipping insertion in model container [2024-10-14 17:18:24,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:18:24" (3/3) ... [2024-10-14 17:18:24,626 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2024-10-14 17:18:24,638 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:18:24,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 17:18:24,638 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:18:24,692 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:18:24,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 85 transitions, 177 flow [2024-10-14 17:18:24,770 INFO L124 PetriNetUnfolderBase]: 6/119 cut-off events. [2024-10-14 17:18:24,771 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:18:24,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 119 events. 6/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2024-10-14 17:18:24,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 85 transitions, 177 flow [2024-10-14 17:18:24,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 85 transitions, 177 flow [2024-10-14 17:18:24,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:18:24,794 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;@199e6ba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:18:24,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-14 17:18:24,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:18:24,807 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-10-14 17:18:24,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:18:24,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:24,808 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] [2024-10-14 17:18:24,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-14 17:18:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 707406292, now seen corresponding path program 1 times [2024-10-14 17:18:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765540536] [2024-10-14 17:18:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765540536] [2024-10-14 17:18:25,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765540536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:25,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:25,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325909244] [2024-10-14 17:18:25,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:18:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:25,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:18:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:18:25,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 85 [2024-10-14 17:18:25,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:25,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:25,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 85 [2024-10-14 17:18:25,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:25,335 INFO L124 PetriNetUnfolderBase]: 1/120 cut-off events. [2024-10-14 17:18:25,336 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:18:25,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 120 events. 1/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 22. Up to 16 conditions per place. [2024-10-14 17:18:25,338 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 11 selfloop transitions, 2 changer transitions 6/87 dead transitions. [2024-10-14 17:18:25,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 217 flow [2024-10-14 17:18:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2024-10-14 17:18:25,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2024-10-14 17:18:25,350 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 177 flow. Second operand 6 states and 438 transitions. [2024-10-14 17:18:25,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 217 flow [2024-10-14 17:18:25,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:25,355 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 187 flow [2024-10-14 17:18:25,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-10-14 17:18:25,359 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2024-10-14 17:18:25,359 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 187 flow [2024-10-14 17:18:25,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:25,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:25,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:25,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:18:25,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-14 17:18:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1690337444, now seen corresponding path program 1 times [2024-10-14 17:18:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184683228] [2024-10-14 17:18:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184683228] [2024-10-14 17:18:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184683228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806733775] [2024-10-14 17:18:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:25,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2024-10-14 17:18:25,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:25,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:25,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2024-10-14 17:18:25,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:26,017 INFO L124 PetriNetUnfolderBase]: 70/365 cut-off events. [2024-10-14 17:18:26,017 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2024-10-14 17:18:26,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 365 events. 70/365 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1723 event pairs, 32 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 504. Up to 150 conditions per place. [2024-10-14 17:18:26,020 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 23 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-10-14 17:18:26,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 319 flow [2024-10-14 17:18:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2024-10-14 17:18:26,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7725490196078432 [2024-10-14 17:18:26,023 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 187 flow. Second operand 6 states and 394 transitions. [2024-10-14 17:18:26,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 319 flow [2024-10-14 17:18:26,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 305 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 17:18:26,026 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 323 flow [2024-10-14 17:18:26,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2024-10-14 17:18:26,029 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2024-10-14 17:18:26,029 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 323 flow [2024-10-14 17:18:26,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:26,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:26,030 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:26,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:18:26,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-14 17:18:26,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -649763536, now seen corresponding path program 1 times [2024-10-14 17:18:26,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057455601] [2024-10-14 17:18:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057455601] [2024-10-14 17:18:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057455601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566961662] [2024-10-14 17:18:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:26,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2024-10-14 17:18:26,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:26,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:26,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2024-10-14 17:18:26,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:26,483 INFO L124 PetriNetUnfolderBase]: 130/487 cut-off events. [2024-10-14 17:18:26,483 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2024-10-14 17:18:26,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 487 events. 130/487 cut-off events. For 142/176 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2451 event pairs, 23 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 987. Up to 238 conditions per place. [2024-10-14 17:18:26,486 INFO L140 encePairwiseOnDemand]: 70/85 looper letters, 33 selfloop transitions, 48 changer transitions 7/145 dead transitions. [2024-10-14 17:18:26,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 641 flow [2024-10-14 17:18:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2024-10-14 17:18:26,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2024-10-14 17:18:26,489 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 323 flow. Second operand 6 states and 435 transitions. [2024-10-14 17:18:26,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 641 flow [2024-10-14 17:18:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:26,496 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 697 flow [2024-10-14 17:18:26,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2024-10-14 17:18:26,497 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2024-10-14 17:18:26,498 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 697 flow [2024-10-14 17:18:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:26,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:26,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:18:26,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-14 17:18:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -535742198, now seen corresponding path program 1 times [2024-10-14 17:18:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323250477] [2024-10-14 17:18:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:18:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323250477] [2024-10-14 17:18:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323250477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67848797] [2024-10-14 17:18:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:26,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 85 [2024-10-14 17:18:26,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:26,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:26,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 85 [2024-10-14 17:18:26,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:26,929 INFO L124 PetriNetUnfolderBase]: 142/522 cut-off events. [2024-10-14 17:18:26,929 INFO L125 PetriNetUnfolderBase]: For 548/675 co-relation queries the response was YES. [2024-10-14 17:18:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 522 events. 142/522 cut-off events. For 548/675 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2871 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1481. Up to 241 conditions per place. [2024-10-14 17:18:26,933 INFO L140 encePairwiseOnDemand]: 74/85 looper letters, 73 selfloop transitions, 25 changer transitions 13/166 dead transitions. [2024-10-14 17:18:26,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 1080 flow [2024-10-14 17:18:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-10-14 17:18:26,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7901960784313725 [2024-10-14 17:18:26,934 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 697 flow. Second operand 6 states and 403 transitions. [2024-10-14 17:18:26,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 1080 flow [2024-10-14 17:18:26,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1062 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:26,947 INFO L231 Difference]: Finished difference. Result has 107 places, 153 transitions, 914 flow [2024-10-14 17:18:26,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=107, PETRI_TRANSITIONS=153} [2024-10-14 17:18:26,948 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2024-10-14 17:18:26,948 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 914 flow [2024-10-14 17:18:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:26,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:26,949 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 17:18:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:18:26,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-14 17:18:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 225505610, now seen corresponding path program 1 times [2024-10-14 17:18:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498446870] [2024-10-14 17:18:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:18:26,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:18:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:18:27,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:18:27,001 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:18:27,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-14 17:18:27,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-14 17:18:27,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-14 17:18:27,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-14 17:18:27,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-14 17:18:27,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:18:27,005 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 17:18:27,007 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:18:27,007 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 17:18:27,026 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:18:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 104 transitions, 224 flow [2024-10-14 17:18:27,051 INFO L124 PetriNetUnfolderBase]: 11/205 cut-off events. [2024-10-14 17:18:27,051 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:18:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 205 events. 11/205 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 395 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2024-10-14 17:18:27,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 104 transitions, 224 flow [2024-10-14 17:18:27,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 104 transitions, 224 flow [2024-10-14 17:18:27,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:18:27,055 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;@199e6ba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:18:27,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 17:18:27,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:18:27,059 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-10-14 17:18:27,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:18:27,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:27,059 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] [2024-10-14 17:18:27,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:27,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1757470764, now seen corresponding path program 1 times [2024-10-14 17:18:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787569769] [2024-10-14 17:18:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787569769] [2024-10-14 17:18:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787569769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899519804] [2024-10-14 17:18:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:27,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:18:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:27,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:18:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:18:27,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 104 [2024-10-14 17:18:27,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:27,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:27,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 104 [2024-10-14 17:18:27,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:27,200 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2024-10-14 17:18:27,201 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-14 17:18:27,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 203 events. 3/203 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 426 event pairs, 0 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 143. Up to 32 conditions per place. [2024-10-14 17:18:27,202 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 14 selfloop transitions, 2 changer transitions 6/107 dead transitions. [2024-10-14 17:18:27,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 272 flow [2024-10-14 17:18:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2024-10-14 17:18:27,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8701923076923077 [2024-10-14 17:18:27,203 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 224 flow. Second operand 6 states and 543 transitions. [2024-10-14 17:18:27,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 272 flow [2024-10-14 17:18:27,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:27,205 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 238 flow [2024-10-14 17:18:27,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-10-14 17:18:27,206 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2024-10-14 17:18:27,206 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 238 flow [2024-10-14 17:18:27,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:27,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:27,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:27,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:18:27,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1786749756, now seen corresponding path program 1 times [2024-10-14 17:18:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846363743] [2024-10-14 17:18:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846363743] [2024-10-14 17:18:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846363743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409655015] [2024-10-14 17:18:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:27,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:27,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 104 [2024-10-14 17:18:27,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:27,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:27,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 104 [2024-10-14 17:18:27,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:27,744 INFO L124 PetriNetUnfolderBase]: 902/2767 cut-off events. [2024-10-14 17:18:27,744 INFO L125 PetriNetUnfolderBase]: For 186/192 co-relation queries the response was YES. [2024-10-14 17:18:27,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2767 events. 902/2767 cut-off events. For 186/192 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 21368 event pairs, 529 based on Foata normal form. 0/2526 useless extension candidates. Maximal degree in co-relation 3139. Up to 1384 conditions per place. [2024-10-14 17:18:27,755 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 31 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2024-10-14 17:18:27,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 457 flow [2024-10-14 17:18:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2024-10-14 17:18:27,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7932692307692307 [2024-10-14 17:18:27,756 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 238 flow. Second operand 6 states and 495 transitions. [2024-10-14 17:18:27,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 457 flow [2024-10-14 17:18:27,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 445 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 17:18:27,759 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 480 flow [2024-10-14 17:18:27,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2024-10-14 17:18:27,760 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2024-10-14 17:18:27,761 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 480 flow [2024-10-14 17:18:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:27,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:27,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:18:27,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2001006567, now seen corresponding path program 1 times [2024-10-14 17:18:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767884361] [2024-10-14 17:18:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767884361] [2024-10-14 17:18:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767884361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846928465] [2024-10-14 17:18:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:27,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2024-10-14 17:18:27,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:27,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:27,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2024-10-14 17:18:27,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:28,506 INFO L124 PetriNetUnfolderBase]: 1867/4768 cut-off events. [2024-10-14 17:18:28,506 INFO L125 PetriNetUnfolderBase]: For 1555/1771 co-relation queries the response was YES. [2024-10-14 17:18:28,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10955 conditions, 4768 events. 1867/4768 cut-off events. For 1555/1771 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37844 event pairs, 439 based on Foata normal form. 0/4460 useless extension candidates. Maximal degree in co-relation 8715. Up to 2583 conditions per place. [2024-10-14 17:18:28,529 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 63 selfloop transitions, 92 changer transitions 0/233 dead transitions. [2024-10-14 17:18:28,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 1226 flow [2024-10-14 17:18:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2024-10-14 17:18:28,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8701923076923077 [2024-10-14 17:18:28,531 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 480 flow. Second operand 6 states and 543 transitions. [2024-10-14 17:18:28,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 1226 flow [2024-10-14 17:18:28,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:28,538 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 1316 flow [2024-10-14 17:18:28,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=125, PETRI_TRANSITIONS=225} [2024-10-14 17:18:28,540 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2024-10-14 17:18:28,540 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 1316 flow [2024-10-14 17:18:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:28,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:28,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:28,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:18:28,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1723336065, now seen corresponding path program 1 times [2024-10-14 17:18:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914887163] [2024-10-14 17:18:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:18:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914887163] [2024-10-14 17:18:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914887163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340791] [2024-10-14 17:18:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:18:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:18:28,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:18:28,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-10-14 17:18:28,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 225 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:28,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:28,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-10-14 17:18:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:29,351 INFO L124 PetriNetUnfolderBase]: 2321/5745 cut-off events. [2024-10-14 17:18:29,351 INFO L125 PetriNetUnfolderBase]: For 5611/6308 co-relation queries the response was YES. [2024-10-14 17:18:29,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17696 conditions, 5745 events. 2321/5745 cut-off events. For 5611/6308 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 46840 event pairs, 295 based on Foata normal form. 2/5511 useless extension candidates. Maximal degree in co-relation 14366. Up to 3135 conditions per place. [2024-10-14 17:18:29,453 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 145 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2024-10-14 17:18:29,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2250 flow [2024-10-14 17:18:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:18:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:18:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2024-10-14 17:18:29,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8108974358974359 [2024-10-14 17:18:29,455 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 1316 flow. Second operand 6 states and 506 transitions. [2024-10-14 17:18:29,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2250 flow [2024-10-14 17:18:29,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2232 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:29,478 INFO L231 Difference]: Finished difference. Result has 135 places, 296 transitions, 2156 flow [2024-10-14 17:18:29,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=135, PETRI_TRANSITIONS=296} [2024-10-14 17:18:29,479 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2024-10-14 17:18:29,479 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 296 transitions, 2156 flow [2024-10-14 17:18:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:29,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:29,480 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:29,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:18:29,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:29,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -426431938, now seen corresponding path program 1 times [2024-10-14 17:18:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596154216] [2024-10-14 17:18:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596154216] [2024-10-14 17:18:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596154216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:18:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995740375] [2024-10-14 17:18:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:29,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:18:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:18:29,807 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-10-14 17:18:29,809 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-10-14 17:18:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:29,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:18:29,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:18:29,932 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-10-14 17:18:29,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:18:29,976 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-10-14 17:18:30,057 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-10-14 17:18:30,073 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-10-14 17:18:30,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:30,091 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-10-14 17:18:30,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:30,120 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-10-14 17:18:30,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-14 17:18:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:30,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:18:30,198 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2024-10-14 17:18:30,240 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_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_227 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_227) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-10-14 17:18:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995740375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:18:34,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:18:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-10-14 17:18:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407779869] [2024-10-14 17:18:34,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:18:34,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:18:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:18:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=219, Unknown=10, NotChecked=62, Total=342 [2024-10-14 17:18:34,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 104 [2024-10-14 17:18:34,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 296 transitions, 2156 flow. Second operand has 19 states, 19 states have (on average 54.89473684210526) internal successors, (1043), 19 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:34,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:34,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 104 [2024-10-14 17:18:34,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:38,708 INFO L124 PetriNetUnfolderBase]: 9369/19112 cut-off events. [2024-10-14 17:18:38,709 INFO L125 PetriNetUnfolderBase]: For 29740/29791 co-relation queries the response was YES. [2024-10-14 17:18:38,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62821 conditions, 19112 events. 9369/19112 cut-off events. For 29740/29791 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 169911 event pairs, 471 based on Foata normal form. 257/18601 useless extension candidates. Maximal degree in co-relation 56252. Up to 4911 conditions per place. [2024-10-14 17:18:38,837 INFO L140 encePairwiseOnDemand]: 80/104 looper letters, 898 selfloop transitions, 613 changer transitions 27/1593 dead transitions. [2024-10-14 17:18:38,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1593 transitions, 13755 flow [2024-10-14 17:18:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-14 17:18:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2024-10-14 17:18:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4226 transitions. [2024-10-14 17:18:38,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6251479289940829 [2024-10-14 17:18:38,846 INFO L175 Difference]: Start difference. First operand has 135 places, 296 transitions, 2156 flow. Second operand 65 states and 4226 transitions. [2024-10-14 17:18:38,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1593 transitions, 13755 flow [2024-10-14 17:18:38,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1593 transitions, 13279 flow, removed 238 selfloop flow, removed 0 redundant places. [2024-10-14 17:18:38,968 INFO L231 Difference]: Finished difference. Result has 225 places, 948 transitions, 9073 flow [2024-10-14 17:18:38,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=9073, PETRI_PLACES=225, PETRI_TRANSITIONS=948} [2024-10-14 17:18:38,970 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2024-10-14 17:18:38,970 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 948 transitions, 9073 flow [2024-10-14 17:18:38,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 54.89473684210526) internal successors, (1043), 19 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:38,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:38,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:38,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:18:39,172 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-10-14 17:18:39,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -149081666, now seen corresponding path program 1 times [2024-10-14 17:18:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948586893] [2024-10-14 17:18:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948586893] [2024-10-14 17:18:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948586893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:18:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781295278] [2024-10-14 17:18:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:18:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:18:39,688 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-10-14 17:18:39,689 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-10-14 17:18:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:39,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:18:39,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:18:39,763 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-10-14 17:18:39,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:18:39,774 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-10-14 17:18:39,826 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-10-14 17:18:39,851 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-10-14 17:18:39,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:39,883 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-10-14 17:18:39,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:39,924 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-10-14 17:18:40,087 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-10-14 17:18:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:40,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:18:40,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-10-14 17:18:42,151 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_286 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_286) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-14 17:18:45,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:45,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-14 17:18:45,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:45,907 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 81 treesize of output 38 [2024-10-14 17:18:45,910 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 9 treesize of output 3 [2024-10-14 17:18:45,916 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:45,916 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-10-14 17:18:45,925 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:45,926 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-10-14 17:18:45,930 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:45,930 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-10-14 17:18:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781295278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:18:45,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:18:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-10-14 17:18:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257620594] [2024-10-14 17:18:45,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:18:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 17:18:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 17:18:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=580, Unknown=60, NotChecked=106, Total=870 [2024-10-14 17:18:46,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-10-14 17:18:46,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 948 transitions, 9073 flow. Second operand has 30 states, 30 states have (on average 50.733333333333334) internal successors, (1522), 30 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-10-14 17:18:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:51,472 INFO L124 PetriNetUnfolderBase]: 10285/21769 cut-off events. [2024-10-14 17:18:51,472 INFO L125 PetriNetUnfolderBase]: For 132039/133414 co-relation queries the response was YES. [2024-10-14 17:18:51,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95929 conditions, 21769 events. 10285/21769 cut-off events. For 132039/133414 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 200524 event pairs, 1228 based on Foata normal form. 236/20952 useless extension candidates. Maximal degree in co-relation 93369. Up to 5166 conditions per place. [2024-10-14 17:18:51,628 INFO L140 encePairwiseOnDemand]: 73/104 looper letters, 1044 selfloop transitions, 517 changer transitions 99/1726 dead transitions. [2024-10-14 17:18:51,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1726 transitions, 19201 flow [2024-10-14 17:18:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-14 17:18:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2024-10-14 17:18:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2572 transitions. [2024-10-14 17:18:51,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6182692307692308 [2024-10-14 17:18:51,634 INFO L175 Difference]: Start difference. First operand has 225 places, 948 transitions, 9073 flow. Second operand 40 states and 2572 transitions. [2024-10-14 17:18:51,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1726 transitions, 19201 flow [2024-10-14 17:18:52,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1726 transitions, 18817 flow, removed 185 selfloop flow, removed 3 redundant places. [2024-10-14 17:18:52,435 INFO L231 Difference]: Finished difference. Result has 279 places, 1190 transitions, 12591 flow [2024-10-14 17:18:52,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=8697, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=12591, PETRI_PLACES=279, PETRI_TRANSITIONS=1190} [2024-10-14 17:18:52,436 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 175 predicate places. [2024-10-14 17:18:52,436 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 1190 transitions, 12591 flow [2024-10-14 17:18:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.733333333333334) internal successors, (1522), 30 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:52,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:52,437 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:52,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 17:18:52,637 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-10-14 17:18:52,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:18:52,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -612432030, now seen corresponding path program 2 times [2024-10-14 17:18:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021452766] [2024-10-14 17:18:52,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021452766] [2024-10-14 17:18:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021452766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:18:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703874480] [2024-10-14 17:18:52,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:18:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:18:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:18:52,927 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-10-14 17:18:52,928 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-10-14 17:18:52,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:18:52,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:18:52,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 17:18:53,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:18:53,005 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-10-14 17:18:53,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:18:53,044 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-10-14 17:18:53,192 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-10-14 17:18:53,221 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-10-14 17:18:53,260 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-10-14 17:18:53,303 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-10-14 17:18:53,351 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-10-14 17:18:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:53,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:18:55,302 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_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)))))) is different from false [2024-10-14 17:18:55,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3))) (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) .cse2 0)))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse3)) 0)))))) is different from false [2024-10-14 17:18:55,330 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| 1 .cse2)) (.cse4 (+ |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 (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_345 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_345) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-10-14 17:18:55,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-14 17:18:55,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:18:55,345 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 81 treesize of output 38 [2024-10-14 17:18:55,348 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 9 treesize of output 3 [2024-10-14 17:18:55,351 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:55,352 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-10-14 17:18:55,356 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:55,356 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-10-14 17:18:55,361 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:18:55,361 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-10-14 17:18:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:55,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703874480] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:18:55,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:18:55,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-10-14 17:18:55,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526759053] [2024-10-14 17:18:55,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:18:55,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 17:18:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 17:18:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=747, Unknown=15, NotChecked=174, Total=1056 [2024-10-14 17:18:55,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 104 [2024-10-14 17:18:55,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1190 transitions, 12591 flow. Second operand has 33 states, 33 states have (on average 50.90909090909091) internal successors, (1680), 33 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:18:55,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:55,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 104 [2024-10-14 17:18:55,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:04,480 INFO L124 PetriNetUnfolderBase]: 15595/31801 cut-off events. [2024-10-14 17:19:04,481 INFO L125 PetriNetUnfolderBase]: For 234638/235615 co-relation queries the response was YES. [2024-10-14 17:19:04,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159087 conditions, 31801 events. 15595/31801 cut-off events. For 234638/235615 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 305241 event pairs, 755 based on Foata normal form. 655/30852 useless extension candidates. Maximal degree in co-relation 158583. Up to 8563 conditions per place. [2024-10-14 17:19:04,762 INFO L140 encePairwiseOnDemand]: 78/104 looper letters, 1546 selfloop transitions, 1025 changer transitions 43/2680 dead transitions. [2024-10-14 17:19:04,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 2680 transitions, 34793 flow [2024-10-14 17:19:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-14 17:19:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2024-10-14 17:19:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3333 transitions. [2024-10-14 17:19:04,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.593482905982906 [2024-10-14 17:19:04,766 INFO L175 Difference]: Start difference. First operand has 279 places, 1190 transitions, 12591 flow. Second operand 54 states and 3333 transitions. [2024-10-14 17:19:04,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 2680 transitions, 34793 flow [2024-10-14 17:19:07,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 2680 transitions, 34017 flow, removed 145 selfloop flow, removed 11 redundant places. [2024-10-14 17:19:07,932 INFO L231 Difference]: Finished difference. Result has 341 places, 1909 transitions, 25187 flow [2024-10-14 17:19:07,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=12159, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=25187, PETRI_PLACES=341, PETRI_TRANSITIONS=1909} [2024-10-14 17:19:07,933 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 237 predicate places. [2024-10-14 17:19:07,933 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 1909 transitions, 25187 flow [2024-10-14 17:19:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 50.90909090909091) internal successors, (1680), 33 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:19:07,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:07,934 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:07,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:19:08,134 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-10-14 17:19:08,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:19:08,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash -200793396, now seen corresponding path program 3 times [2024-10-14 17:19:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843454036] [2024-10-14 17:19:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843454036] [2024-10-14 17:19:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843454036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:19:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738199662] [2024-10-14 17:19:08,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:19:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:08,564 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-10-14 17:19:08,565 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-10-14 17:19:08,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:19:08,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:19:08,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 17:19:08,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:19:08,714 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-10-14 17:19:08,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:19:08,774 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-10-14 17:19:08,958 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-10-14 17:19:08,990 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-10-14 17:19:09,029 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-10-14 17:19:09,104 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-10-14 17:19:09,229 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-10-14 17:19:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:09,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:19:09,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)))) is different from false [2024-10-14 17:19:09,391 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_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) 0)))))) is different from false [2024-10-14 17:19:09,405 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_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)))))) is different from false [2024-10-14 17:19:09,416 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_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-14 17:19:09,429 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| 1 .cse2)) (.cse4 (+ |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|) .cse3 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_404) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-10-14 17:19:09,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:19:09,443 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-10-14 17:19:09,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:19:09,447 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-10-14 17:19:09,450 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-10-14 17:19:09,456 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:09,457 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-10-14 17:19:09,461 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:09,461 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-10-14 17:19:09,464 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:09,464 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-10-14 17:19:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738199662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:19:09,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:19:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-10-14 17:19:09,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264265173] [2024-10-14 17:19:09,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:19:09,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-14 17:19:09,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-14 17:19:09,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1244, Unknown=20, NotChecked=380, Total=1806 [2024-10-14 17:19:09,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-10-14 17:19:09,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1909 transitions, 25187 flow. Second operand has 43 states, 43 states have (on average 41.25581395348837) internal successors, (1774), 43 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:19:09,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:09,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-10-14 17:19:09,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:22,092 INFO L124 PetriNetUnfolderBase]: 16695/34676 cut-off events. [2024-10-14 17:19:22,092 INFO L125 PetriNetUnfolderBase]: For 471480/473733 co-relation queries the response was YES. [2024-10-14 17:19:22,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201815 conditions, 34676 events. 16695/34676 cut-off events. For 471480/473733 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 340937 event pairs, 1907 based on Foata normal form. 733/33665 useless extension candidates. Maximal degree in co-relation 201221. Up to 8974 conditions per place. [2024-10-14 17:19:22,486 INFO L140 encePairwiseOnDemand]: 67/104 looper letters, 1675 selfloop transitions, 1035 changer transitions 124/2891 dead transitions. [2024-10-14 17:19:22,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 2891 transitions, 43914 flow [2024-10-14 17:19:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-14 17:19:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2024-10-14 17:19:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 2838 transitions. [2024-10-14 17:19:22,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5053418803418803 [2024-10-14 17:19:22,489 INFO L175 Difference]: Start difference. First operand has 341 places, 1909 transitions, 25187 flow. Second operand 54 states and 2838 transitions. [2024-10-14 17:19:22,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 2891 transitions, 43914 flow [2024-10-14 17:19:27,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 2891 transitions, 43231 flow, removed 243 selfloop flow, removed 25 redundant places. [2024-10-14 17:19:27,229 INFO L231 Difference]: Finished difference. Result has 385 places, 2100 transitions, 31202 flow [2024-10-14 17:19:27,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=24641, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=848, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=31202, PETRI_PLACES=385, PETRI_TRANSITIONS=2100} [2024-10-14 17:19:27,231 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, 281 predicate places. [2024-10-14 17:19:27,231 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 2100 transitions, 31202 flow [2024-10-14 17:19:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 41.25581395348837) internal successors, (1774), 43 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:19:27,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:27,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:27,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:19:27,432 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-10-14 17:19:27,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-14 17:19:27,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash -741761498, now seen corresponding path program 4 times [2024-10-14 17:19:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674420094] [2024-10-14 17:19:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674420094] [2024-10-14 17:19:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674420094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:19:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616923237] [2024-10-14 17:19:27,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:19:27,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:27,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:27,765 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-10-14 17:19:27,766 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-10-14 17:19:27,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:19:27,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:19:27,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:19:27,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:19:27,915 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-10-14 17:19:28,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:19:28,004 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-10-14 17:19:28,190 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-10-14 17:19:28,262 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-10-14 17:19:28,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-14 17:19:28,327 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-10-14 17:19:28,370 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-10-14 17:19:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:28,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:19:28,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)))) is different from false [2024-10-14 17:19:28,427 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_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)))))) is different from false [2024-10-14 17:19:28,437 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_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2024-10-14 17:19:28,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-10-14 17:19:28,480 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)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.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 (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_463) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2024-10-14 17:19:28,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:19:28,491 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-10-14 17:19:28,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:19:28,497 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-10-14 17:19:28,500 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-10-14 17:19:28,504 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:28,504 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-10-14 17:19:28,508 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:28,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-14 17:19:28,512 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:19:28,512 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-10-14 17:19:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616923237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:19:28,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:19:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 40 [2024-10-14 17:19:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042191753] [2024-10-14 17:19:28,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:19:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 17:19:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 17:19:28,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1133, Unknown=5, NotChecked=360, Total=1640 [2024-10-14 17:19:28,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 104 [2024-10-14 17:19:28,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 2100 transitions, 31202 flow. Second operand has 41 states, 41 states have (on average 37.24390243902439) internal successors, (1527), 41 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:19:28,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:28,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 104 [2024-10-14 17:19:28,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand