./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-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:20:29,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:20:29,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:20:29,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:20:29,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:20:29,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:20:29,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:20:29,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:20:29,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:20:29,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:20:29,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:20:29,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:20:29,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:20:29,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:20:29,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:20:29,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:20:29,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:20:29,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:20:29,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:20:29,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:20:29,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:20:29,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:20:29,838 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:20:29,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:20:29,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:20:29,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:20:29,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:20:29,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:20:29,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:20:29,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:20:29,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:20:29,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:29,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:20:29,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:20:29,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:20:29,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:20:29,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:20:29,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:20:29,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:20:29,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:20:29,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:20:29,843 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-clean/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-clean/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 -> bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 [2024-10-11 17:20:30,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:20:30,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:20:30,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:20:30,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:20:30,137 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:20:30,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2024-10-11 17:20:31,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:20:31,964 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:20:31,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2024-10-11 17:20:31,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d00fcffc/31dde4354471450cab39985b836c34a9/FLAG5b38153aa [2024-10-11 17:20:32,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d00fcffc/31dde4354471450cab39985b836c34a9 [2024-10-11 17:20:32,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:20:32,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:20:32,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:32,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:20:32,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:20:32,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afad288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32, skipping insertion in model container [2024-10-11 17:20:32,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:20:32,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:32,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:20:32,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:32,738 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:20:32,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32 WrapperNode [2024-10-11 17:20:32,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:32,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:32,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:20:32,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:20:32,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,810 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-10-11 17:20:32,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:32,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:20:32,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:20:32,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:20:32,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:20:32,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:20:32,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:20:32,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:20:32,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (1/1) ... [2024-10-11 17:20:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:32,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:32,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:20:32,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:20:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:20:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:20:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:20:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:20:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:20:32,962 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:20:33,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:20:33,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:20:33,272 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:20:33,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:20:33,292 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:20:33,292 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:20:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:33 BoogieIcfgContainer [2024-10-11 17:20:33,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:20:33,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:20:33,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:20:33,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:20:33,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:20:32" (1/3) ... [2024-10-11 17:20:33,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a912ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:33, skipping insertion in model container [2024-10-11 17:20:33,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:32" (2/3) ... [2024-10-11 17:20:33,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a912ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:33, skipping insertion in model container [2024-10-11 17:20:33,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:33" (3/3) ... [2024-10-11 17:20:33,302 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i [2024-10-11 17:20:33,318 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:20:33,318 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 17:20:33,318 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:20:33,380 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:20:33,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 175 flow [2024-10-11 17:20:33,491 INFO L124 PetriNetUnfolderBase]: 6/116 cut-off events. [2024-10-11 17:20:33,491 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:20:33,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 6/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2024-10-11 17:20:33,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 175 flow [2024-10-11 17:20:33,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 175 flow [2024-10-11 17:20:33,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:33,518 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;@2f0b3490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:33,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 17:20:33,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:33,534 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-10-11 17:20:33,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:33,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:33,536 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:33,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:20:33,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1393147291, now seen corresponding path program 1 times [2024-10-11 17:20:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:33,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196262857] [2024-10-11 17:20:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:34,453 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-11 17:20:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196262857] [2024-10-11 17:20:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196262857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:34,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650401470] [2024-10-11 17:20:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:34,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 84 [2024-10-11 17:20:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 84 [2024-10-11 17:20:34,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:34,920 INFO L124 PetriNetUnfolderBase]: 71/365 cut-off events. [2024-10-11 17:20:34,921 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:20:34,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 365 events. 71/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1802 event pairs, 32 based on Foata normal form. 13/339 useless extension candidates. Maximal degree in co-relation 471. Up to 151 conditions per place. [2024-10-11 17:20:34,925 INFO L140 encePairwiseOnDemand]: 70/84 looper letters, 23 selfloop transitions, 22 changer transitions 1/102 dead transitions. [2024-10-11 17:20:34,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 301 flow [2024-10-11 17:20:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2024-10-11 17:20:34,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757936507936508 [2024-10-11 17:20:34,944 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 175 flow. Second operand 6 states and 391 transitions. [2024-10-11 17:20:34,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 301 flow [2024-10-11 17:20:34,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:34,952 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 317 flow [2024-10-11 17:20:34,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-10-11 17:20:34,958 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2024-10-11 17:20:34,958 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 317 flow [2024-10-11 17:20:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:34,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:34,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:20:34,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:20:34,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 42417353, now seen corresponding path program 1 times [2024-10-11 17:20:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:34,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741928160] [2024-10-11 17:20:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:35,047 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-11 17:20:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741928160] [2024-10-11 17:20:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741928160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423417199] [2024-10-11 17:20:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:35,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:35,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 84 [2024-10-11 17:20:35,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:35,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 84 [2024-10-11 17:20:35,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:35,223 INFO L124 PetriNetUnfolderBase]: 33/232 cut-off events. [2024-10-11 17:20:35,223 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2024-10-11 17:20:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 232 events. 33/232 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 753 event pairs, 0 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 304. Up to 45 conditions per place. [2024-10-11 17:20:35,228 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 11 selfloop transitions, 2 changer transitions 5/106 dead transitions. [2024-10-11 17:20:35,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 363 flow [2024-10-11 17:20:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2024-10-11 17:20:35,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2024-10-11 17:20:35,233 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 317 flow. Second operand 6 states and 427 transitions. [2024-10-11 17:20:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 363 flow [2024-10-11 17:20:35,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:35,238 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 335 flow [2024-10-11 17:20:35,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2024-10-11 17:20:35,239 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2024-10-11 17:20:35,239 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 335 flow [2024-10-11 17:20:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:35,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:35,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:20:35,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:20:35,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1417991206, now seen corresponding path program 1 times [2024-10-11 17:20:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289426096] [2024-10-11 17:20:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:35,677 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-11 17:20:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289426096] [2024-10-11 17:20:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289426096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:35,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:35,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875973354] [2024-10-11 17:20:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:35,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:35,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2024-10-11 17:20:35,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:35,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2024-10-11 17:20:35,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:35,963 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2024-10-11 17:20:35,963 INFO L125 PetriNetUnfolderBase]: For 139/151 co-relation queries the response was YES. [2024-10-11 17:20:35,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 477 events. 130/477 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2469 event pairs, 23 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 992. Up to 238 conditions per place. [2024-10-11 17:20:35,970 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2024-10-11 17:20:35,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 653 flow [2024-10-11 17:20:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2024-10-11 17:20:35,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2024-10-11 17:20:35,974 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 335 flow. Second operand 6 states and 429 transitions. [2024-10-11 17:20:35,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 653 flow [2024-10-11 17:20:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:20:35,984 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2024-10-11 17:20:35,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2024-10-11 17:20:35,985 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2024-10-11 17:20:35,985 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2024-10-11 17:20:35,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:35,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:35,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:20:35,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:20:35,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -349533219, now seen corresponding path program 1 times [2024-10-11 17:20:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357356504] [2024-10-11 17:20:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:36,359 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-11 17:20:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357356504] [2024-10-11 17:20:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357356504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171815302] [2024-10-11 17:20:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:36,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:36,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2024-10-11 17:20:36,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:36,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2024-10-11 17:20:36,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:36,650 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2024-10-11 17:20:36,650 INFO L125 PetriNetUnfolderBase]: For 468/492 co-relation queries the response was YES. [2024-10-11 17:20:36,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 468/492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2803 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2024-10-11 17:20:36,655 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2024-10-11 17:20:36,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2024-10-11 17:20:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2024-10-11 17:20:36,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7876984126984127 [2024-10-11 17:20:36,657 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2024-10-11 17:20:36,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2024-10-11 17:20:36,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:36,668 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2024-10-11 17:20:36,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2024-10-11 17:20:36,669 INFO L277 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2024-10-11 17:20:36,669 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2024-10-11 17:20:36,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:36,670 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:36,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:20:36,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:20:36,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 496541332, now seen corresponding path program 1 times [2024-10-11 17:20:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549839504] [2024-10-11 17:20:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:36,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:20:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:36,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:20:36,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:20:36,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 17:20:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-11 17:20:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-11 17:20:36,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-11 17:20:36,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-11 17:20:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:20:36,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:20:36,776 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:20:36,777 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:20:36,802 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:20:36,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 220 flow [2024-10-11 17:20:36,827 INFO L124 PetriNetUnfolderBase]: 11/199 cut-off events. [2024-10-11 17:20:36,827 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:20:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 199 events. 11/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 118. Up to 8 conditions per place. [2024-10-11 17:20:36,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 220 flow [2024-10-11 17:20:36,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 220 flow [2024-10-11 17:20:36,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:36,833 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;@2f0b3490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:36,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 17:20:36,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:36,838 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-10-11 17:20:36,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:36,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:36,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:36,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:36,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -496559221, now seen corresponding path program 1 times [2024-10-11 17:20:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954846194] [2024-10-11 17:20:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:37,101 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-11 17:20:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954846194] [2024-10-11 17:20:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954846194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112372643] [2024-10-11 17:20:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:37,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:37,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:37,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-10-11 17:20:37,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:37,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-10-11 17:20:37,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:37,700 INFO L124 PetriNetUnfolderBase]: 903/2672 cut-off events. [2024-10-11 17:20:37,701 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-11 17:20:37,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 2672 events. 903/2672 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20575 event pairs, 529 based on Foata normal form. 68/2471 useless extension candidates. Maximal degree in co-relation 2356. Up to 1385 conditions per place. [2024-10-11 17:20:37,717 INFO L140 encePairwiseOnDemand]: 84/102 looper letters, 30 selfloop transitions, 38 changer transitions 1/137 dead transitions. [2024-10-11 17:20:37,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 431 flow [2024-10-11 17:20:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2024-10-11 17:20:37,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-10-11 17:20:37,719 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 220 flow. Second operand 6 states and 486 transitions. [2024-10-11 17:20:37,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 431 flow [2024-10-11 17:20:37,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:37,727 INFO L231 Difference]: Finished difference. Result has 112 places, 135 transitions, 466 flow [2024-10-11 17:20:37,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=112, PETRI_TRANSITIONS=135} [2024-10-11 17:20:37,729 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2024-10-11 17:20:37,731 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 135 transitions, 466 flow [2024-10-11 17:20:37,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:37,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:20:37,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:37,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 939005423, now seen corresponding path program 1 times [2024-10-11 17:20:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892228505] [2024-10-11 17:20:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:37,813 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-11 17:20:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892228505] [2024-10-11 17:20:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892228505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102192126] [2024-10-11 17:20:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:37,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:37,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 102 [2024-10-11 17:20:37,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:37,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 102 [2024-10-11 17:20:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:38,106 INFO L124 PetriNetUnfolderBase]: 423/1467 cut-off events. [2024-10-11 17:20:38,107 INFO L125 PetriNetUnfolderBase]: For 333/397 co-relation queries the response was YES. [2024-10-11 17:20:38,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1467 events. 423/1467 cut-off events. For 333/397 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9716 event pairs, 116 based on Foata normal form. 2/1393 useless extension candidates. Maximal degree in co-relation 2171. Up to 520 conditions per place. [2024-10-11 17:20:38,122 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 14 selfloop transitions, 2 changer transitions 5/141 dead transitions. [2024-10-11 17:20:38,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 520 flow [2024-10-11 17:20:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-10-11 17:20:38,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2024-10-11 17:20:38,125 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 466 flow. Second operand 6 states and 526 transitions. [2024-10-11 17:20:38,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 520 flow [2024-10-11 17:20:38,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:38,160 INFO L231 Difference]: Finished difference. Result has 120 places, 136 transitions, 488 flow [2024-10-11 17:20:38,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=120, PETRI_TRANSITIONS=136} [2024-10-11 17:20:38,161 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2024-10-11 17:20:38,161 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 136 transitions, 488 flow [2024-10-11 17:20:38,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:38,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:38,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:38,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:20:38,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:38,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 599346800, now seen corresponding path program 1 times [2024-10-11 17:20:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581541069] [2024-10-11 17:20:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:38,419 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-11 17:20:38,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:38,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581541069] [2024-10-11 17:20:38,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581541069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:38,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755559060] [2024-10-11 17:20:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:38,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:38,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-10-11 17:20:38,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 136 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:38,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:38,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-10-11 17:20:38,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:39,241 INFO L124 PetriNetUnfolderBase]: 1867/4616 cut-off events. [2024-10-11 17:20:39,241 INFO L125 PetriNetUnfolderBase]: For 1532/1604 co-relation queries the response was YES. [2024-10-11 17:20:39,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10873 conditions, 4616 events. 1867/4616 cut-off events. For 1532/1604 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 36423 event pairs, 439 based on Foata normal form. 0/4334 useless extension candidates. Maximal degree in co-relation 10779. Up to 2583 conditions per place. [2024-10-11 17:20:39,283 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2024-10-11 17:20:39,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1234 flow [2024-10-11 17:20:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2024-10-11 17:20:39,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-10-11 17:20:39,286 INFO L175 Difference]: Start difference. First operand has 120 places, 136 transitions, 488 flow. Second operand 6 states and 531 transitions. [2024-10-11 17:20:39,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1234 flow [2024-10-11 17:20:39,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:20:39,298 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2024-10-11 17:20:39,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2024-10-11 17:20:39,301 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2024-10-11 17:20:39,301 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2024-10-11 17:20:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:39,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:39,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:39,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:20:39,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash -197796371, now seen corresponding path program 1 times [2024-10-11 17:20:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519960977] [2024-10-11 17:20:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:39,643 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-11 17:20:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519960977] [2024-10-11 17:20:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519960977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416528515] [2024-10-11 17:20:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:39,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:39,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2024-10-11 17:20:39,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:39,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:39,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2024-10-11 17:20:39,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:40,656 INFO L124 PetriNetUnfolderBase]: 2321/5558 cut-off events. [2024-10-11 17:20:40,657 INFO L125 PetriNetUnfolderBase]: For 5338/5534 co-relation queries the response was YES. [2024-10-11 17:20:40,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17509 conditions, 5558 events. 2321/5558 cut-off events. For 5338/5534 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 44842 event pairs, 294 based on Foata normal form. 2/5328 useless extension candidates. Maximal degree in co-relation 14216. Up to 3135 conditions per place. [2024-10-11 17:20:40,709 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2024-10-11 17:20:40,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2024-10-11 17:20:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-10-11 17:20:40,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8071895424836601 [2024-10-11 17:20:40,711 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2024-10-11 17:20:40,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2024-10-11 17:20:40,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:40,754 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2024-10-11 17:20:40,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2024-10-11 17:20:40,757 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-10-11 17:20:40,758 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2024-10-11 17:20:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:40,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:40,758 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:20:40,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -701954584, now seen corresponding path program 1 times [2024-10-11 17:20:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740989083] [2024-10-11 17:20:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740989083] [2024-10-11 17:20:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740989083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226502725] [2024-10-11 17:20:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:41,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:41,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:20:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:41,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:20:41,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:41,508 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-11 17:20:41,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:41,567 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-11 17:20:41,628 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-11 17:20:41,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:20:41,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:41,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:20:41,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:41,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:20:41,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:20:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:41,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:41,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-10-11 17:20:41,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2024-10-11 17:20:42,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2024-10-11 17:20:42,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_232 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_232 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_232) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:20:42,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:42,245 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-11 17:20:42,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:42,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-10-11 17:20:42,278 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:42,279 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-11 17:20:42,291 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:42,291 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-11 17:20:42,301 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:42,301 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-11 17:20:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 17:20:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226502725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:42,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-10-11 17:20:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257365166] [2024-10-11 17:20:42,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:42,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:20:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:20:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=19, NotChecked=140, Total=462 [2024-10-11 17:20:42,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-10-11 17:20:42,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:42,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:42,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-10-11 17:20:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:46,105 INFO L124 PetriNetUnfolderBase]: 7955/16707 cut-off events. [2024-10-11 17:20:46,106 INFO L125 PetriNetUnfolderBase]: For 25989/26258 co-relation queries the response was YES. [2024-10-11 17:20:46,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56154 conditions, 16707 events. 7955/16707 cut-off events. For 25989/26258 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 148222 event pairs, 1814 based on Foata normal form. 122/16053 useless extension candidates. Maximal degree in co-relation 49615. Up to 8904 conditions per place. [2024-10-11 17:20:46,250 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 342 selfloop transitions, 265 changer transitions 0/655 dead transitions. [2024-10-11 17:20:46,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 655 transitions, 6151 flow [2024-10-11 17:20:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:20:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 17:20:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1102 transitions. [2024-10-11 17:20:46,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2024-10-11 17:20:46,254 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 19 states and 1102 transitions. [2024-10-11 17:20:46,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 655 transitions, 6151 flow [2024-10-11 17:20:46,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 655 transitions, 6007 flow, removed 72 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:46,387 INFO L231 Difference]: Finished difference. Result has 160 places, 532 transitions, 5322 flow [2024-10-11 17:20:46,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5322, PETRI_PLACES=160, PETRI_TRANSITIONS=532} [2024-10-11 17:20:46,388 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 58 predicate places. [2024-10-11 17:20:46,389 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 532 transitions, 5322 flow [2024-10-11 17:20:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:46,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:46,389 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:46,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:20:46,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:20:46,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1066702245, now seen corresponding path program 1 times [2024-10-11 17:20:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716723944] [2024-10-11 17:20:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:47,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716723944] [2024-10-11 17:20:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716723944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:47,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786254651] [2024-10-11 17:20:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:47,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:47,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:20:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:47,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 17:20:47,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:47,279 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-11 17:20:47,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:47,292 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-11 17:20:47,340 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-11 17:20:47,348 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-11 17:20:47,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:47,371 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-11 17:20:47,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:47,392 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-11 17:20:47,415 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-11 17:20:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:47,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:47,453 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2024-10-11 17:20:47,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_297) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2024-10-11 17:20:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 17:20:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786254651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:51,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-10-11 17:20:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478245300] [2024-10-11 17:20:51,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:20:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:20:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=9, NotChecked=62, Total=342 [2024-10-11 17:20:51,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2024-10-11 17:20:51,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 532 transitions, 5322 flow. Second operand has 19 states, 19 states have (on average 54.78947368421053) internal successors, (1041), 19 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:51,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:51,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2024-10-11 17:20:51,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:55,580 INFO L124 PetriNetUnfolderBase]: 8357/16782 cut-off events. [2024-10-11 17:20:55,581 INFO L125 PetriNetUnfolderBase]: For 39961/40298 co-relation queries the response was YES. [2024-10-11 17:20:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66536 conditions, 16782 events. 8357/16782 cut-off events. For 39961/40298 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 145171 event pairs, 1008 based on Foata normal form. 322/16311 useless extension candidates. Maximal degree in co-relation 59644. Up to 6786 conditions per place. [2024-10-11 17:20:55,883 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 559 selfloop transitions, 526 changer transitions 8/1151 dead transitions. [2024-10-11 17:20:55,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1151 transitions, 12940 flow [2024-10-11 17:20:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:20:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-11 17:20:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1512 transitions. [2024-10-11 17:20:55,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6445012787723785 [2024-10-11 17:20:55,888 INFO L175 Difference]: Start difference. First operand has 160 places, 532 transitions, 5322 flow. Second operand 23 states and 1512 transitions. [2024-10-11 17:20:55,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1151 transitions, 12940 flow [2024-10-11 17:20:56,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1151 transitions, 12884 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-10-11 17:20:56,130 INFO L231 Difference]: Finished difference. Result has 188 places, 929 transitions, 11763 flow [2024-10-11 17:20:56,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=5284, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=11763, PETRI_PLACES=188, PETRI_TRANSITIONS=929} [2024-10-11 17:20:56,132 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 86 predicate places. [2024-10-11 17:20:56,132 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 929 transitions, 11763 flow [2024-10-11 17:20:56,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 54.78947368421053) internal successors, (1041), 19 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:56,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:56,133 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:56,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:20:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:56,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:20:56,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1043016310, now seen corresponding path program 2 times [2024-10-11 17:20:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110467345] [2024-10-11 17:20:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:56,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:56,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110467345] [2024-10-11 17:20:56,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110467345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:56,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054443676] [2024-10-11 17:20:56,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:20:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:56,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:56,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:56,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:20:56,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:20:56,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:20:56,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:20:56,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:56,864 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-11 17:20:56,875 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:56,876 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-11 17:20:56,917 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-11 17:20:56,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:20:56,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:56,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:20:56,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:20:56,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:20:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:56,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:59,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:20:59,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)))) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:20:59,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_361 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_361) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:20:59,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:59,373 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-11 17:20:59,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:59,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-10-11 17:20:59,390 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:59,391 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-11 17:20:59,399 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:59,399 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-11 17:20:59,409 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:59,410 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-11 17:20:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 17:20:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054443676] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:59,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-10-11 17:20:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325927230] [2024-10-11 17:20:59,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:59,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:20:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:20:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=223, Unknown=10, NotChecked=96, Total=380 [2024-10-11 17:20:59,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-10-11 17:20:59,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 929 transitions, 11763 flow. Second operand has 20 states, 20 states have (on average 49.15) internal successors, (983), 20 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:59,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:59,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-10-11 17:20:59,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:03,998 INFO L124 PetriNetUnfolderBase]: 9681/19943 cut-off events. [2024-10-11 17:21:03,998 INFO L125 PetriNetUnfolderBase]: For 89811/90550 co-relation queries the response was YES. [2024-10-11 17:21:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92230 conditions, 19943 events. 9681/19943 cut-off events. For 89811/90550 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 178868 event pairs, 1805 based on Foata normal form. 210/19235 useless extension candidates. Maximal degree in co-relation 90456. Up to 10604 conditions per place. [2024-10-11 17:21:04,311 INFO L140 encePairwiseOnDemand]: 80/102 looper letters, 835 selfloop transitions, 427 changer transitions 2/1317 dead transitions. [2024-10-11 17:21:04,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1317 transitions, 18684 flow [2024-10-11 17:21:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:21:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 17:21:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1227 transitions. [2024-10-11 17:21:04,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.572829131652661 [2024-10-11 17:21:04,316 INFO L175 Difference]: Start difference. First operand has 188 places, 929 transitions, 11763 flow. Second operand 21 states and 1227 transitions. [2024-10-11 17:21:04,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1317 transitions, 18684 flow [2024-10-11 17:21:05,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1317 transitions, 18482 flow, removed 95 selfloop flow, removed 6 redundant places. [2024-10-11 17:21:05,252 INFO L231 Difference]: Finished difference. Result has 207 places, 1150 transitions, 16521 flow [2024-10-11 17:21:05,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=11561, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=16521, PETRI_PLACES=207, PETRI_TRANSITIONS=1150} [2024-10-11 17:21:05,253 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 105 predicate places. [2024-10-11 17:21:05,253 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 1150 transitions, 16521 flow [2024-10-11 17:21:05,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 49.15) internal successors, (983), 20 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:05,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:05,254 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:05,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 17:21:05,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:05,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:21:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1337108184, now seen corresponding path program 3 times [2024-10-11 17:21:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502877999] [2024-10-11 17:21:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:05,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:05,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502877999] [2024-10-11 17:21:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502877999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786254081] [2024-10-11 17:21:05,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:21:05,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:05,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:05,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:21:06,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:21:06,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:06,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 17:21:06,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:06,134 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-11 17:21:06,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:06,198 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-11 17:21:06,577 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-11 17:21:06,629 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-11 17:21:06,695 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-11 17:21:06,764 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-11 17:21:06,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2024-10-11 17:21:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:07,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786254081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:09,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2024-10-11 17:21:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212436942] [2024-10-11 17:21:09,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 17:21:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 17:21:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 17:21:14,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-10-11 17:21:14,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1150 transitions, 16521 flow. Second operand has 43 states, 43 states have (on average 59.883720930232556) internal successors, (2575), 43 states have internal predecessors, (2575), 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-11 17:21:14,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:14,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-10-11 17:21:14,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:20,045 INFO L124 PetriNetUnfolderBase]: 8226/18536 cut-off events. [2024-10-11 17:21:20,046 INFO L125 PetriNetUnfolderBase]: For 131691/133950 co-relation queries the response was YES. [2024-10-11 17:21:20,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103559 conditions, 18536 events. 8226/18536 cut-off events. For 131691/133950 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 175318 event pairs, 434 based on Foata normal form. 563/18569 useless extension candidates. Maximal degree in co-relation 102065. Up to 6784 conditions per place. [2024-10-11 17:21:20,394 INFO L140 encePairwiseOnDemand]: 71/102 looper letters, 1119 selfloop transitions, 717 changer transitions 0/1906 dead transitions. [2024-10-11 17:21:20,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1906 transitions, 32770 flow [2024-10-11 17:21:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 17:21:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-10-11 17:21:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2180 transitions. [2024-10-11 17:21:20,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6476530005941771 [2024-10-11 17:21:20,404 INFO L175 Difference]: Start difference. First operand has 207 places, 1150 transitions, 16521 flow. Second operand 33 states and 2180 transitions. [2024-10-11 17:21:20,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1906 transitions, 32770 flow [2024-10-11 17:21:21,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 1906 transitions, 32576 flow, removed 77 selfloop flow, removed 11 redundant places. [2024-10-11 17:21:21,212 INFO L231 Difference]: Finished difference. Result has 242 places, 1561 transitions, 26782 flow [2024-10-11 17:21:21,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=16407, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=26782, PETRI_PLACES=242, PETRI_TRANSITIONS=1561} [2024-10-11 17:21:21,214 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 140 predicate places. [2024-10-11 17:21:21,214 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 1561 transitions, 26782 flow [2024-10-11 17:21:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 59.883720930232556) internal successors, (2575), 43 states have internal predecessors, (2575), 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-11 17:21:21,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:21,215 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:21,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:21:21,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 17:21:21,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:21:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1238810898, now seen corresponding path program 4 times [2024-10-11 17:21:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435288635] [2024-10-11 17:21:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435288635] [2024-10-11 17:21:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435288635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487641062] [2024-10-11 17:21:21,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:21:21,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:21,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:21,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:21,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:21:21,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:21:21,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:21,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:21:21,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:21,977 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-11 17:21:22,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:22,020 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-11 17:21:22,065 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-11 17:21:22,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:21:22,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:22,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:21:22,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:22,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:21:22,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:21:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:22,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:22,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2024-10-11 17:21:22,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))))))) is different from false [2024-10-11 17:21:22,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:21:22,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:21:22,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_490 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)))) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_490) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:21:22,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:22,326 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-11 17:21:22,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:22,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-10-11 17:21:22,342 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:22,342 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-11 17:21:22,350 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:22,351 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-11 17:21:22,358 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:22,358 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-11 17:21:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 17:21:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487641062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:22,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-10-11 17:21:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019661222] [2024-10-11 17:21:22,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:21:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:21:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=206, Unknown=5, NotChecked=160, Total=420 [2024-10-11 17:21:22,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-10-11 17:21:22,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1561 transitions, 26782 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:22,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:22,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-10-11 17:21:22,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:32,826 INFO L124 PetriNetUnfolderBase]: 16812/35384 cut-off events. [2024-10-11 17:21:32,826 INFO L125 PetriNetUnfolderBase]: For 294894/297102 co-relation queries the response was YES. [2024-10-11 17:21:33,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195516 conditions, 35384 events. 16812/35384 cut-off events. For 294894/297102 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 355631 event pairs, 3159 based on Foata normal form. 547/34235 useless extension candidates. Maximal degree in co-relation 193164. Up to 18867 conditions per place. [2024-10-11 17:21:33,451 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 979 selfloop transitions, 994 changer transitions 1/2028 dead transitions. [2024-10-11 17:21:33,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 2028 transitions, 38530 flow [2024-10-11 17:21:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 17:21:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 17:21:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2024-10-11 17:21:33,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5730392156862745 [2024-10-11 17:21:33,454 INFO L175 Difference]: Start difference. First operand has 242 places, 1561 transitions, 26782 flow. Second operand 20 states and 1169 transitions. [2024-10-11 17:21:33,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 2028 transitions, 38530 flow [2024-10-11 17:21:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2028 transitions, 38339 flow, removed 62 selfloop flow, removed 14 redundant places. [2024-10-11 17:21:36,301 INFO L231 Difference]: Finished difference. Result has 253 places, 1885 transitions, 36341 flow [2024-10-11 17:21:36,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=26611, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=708, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=36341, PETRI_PLACES=253, PETRI_TRANSITIONS=1885} [2024-10-11 17:21:36,303 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 151 predicate places. [2024-10-11 17:21:36,303 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 1885 transitions, 36341 flow [2024-10-11 17:21:36,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:36,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:36,304 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:36,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:21:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:21:36,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:21:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1107517796, now seen corresponding path program 5 times [2024-10-11 17:21:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227745957] [2024-10-11 17:21:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227745957] [2024-10-11 17:21:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227745957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921452174] [2024-10-11 17:21:36,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:21:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:36,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:21:37,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:21:37,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:37,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:21:37,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:37,009 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-11 17:21:37,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:37,019 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-11 17:21:37,051 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-11 17:21:37,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:21:37,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:37,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:21:37,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:37,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:21:37,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:21:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:37,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:37,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))))) is different from false [2024-10-11 17:21:37,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:21:39,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_554 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_554) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2024-10-11 17:21:39,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:39,470 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-11 17:21:39,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:39,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-10-11 17:21:39,481 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:39,481 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-11 17:21:39,486 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:39,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-11 17:21:39,491 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:39,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 50 treesize of output 1 [2024-10-11 17:21:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 17:21:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921452174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:39,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-10-11 17:21:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758704665] [2024-10-11 17:21:39,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:21:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:21:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=246, Unknown=19, NotChecked=102, Total=420 [2024-10-11 17:21:39,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-10-11 17:21:39,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 1885 transitions, 36341 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:39,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:39,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-10-11 17:21:39,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand