./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-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d 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-tid.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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:03:54,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:03:55,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:03:55,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:03:55,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:03:55,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:03:55,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:03:55,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:03:55,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:03:55,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:03:55,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:03:55,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:03:55,062 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:03:55,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:03:55,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:03:55,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:03:55,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:03:55,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:03:55,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:03:55,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:03:55,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:03:55,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:03:55,069 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:03:55,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:03:55,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:03:55,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:03:55,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:03:55,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:03:55,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:03:55,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:03:55,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:03:55,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:03:55,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:03:55,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:03:55,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:03:55,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:03:55,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:03:55,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:03:55,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:03:55,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:03:55,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:03:55,075 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2024-10-13 10:03:55,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:03:55,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:03:55,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:03:55,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:03:55,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:03:55,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-13 10:03:56,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:03:57,159 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:03:57,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-13 10:03:57,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f870f3a1/7158b83220d94c28a440e17ffe7564e6/FLAG84aa17826 [2024-10-13 10:03:57,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f870f3a1/7158b83220d94c28a440e17ffe7564e6 [2024-10-13 10:03:57,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:03:57,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:03:57,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:03:57,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:03:57,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:03:57,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54096f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57, skipping insertion in model container [2024-10-13 10:03:57,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:03:57,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:03:57,725 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:03:57,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:03:57,868 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:03:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57 WrapperNode [2024-10-13 10:03:57,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:03:57,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:03:57,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:03:57,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:03:57,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,927 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-13 10:03:57,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:03:57,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:03:57,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:03:57,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:03:57,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:03:57,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:03:57,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:03:57,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:03:57,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (1/1) ... [2024-10-13 10:03:57,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:03:57,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:03:58,003 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-13 10:03:58,005 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-13 10:03:58,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-13 10:03:58,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-13 10:03:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:03:58,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:03:58,043 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:03:58,161 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:03:58,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:03:58,404 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:03:58,404 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:03:58,422 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:03:58,422 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:03:58,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:03:58 BoogieIcfgContainer [2024-10-13 10:03:58,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:03:58,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:03:58,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:03:58,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:03:58,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:03:57" (1/3) ... [2024-10-13 10:03:58,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289533a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:03:58, skipping insertion in model container [2024-10-13 10:03:58,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:57" (2/3) ... [2024-10-13 10:03:58,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289533a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:03:58, skipping insertion in model container [2024-10-13 10:03:58,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:03:58" (3/3) ... [2024-10-13 10:03:58,431 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2024-10-13 10:03:58,446 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:03:58,447 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 10:03:58,447 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:03:58,509 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 10:03:58,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 110 transitions, 227 flow [2024-10-13 10:03:58,611 INFO L124 PetriNetUnfolderBase]: 6/160 cut-off events. [2024-10-13 10:03:58,612 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 10:03:58,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 160 events. 6/160 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 223 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2024-10-13 10:03:58,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 110 transitions, 227 flow [2024-10-13 10:03:58,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 110 transitions, 227 flow [2024-10-13 10:03:58,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:03:58,638 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;@605c9181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:03:58,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 10:03:58,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:03:58,649 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-10-13 10:03:58,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:03:58,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:58,650 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-13 10:03:58,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:03:58,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1099474648, now seen corresponding path program 1 times [2024-10-13 10:03:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177643676] [2024-10-13 10:03:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:59,071 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-13 10:03:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177643676] [2024-10-13 10:03:59,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177643676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:59,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:03:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873526645] [2024-10-13 10:03:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:03:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:03:59,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:03:59,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 110 [2024-10-13 10:03:59,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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-13 10:03:59,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:59,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 110 [2024-10-13 10:03:59,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:59,382 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2024-10-13 10:03:59,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:03:59,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 178 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2024-10-13 10:03:59,386 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2024-10-13 10:03:59,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2024-10-13 10:03:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:03:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:03:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2024-10-13 10:03:59,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909090909090909 [2024-10-13 10:03:59,407 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 227 flow. Second operand 6 states and 588 transitions. [2024-10-13 10:03:59,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2024-10-13 10:03:59,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:03:59,419 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2024-10-13 10:03:59,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2024-10-13 10:03:59,427 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2024-10-13 10:03:59,428 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2024-10-13 10:03:59,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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-13 10:03:59,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:59,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:59,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:03:59,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:03:59,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1971613969, now seen corresponding path program 1 times [2024-10-13 10:03:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888020324] [2024-10-13 10:03:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:59,944 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-13 10:03:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888020324] [2024-10-13 10:03:59,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888020324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:59,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:59,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:03:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992370500] [2024-10-13 10:03:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:59,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:03:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:03:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:00,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 110 [2024-10-13 10:04:00,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 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-13 10:04:00,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:00,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 110 [2024-10-13 10:04:00,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:00,491 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2024-10-13 10:04:00,492 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-13 10:04:00,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2454 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2024-10-13 10:04:00,499 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-10-13 10:04:00,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2024-10-13 10:04:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-10-13 10:04:00,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-10-13 10:04:00,503 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2024-10-13 10:04:00,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2024-10-13 10:04:00,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-13 10:04:00,508 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2024-10-13 10:04:00,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2024-10-13 10:04:00,510 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-10-13 10:04:00,510 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2024-10-13 10:04:00,510 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-13 10:04:00,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:00,511 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] [2024-10-13 10:04:00,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:04:00,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -273716679, now seen corresponding path program 1 times [2024-10-13 10:04:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106107487] [2024-10-13 10:04:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:00,850 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-13 10:04:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106107487] [2024-10-13 10:04:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106107487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:00,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454415568] [2024-10-13 10:04:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:00,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2024-10-13 10:04:00,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-13 10:04:00,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:00,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2024-10-13 10:04:00,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:01,106 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2024-10-13 10:04:01,110 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2024-10-13 10:04:01,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2794 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2024-10-13 10:04:01,115 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2024-10-13 10:04:01,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2024-10-13 10:04:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-10-13 10:04:01,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484848484848485 [2024-10-13 10:04:01,118 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2024-10-13 10:04:01,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2024-10-13 10:04:01,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:01,126 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2024-10-13 10:04:01,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2024-10-13 10:04:01,127 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2024-10-13 10:04:01,128 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2024-10-13 10:04:01,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-13 10:04:01,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:01,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:01,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:04:01,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:01,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -624886610, now seen corresponding path program 1 times [2024-10-13 10:04:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603962858] [2024-10-13 10:04:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:01,482 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-13 10:04:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603962858] [2024-10-13 10:04:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603962858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:01,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208869550] [2024-10-13 10:04:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:01,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:01,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2024-10-13 10:04:01,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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-13 10:04:01,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:01,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2024-10-13 10:04:01,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:01,852 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2024-10-13 10:04:01,853 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2024-10-13 10:04:01,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5323 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2024-10-13 10:04:01,862 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2024-10-13 10:04:01,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2024-10-13 10:04:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2024-10-13 10:04:01,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.843939393939394 [2024-10-13 10:04:01,865 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2024-10-13 10:04:01,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2024-10-13 10:04:01,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:01,879 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2024-10-13 10:04:01,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2024-10-13 10:04:01,880 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2024-10-13 10:04:01,880 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2024-10-13 10:04:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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-13 10:04:01,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:01,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:04:01,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1210714979, now seen corresponding path program 1 times [2024-10-13 10:04:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370910823] [2024-10-13 10:04:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:02,231 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-13 10:04:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370910823] [2024-10-13 10:04:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370910823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297297860] [2024-10-13 10:04:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:02,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2024-10-13 10:04:02,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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-13 10:04:02,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:02,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2024-10-13 10:04:02,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:02,786 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2024-10-13 10:04:02,787 INFO L125 PetriNetUnfolderBase]: For 1088/1180 co-relation queries the response was YES. [2024-10-13 10:04:02,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1088/1180 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6038 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2024-10-13 10:04:02,796 INFO L140 encePairwiseOnDemand]: 94/110 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2024-10-13 10:04:02,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2024-10-13 10:04:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2024-10-13 10:04:02,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-13 10:04:02,799 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2024-10-13 10:04:02,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2024-10-13 10:04:02,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:02,816 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2024-10-13 10:04:02,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2024-10-13 10:04:02,817 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2024-10-13 10:04:02,817 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2024-10-13 10:04:02,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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-13 10:04:02,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:02,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:02,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:04:02,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:02,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash 366262447, now seen corresponding path program 1 times [2024-10-13 10:04:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:02,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776542927] [2024-10-13 10:04:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:03,144 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-13 10:04:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:03,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776542927] [2024-10-13 10:04:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776542927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:03,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:04:03,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:04:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917654956] [2024-10-13 10:04:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:04:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:04:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:04:03,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 110 [2024-10-13 10:04:03,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-13 10:04:03,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:03,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 110 [2024-10-13 10:04:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:03,572 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2024-10-13 10:04:03,572 INFO L125 PetriNetUnfolderBase]: For 1949/2043 co-relation queries the response was YES. [2024-10-13 10:04:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1949/2043 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6703 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2024-10-13 10:04:03,582 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2024-10-13 10:04:03,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2024-10-13 10:04:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:04:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:04:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-10-13 10:04:03,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8242424242424242 [2024-10-13 10:04:03,585 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2024-10-13 10:04:03,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2024-10-13 10:04:03,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:03,606 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2024-10-13 10:04:03,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2024-10-13 10:04:03,608 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2024-10-13 10:04:03,608 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2024-10-13 10:04:03,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-13 10:04:03,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:03,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:04:03,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:03,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1030629718, now seen corresponding path program 1 times [2024-10-13 10:04:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:03,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117465893] [2024-10-13 10:04:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:04,157 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-13 10:04:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117465893] [2024-10-13 10:04:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117465893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091395126] [2024-10-13 10:04:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:04,161 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-13 10:04:04,162 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-13 10:04:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:04,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:04:04,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:04,344 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-13 10:04:04,382 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:04,383 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-13 10:04:04,468 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 13 treesize of output 9 [2024-10-13 10:04:04,480 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 23 treesize of output 22 [2024-10-13 10:04:04,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:04,507 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 32 treesize of output 34 [2024-10-13 10:04:04,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:04,532 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 41 treesize of output 46 [2024-10-13 10:04:04,566 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 45 treesize of output 34 [2024-10-13 10:04:04,578 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-13 10:04:04,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:04,633 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-13 10:04:04,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))) is different from false [2024-10-13 10:04:04,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-13 10:04:04,736 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-13 10:04:04,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:04,756 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 37 treesize of output 53 [2024-10-13 10:04:04,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:04,769 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 86 treesize of output 32 [2024-10-13 10:04:04,782 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-13 10:04:04,783 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 37 treesize of output 1 [2024-10-13 10:04:04,797 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-13 10:04:04,799 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 37 treesize of output 1 [2024-10-13 10:04:04,807 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-13 10:04:04,807 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 37 treesize of output 1 [2024-10-13 10:04:04,907 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-13 10:04:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091395126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:04,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-10-13 10:04:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201387118] [2024-10-13 10:04:04,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:04:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:04:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2024-10-13 10:04:04,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 110 [2024-10-13 10:04:04,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 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-13 10:04:04,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:04,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 110 [2024-10-13 10:04:04,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:07,286 INFO L124 PetriNetUnfolderBase]: 543/1476 cut-off events. [2024-10-13 10:04:07,286 INFO L125 PetriNetUnfolderBase]: For 2830/2830 co-relation queries the response was YES. [2024-10-13 10:04:07,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1476 events. 543/1476 cut-off events. For 2830/2830 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9296 event pairs, 41 based on Foata normal form. 23/1494 useless extension candidates. Maximal degree in co-relation 5582. Up to 350 conditions per place. [2024-10-13 10:04:07,299 INFO L140 encePairwiseOnDemand]: 85/110 looper letters, 290 selfloop transitions, 166 changer transitions 8/501 dead transitions. [2024-10-13 10:04:07,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 501 transitions, 4196 flow [2024-10-13 10:04:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 10:04:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-13 10:04:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2012 transitions. [2024-10-13 10:04:07,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5080808080808081 [2024-10-13 10:04:07,305 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2012 transitions. [2024-10-13 10:04:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 501 transitions, 4196 flow [2024-10-13 10:04:07,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 501 transitions, 4112 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-10-13 10:04:07,339 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2024-10-13 10:04:07,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2024-10-13 10:04:07,340 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2024-10-13 10:04:07,340 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2024-10-13 10:04:07,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 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-13 10:04:07,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:07,343 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:07,361 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-13 10:04:07,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:07,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 727956110, now seen corresponding path program 1 times [2024-10-13 10:04:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287619261] [2024-10-13 10:04:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:08,145 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-13 10:04:08,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287619261] [2024-10-13 10:04:08,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287619261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:08,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513593132] [2024-10-13 10:04:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:08,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:08,150 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-13 10:04:08,151 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-13 10:04:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:08,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 10:04:08,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:08,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:04:08,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:08,322 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-13 10:04:08,406 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-13 10:04:08,442 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-13 10:04:08,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:08,485 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-13 10:04:08,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:08,540 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-13 10:04:08,601 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-13 10:04:08,639 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-13 10:04:08,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:10,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-13 10:04:10,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:12,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:12,620 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-13 10:04:12,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:12,629 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-13 10:04:12,634 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-13 10:04:12,646 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:12,647 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-13 10:04:12,655 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:12,656 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-13 10:04:12,662 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:12,662 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-13 10:04:12,722 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-13 10:04:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513593132] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:12,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 25 [2024-10-13 10:04:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335299151] [2024-10-13 10:04:12,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:04:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:12,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:04:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=428, Unknown=32, NotChecked=90, Total=650 [2024-10-13 10:04:12,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-13 10:04:12,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 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-13 10:04:12,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:12,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-13 10:04:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:15,370 INFO L124 PetriNetUnfolderBase]: 738/2074 cut-off events. [2024-10-13 10:04:15,370 INFO L125 PetriNetUnfolderBase]: For 8047/8055 co-relation queries the response was YES. [2024-10-13 10:04:15,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9760 conditions, 2074 events. 738/2074 cut-off events. For 8047/8055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 14929 event pairs, 51 based on Foata normal form. 23/2093 useless extension candidates. Maximal degree in co-relation 9606. Up to 566 conditions per place. [2024-10-13 10:04:15,391 INFO L140 encePairwiseOnDemand]: 93/110 looper letters, 455 selfloop transitions, 97 changer transitions 17/612 dead transitions. [2024-10-13 10:04:15,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 612 transitions, 6695 flow [2024-10-13 10:04:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 10:04:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-10-13 10:04:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1586 transitions. [2024-10-13 10:04:15,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46510263929618767 [2024-10-13 10:04:15,397 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 31 states and 1586 transitions. [2024-10-13 10:04:15,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 612 transitions, 6695 flow [2024-10-13 10:04:15,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 612 transitions, 6337 flow, removed 152 selfloop flow, removed 8 redundant places. [2024-10-13 10:04:15,477 INFO L231 Difference]: Finished difference. Result has 215 places, 380 transitions, 3350 flow [2024-10-13 10:04:15,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3350, PETRI_PLACES=215, PETRI_TRANSITIONS=380} [2024-10-13 10:04:15,480 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 106 predicate places. [2024-10-13 10:04:15,480 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 380 transitions, 3350 flow [2024-10-13 10:04:15,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 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-13 10:04:15,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:15,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:15,501 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-13 10:04:15,682 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,SelfDestructingSolverStorable7 [2024-10-13 10:04:15,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 550388250, now seen corresponding path program 2 times [2024-10-13 10:04:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143492183] [2024-10-13 10:04:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:16,254 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-13 10:04:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143492183] [2024-10-13 10:04:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143492183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421523464] [2024-10-13 10:04:16,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:04:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:16,257 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-13 10:04:16,258 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-13 10:04:16,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:04:16,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:16,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 10:04:16,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:16,637 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:04:16,670 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 19 treesize of output 18 [2024-10-13 10:04:16,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:16,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:04:16,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:16,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 10:04:16,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:16,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:16,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:16,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:16,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:16,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-10-13 10:04:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:17,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:04:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421523464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:04:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-10-13 10:04:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850404727] [2024-10-13 10:04:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:04:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:04:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:04:17,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-10-13 10:04:17,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 380 transitions, 3350 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:17,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:17,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-10-13 10:04:17,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:18,741 INFO L124 PetriNetUnfolderBase]: 824/2582 cut-off events. [2024-10-13 10:04:18,742 INFO L125 PetriNetUnfolderBase]: For 10369/10508 co-relation queries the response was YES. [2024-10-13 10:04:18,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12131 conditions, 2582 events. 824/2582 cut-off events. For 10369/10508 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 21484 event pairs, 30 based on Foata normal form. 19/2588 useless extension candidates. Maximal degree in co-relation 11970. Up to 832 conditions per place. [2024-10-13 10:04:18,771 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 361 selfloop transitions, 102 changer transitions 0/555 dead transitions. [2024-10-13 10:04:18,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 555 transitions, 6182 flow [2024-10-13 10:04:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 10:04:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 10:04:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1592 transitions. [2024-10-13 10:04:18,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578512396694215 [2024-10-13 10:04:18,776 INFO L175 Difference]: Start difference. First operand has 215 places, 380 transitions, 3350 flow. Second operand 22 states and 1592 transitions. [2024-10-13 10:04:18,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 555 transitions, 6182 flow [2024-10-13 10:04:18,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 555 transitions, 6113 flow, removed 0 selfloop flow, removed 16 redundant places. [2024-10-13 10:04:18,885 INFO L231 Difference]: Finished difference. Result has 227 places, 432 transitions, 4346 flow [2024-10-13 10:04:18,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=3281, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4346, PETRI_PLACES=227, PETRI_TRANSITIONS=432} [2024-10-13 10:04:18,887 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 118 predicate places. [2024-10-13 10:04:18,887 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 432 transitions, 4346 flow [2024-10-13 10:04:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:18,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:18,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:18,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:04:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:19,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -211730128, now seen corresponding path program 3 times [2024-10-13 10:04:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202401817] [2024-10-13 10:04:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:19,543 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-13 10:04:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202401817] [2024-10-13 10:04:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202401817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043613742] [2024-10-13 10:04:19,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:04:19,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:19,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:19,546 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-13 10:04:19,547 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-13 10:04:19,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:04:19,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:19,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:04:19,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:19,681 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-13 10:04:19,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:19,734 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-13 10:04:19,913 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-13 10:04:19,985 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-13 10:04:20,034 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-13 10:04:20,082 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-13 10:04:20,201 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-13 10:04:20,237 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-13 10:04:20,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:20,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-13 10:04:20,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:20,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-13 10:04:20,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-13 10:04:20,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:20,456 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-13 10:04:20,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:20,467 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-13 10:04:20,470 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-13 10:04:20,478 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:20,478 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-13 10:04:20,485 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:20,485 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-13 10:04:20,491 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:20,491 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-13 10:04:20,564 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-13 10:04:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043613742] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:20,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2024-10-13 10:04:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703804066] [2024-10-13 10:04:20,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:20,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:04:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:04:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=759, Unknown=17, NotChecked=236, Total=1122 [2024-10-13 10:04:20,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-13 10:04:20,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 432 transitions, 4346 flow. Second operand has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 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-13 10:04:20,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:20,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-13 10:04:20,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:23,335 INFO L124 PetriNetUnfolderBase]: 1439/4061 cut-off events. [2024-10-13 10:04:23,335 INFO L125 PetriNetUnfolderBase]: For 18775/18797 co-relation queries the response was YES. [2024-10-13 10:04:23,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20566 conditions, 4061 events. 1439/4061 cut-off events. For 18775/18797 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 35711 event pairs, 149 based on Foata normal form. 30/4082 useless extension candidates. Maximal degree in co-relation 20391. Up to 1243 conditions per place. [2024-10-13 10:04:23,379 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 677 selfloop transitions, 193 changer transitions 13/926 dead transitions. [2024-10-13 10:04:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 926 transitions, 11449 flow [2024-10-13 10:04:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 10:04:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-10-13 10:04:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1587 transitions. [2024-10-13 10:04:23,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4809090909090909 [2024-10-13 10:04:23,383 INFO L175 Difference]: Start difference. First operand has 227 places, 432 transitions, 4346 flow. Second operand 30 states and 1587 transitions. [2024-10-13 10:04:23,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 926 transitions, 11449 flow [2024-10-13 10:04:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 926 transitions, 11378 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-10-13 10:04:23,562 INFO L231 Difference]: Finished difference. Result has 255 places, 540 transitions, 6549 flow [2024-10-13 10:04:23,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=4277, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6549, PETRI_PLACES=255, PETRI_TRANSITIONS=540} [2024-10-13 10:04:23,563 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 146 predicate places. [2024-10-13 10:04:23,564 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 540 transitions, 6549 flow [2024-10-13 10:04:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 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-13 10:04:23,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:23,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 10:04:23,578 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-13 10:04:23,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:23,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1029781006, now seen corresponding path program 4 times [2024-10-13 10:04:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588645740] [2024-10-13 10:04:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:24,328 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-13 10:04:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588645740] [2024-10-13 10:04:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588645740] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587779886] [2024-10-13 10:04:24,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:04:24,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:24,331 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-13 10:04:24,333 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-13 10:04:24,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:04:24,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:24,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 10:04:24,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:24,720 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:04:24,755 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 19 treesize of output 18 [2024-10-13 10:04:24,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:24,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:04:24,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:24,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 10:04:25,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:25,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:25,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:04:25,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:25,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-10-13 10:04:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:04:25,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:04:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587779886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:04:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:04:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-10-13 10:04:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138595397] [2024-10-13 10:04:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:04:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:04:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:04:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:04:25,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-10-13 10:04:25,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 540 transitions, 6549 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:25,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:25,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-10-13 10:04:25,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:26,763 INFO L124 PetriNetUnfolderBase]: 1227/3863 cut-off events. [2024-10-13 10:04:26,764 INFO L125 PetriNetUnfolderBase]: For 24570/24962 co-relation queries the response was YES. [2024-10-13 10:04:26,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20046 conditions, 3863 events. 1227/3863 cut-off events. For 24570/24962 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 36348 event pairs, 53 based on Foata normal form. 88/3936 useless extension candidates. Maximal degree in co-relation 19865. Up to 1286 conditions per place. [2024-10-13 10:04:26,817 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 306 selfloop transitions, 220 changer transitions 0/618 dead transitions. [2024-10-13 10:04:26,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 618 transitions, 8696 flow [2024-10-13 10:04:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:04:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-13 10:04:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1374 transitions. [2024-10-13 10:04:26,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6574162679425838 [2024-10-13 10:04:26,821 INFO L175 Difference]: Start difference. First operand has 255 places, 540 transitions, 6549 flow. Second operand 19 states and 1374 transitions. [2024-10-13 10:04:26,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 618 transitions, 8696 flow [2024-10-13 10:04:27,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 618 transitions, 8370 flow, removed 115 selfloop flow, removed 16 redundant places. [2024-10-13 10:04:27,122 INFO L231 Difference]: Finished difference. Result has 261 places, 569 transitions, 7556 flow [2024-10-13 10:04:27,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=6283, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7556, PETRI_PLACES=261, PETRI_TRANSITIONS=569} [2024-10-13 10:04:27,124 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 152 predicate places. [2024-10-13 10:04:27,124 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 569 transitions, 7556 flow [2024-10-13 10:04:27,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:04:27,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:27,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:27,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:04:27,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 10:04:27,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1481670000, now seen corresponding path program 5 times [2024-10-13 10:04:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441295454] [2024-10-13 10:04:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:27,916 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-13 10:04:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441295454] [2024-10-13 10:04:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441295454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562971847] [2024-10-13 10:04:27,917 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:04:27,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:27,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:27,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:27,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:04:28,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:04:28,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:28,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:04:28,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:28,068 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-13 10:04:28,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:28,143 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-13 10:04:28,292 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-13 10:04:28,333 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-13 10:04:28,405 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-13 10:04:28,448 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-13 10:04:28,526 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-13 10:04:28,555 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-13 10:04:28,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:28,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false [2024-10-13 10:04:28,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-13 10:04:28,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-10-13 10:04:28,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:28,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-13 10:04:28,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:28,673 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-13 10:04:28,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:28,681 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-13 10:04:28,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:04:28,696 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:28,697 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-13 10:04:28,702 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:28,703 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-13 10:04:28,707 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:28,708 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-13 10:04:28,755 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-13 10:04:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562971847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:28,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 32 [2024-10-13 10:04:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075078775] [2024-10-13 10:04:28,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:04:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:04:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=669, Unknown=5, NotChecked=280, Total=1056 [2024-10-13 10:04:28,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-10-13 10:04:28,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 569 transitions, 7556 flow. Second operand has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 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-13 10:04:28,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:28,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-10-13 10:04:28,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:31,472 INFO L124 PetriNetUnfolderBase]: 1937/5508 cut-off events. [2024-10-13 10:04:31,472 INFO L125 PetriNetUnfolderBase]: For 36192/36199 co-relation queries the response was YES. [2024-10-13 10:04:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29868 conditions, 5508 events. 1937/5508 cut-off events. For 36192/36199 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52043 event pairs, 194 based on Foata normal form. 27/5530 useless extension candidates. Maximal degree in co-relation 29675. Up to 1696 conditions per place. [2024-10-13 10:04:31,520 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 704 selfloop transitions, 274 changer transitions 15/1030 dead transitions. [2024-10-13 10:04:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1030 transitions, 15155 flow [2024-10-13 10:04:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 10:04:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-10-13 10:04:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1623 transitions. [2024-10-13 10:04:31,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4215584415584416 [2024-10-13 10:04:31,524 INFO L175 Difference]: Start difference. First operand has 261 places, 569 transitions, 7556 flow. Second operand 35 states and 1623 transitions. [2024-10-13 10:04:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1030 transitions, 15155 flow [2024-10-13 10:04:31,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1030 transitions, 14982 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-10-13 10:04:31,881 INFO L231 Difference]: Finished difference. Result has 293 places, 654 transitions, 9960 flow [2024-10-13 10:04:31,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=7410, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9960, PETRI_PLACES=293, PETRI_TRANSITIONS=654} [2024-10-13 10:04:31,885 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 184 predicate places. [2024-10-13 10:04:31,885 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 654 transitions, 9960 flow [2024-10-13 10:04:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 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-13 10:04:31,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:31,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:31,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:04:32,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:32,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1145105868, now seen corresponding path program 6 times [2024-10-13 10:04:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644287339] [2024-10-13 10:04:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:32,631 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-13 10:04:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644287339] [2024-10-13 10:04:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644287339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099107076] [2024-10-13 10:04:32,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:04:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:32,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:04:32,762 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-13 10:04:32,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:32,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 10:04:32,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:32,770 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-13 10:04:32,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:32,817 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-13 10:04:33,027 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-13 10:04:33,058 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-13 10:04:33,093 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-13 10:04:33,211 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-13 10:04:33,255 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-13 10:04:33,287 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-13 10:04:33,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:33,389 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false [2024-10-13 10:04:33,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-13 10:04:33,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-13 10:04:33,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-13 10:04:33,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:33,495 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-13 10:04:33,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:33,502 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-13 10:04:33,506 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-13 10:04:33,513 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:33,514 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-13 10:04:33,520 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:33,520 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-13 10:04:33,527 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:33,528 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-13 10:04:33,579 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-13 10:04:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099107076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:33,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:33,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31 [2024-10-13 10:04:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107294681] [2024-10-13 10:04:33,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:33,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 10:04:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 10:04:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=654, Unknown=14, NotChecked=220, Total=992 [2024-10-13 10:04:33,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-13 10:04:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 654 transitions, 9960 flow. Second operand has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 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-13 10:04:33,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:33,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-13 10:04:33,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:36,799 INFO L124 PetriNetUnfolderBase]: 2104/6036 cut-off events. [2024-10-13 10:04:36,800 INFO L125 PetriNetUnfolderBase]: For 45502/45522 co-relation queries the response was YES. [2024-10-13 10:04:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33851 conditions, 6036 events. 2104/6036 cut-off events. For 45502/45522 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 59291 event pairs, 263 based on Foata normal form. 26/6052 useless extension candidates. Maximal degree in co-relation 33647. Up to 1932 conditions per place. [2024-10-13 10:04:36,853 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 650 selfloop transitions, 318 changer transitions 19/1031 dead transitions. [2024-10-13 10:04:36,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 1031 transitions, 16650 flow [2024-10-13 10:04:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 10:04:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-10-13 10:04:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1579 transitions. [2024-10-13 10:04:36,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47848484848484846 [2024-10-13 10:04:36,857 INFO L175 Difference]: Start difference. First operand has 293 places, 654 transitions, 9960 flow. Second operand 30 states and 1579 transitions. [2024-10-13 10:04:36,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 1031 transitions, 16650 flow [2024-10-13 10:04:37,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1031 transitions, 16361 flow, removed 100 selfloop flow, removed 17 redundant places. [2024-10-13 10:04:37,508 INFO L231 Difference]: Finished difference. Result has 314 places, 718 transitions, 12133 flow [2024-10-13 10:04:37,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=9671, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=12133, PETRI_PLACES=314, PETRI_TRANSITIONS=718} [2024-10-13 10:04:37,510 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 205 predicate places. [2024-10-13 10:04:37,510 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 718 transitions, 12133 flow [2024-10-13 10:04:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 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-13 10:04:37,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:37,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:37,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:04:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:37,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:37,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -820413334, now seen corresponding path program 7 times [2024-10-13 10:04:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710750521] [2024-10-13 10:04:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:38,238 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-13 10:04:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710750521] [2024-10-13 10:04:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710750521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655530931] [2024-10-13 10:04:38,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:04:38,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:38,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:38,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:38,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:04:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:38,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 10:04:38,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:38,373 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-13 10:04:38,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:38,416 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-13 10:04:38,479 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-13 10:04:38,503 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-13 10:04:38,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:38,545 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-13 10:04:38,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:38,718 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-13 10:04:38,789 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-13 10:04:38,826 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-13 10:04:38,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:38,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)))) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-13 10:04:38,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-10-13 10:04:38,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-10-13 10:04:39,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:39,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-13 10:04:39,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:39,029 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-13 10:04:39,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:39,033 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-13 10:04:39,037 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-13 10:04:39,042 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:39,042 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-13 10:04:39,047 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:39,047 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-13 10:04:39,054 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:39,054 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-13 10:04:39,093 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-13 10:04:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655530931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:39,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:39,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-10-13 10:04:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648629450] [2024-10-13 10:04:39,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:39,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:04:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:04:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=511, Unknown=16, NotChecked=250, Total=870 [2024-10-13 10:04:39,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-13 10:04:39,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 718 transitions, 12133 flow. Second operand has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 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-13 10:04:39,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:39,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-13 10:04:39,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:41,932 INFO L124 PetriNetUnfolderBase]: 2319/6651 cut-off events. [2024-10-13 10:04:41,932 INFO L125 PetriNetUnfolderBase]: For 55101/55126 co-relation queries the response was YES. [2024-10-13 10:04:42,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38285 conditions, 6651 events. 2319/6651 cut-off events. For 55101/55126 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 66961 event pairs, 300 based on Foata normal form. 21/6661 useless extension candidates. Maximal degree in co-relation 38074. Up to 2722 conditions per place. [2024-10-13 10:04:42,083 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 343 changer transitions 10/887 dead transitions. [2024-10-13 10:04:42,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 887 transitions, 16065 flow [2024-10-13 10:04:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:04:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-13 10:04:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1093 transitions. [2024-10-13 10:04:42,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47316017316017317 [2024-10-13 10:04:42,089 INFO L175 Difference]: Start difference. First operand has 314 places, 718 transitions, 12133 flow. Second operand 21 states and 1093 transitions. [2024-10-13 10:04:42,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 887 transitions, 16065 flow [2024-10-13 10:04:42,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 887 transitions, 15565 flow, removed 186 selfloop flow, removed 19 redundant places. [2024-10-13 10:04:42,769 INFO L231 Difference]: Finished difference. Result has 322 places, 758 transitions, 13950 flow [2024-10-13 10:04:42,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=11647, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13950, PETRI_PLACES=322, PETRI_TRANSITIONS=758} [2024-10-13 10:04:42,771 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 213 predicate places. [2024-10-13 10:04:42,771 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 758 transitions, 13950 flow [2024-10-13 10:04:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 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-13 10:04:42,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:42,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:42,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:04:42,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 10:04:42,973 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:42,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash -768552536, now seen corresponding path program 8 times [2024-10-13 10:04:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:42,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786587782] [2024-10-13 10:04:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:43,514 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-13 10:04:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786587782] [2024-10-13 10:04:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786587782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058122543] [2024-10-13 10:04:43,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:04:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:43,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:43,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:04:43,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:04:43,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:43,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 10:04:43,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:43,711 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-13 10:04:43,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:43,775 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-13 10:04:44,024 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-13 10:04:44,156 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-13 10:04:44,191 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-13 10:04:44,232 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-13 10:04:44,277 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-13 10:04:44,309 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-13 10:04:44,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:44,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)))) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-10-13 10:04:44,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-13 10:04:44,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:44,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-13 10:04:44,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-13 10:04:44,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-10-13 10:04:44,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:44,459 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-13 10:04:44,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:44,465 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-13 10:04:44,469 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-13 10:04:44,475 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:44,475 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-13 10:04:44,480 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:44,480 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-13 10:04:44,486 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:44,486 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-13 10:04:44,717 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-13 10:04:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058122543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:44,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-10-13 10:04:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149957190] [2024-10-13 10:04:44,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-13 10:04:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-13 10:04:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1201, Unknown=6, NotChecked=450, Total=1806 [2024-10-13 10:04:44,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 110 [2024-10-13 10:04:44,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 758 transitions, 13950 flow. Second operand has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 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-13 10:04:44,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:44,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 110 [2024-10-13 10:04:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:48,215 INFO L124 PetriNetUnfolderBase]: 2560/7381 cut-off events. [2024-10-13 10:04:48,216 INFO L125 PetriNetUnfolderBase]: For 70002/70015 co-relation queries the response was YES. [2024-10-13 10:04:48,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43257 conditions, 7381 events. 2560/7381 cut-off events. For 70002/70015 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 75859 event pairs, 337 based on Foata normal form. 22/7390 useless extension candidates. Maximal degree in co-relation 43032. Up to 2644 conditions per place. [2024-10-13 10:04:48,283 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 566 selfloop transitions, 350 changer transitions 7/958 dead transitions. [2024-10-13 10:04:48,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 958 transitions, 18775 flow [2024-10-13 10:04:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 10:04:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-13 10:04:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1066 transitions. [2024-10-13 10:04:48,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-10-13 10:04:48,289 INFO L175 Difference]: Start difference. First operand has 322 places, 758 transitions, 13950 flow. Second operand 26 states and 1066 transitions. [2024-10-13 10:04:48,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 958 transitions, 18775 flow [2024-10-13 10:04:48,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 958 transitions, 18514 flow, removed 54 selfloop flow, removed 14 redundant places. [2024-10-13 10:04:48,899 INFO L231 Difference]: Finished difference. Result has 341 places, 808 transitions, 16223 flow [2024-10-13 10:04:48,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=13697, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16223, PETRI_PLACES=341, PETRI_TRANSITIONS=808} [2024-10-13 10:04:48,901 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 232 predicate places. [2024-10-13 10:04:48,901 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 808 transitions, 16223 flow [2024-10-13 10:04:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 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-13 10:04:48,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:48,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:48,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 10:04:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 10:04:49,103 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:49,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1948267056, now seen corresponding path program 9 times [2024-10-13 10:04:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179995768] [2024-10-13 10:04:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:49,671 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-13 10:04:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179995768] [2024-10-13 10:04:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179995768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149488693] [2024-10-13 10:04:49,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:04:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:49,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:49,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:04:49,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:04:49,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:49,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 10:04:49,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:49,843 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-13 10:04:49,892 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:49,892 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-13 10:04:50,108 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-13 10:04:50,133 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-13 10:04:50,199 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-13 10:04:50,234 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-13 10:04:50,346 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-13 10:04:50,382 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-13 10:04:50,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:04:50,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false [2024-10-13 10:04:50,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-10-13 10:04:50,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-13 10:04:50,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-13 10:04:50,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-13 10:04:50,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:50,600 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-13 10:04:50,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:04:50,607 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-13 10:04:50,612 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-13 10:04:50,617 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:50,617 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-13 10:04:50,624 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:50,625 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-13 10:04:50,630 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 10:04:50,630 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-13 10:04:50,673 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-13 10:04:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149488693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:04:50,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:04:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-10-13 10:04:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116954003] [2024-10-13 10:04:50,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:04:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:04:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:04:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:04:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=657, Unknown=14, NotChecked=280, Total=1056 [2024-10-13 10:04:50,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-13 10:04:50,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 808 transitions, 16223 flow. Second operand has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 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-13 10:04:50,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:04:50,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-13 10:04:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:04:54,131 INFO L124 PetriNetUnfolderBase]: 2758/7952 cut-off events. [2024-10-13 10:04:54,132 INFO L125 PetriNetUnfolderBase]: For 85477/85503 co-relation queries the response was YES. [2024-10-13 10:04:54,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47853 conditions, 7952 events. 2758/7952 cut-off events. For 85477/85503 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 83317 event pairs, 359 based on Foata normal form. 17/7956 useless extension candidates. Maximal degree in co-relation 47624. Up to 3582 conditions per place. [2024-10-13 10:04:54,208 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 426 changer transitions 7/967 dead transitions. [2024-10-13 10:04:54,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 967 transitions, 20577 flow [2024-10-13 10:04:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:04:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-13 10:04:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1044 transitions. [2024-10-13 10:04:54,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47454545454545455 [2024-10-13 10:04:54,211 INFO L175 Difference]: Start difference. First operand has 341 places, 808 transitions, 16223 flow. Second operand 20 states and 1044 transitions. [2024-10-13 10:04:54,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 967 transitions, 20577 flow [2024-10-13 10:04:54,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 967 transitions, 20228 flow, removed 132 selfloop flow, removed 16 redundant places. [2024-10-13 10:04:54,978 INFO L231 Difference]: Finished difference. Result has 351 places, 854 transitions, 19010 flow [2024-10-13 10:04:54,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15916, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19010, PETRI_PLACES=351, PETRI_TRANSITIONS=854} [2024-10-13 10:04:54,979 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 242 predicate places. [2024-10-13 10:04:54,979 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 854 transitions, 19010 flow [2024-10-13 10:04:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 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-13 10:04:54,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:04:54,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:04:54,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:04:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 10:04:55,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-13 10:04:55,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:04:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash 222509848, now seen corresponding path program 10 times [2024-10-13 10:04:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:04:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199495361] [2024-10-13 10:04:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:04:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:04:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:04:55,675 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-13 10:04:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:04:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199495361] [2024-10-13 10:04:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199495361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:04:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626984440] [2024-10-13 10:04:55,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:04:55,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:04:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:04:55,678 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:04:55,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:04:55,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:04:55,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:04:55,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 10:04:55,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:04:56,031 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-13 10:04:56,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:04:56,085 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-13 10:04:56,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-13 10:04:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-13 10:04:56,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2024-10-13 10:04:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2024-10-13 10:04:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-10-13 10:04:56,707 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-13 10:04:56,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:05:12,584 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-13 10:05:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626984440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:05:12,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:05:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2024-10-13 10:05:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993851270] [2024-10-13 10:05:12,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:05:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-13 10:05:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:05:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 10:05:12,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1317, Unknown=3, NotChecked=0, Total=1482 [2024-10-13 10:05:13,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]