./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/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:00:41,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:00:42,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:00:42,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:00:42,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:00:42,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:00:42,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:00:42,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:00:42,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:00:42,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:00:42,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:00:42,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:00:42,054 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:00:42,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:00:42,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:00:42,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:00:42,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:00:42,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:00:42,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:00:42,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:00:42,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:00:42,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:00:42,059 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:00:42,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:00:42,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:00:42,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:00:42,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:00:42,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:00:42,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:42,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:00:42,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:00:42,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:00:42,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:00:42,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:00:42,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:00:42,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:00:42,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 [2024-10-13 10:00:42,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:00:42,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:00:42,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:00:42,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:00:42,287 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:00:42,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-13 10:00:43,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:00:43,645 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:00:43,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-13 10:00:43,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238986773/653e06d901b547bf8327bdddcc41fb73/FLAGdb68a75b5 [2024-10-13 10:00:43,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238986773/653e06d901b547bf8327bdddcc41fb73 [2024-10-13 10:00:43,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:00:43,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:00:43,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:43,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:00:43,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:00:43,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b67cecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43, skipping insertion in model container [2024-10-13 10:00:43,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:00:43,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:43,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:00:43,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:43,932 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:00:43,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43 WrapperNode [2024-10-13 10:00:43,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:43,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:43,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:00:43,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:00:43,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,970 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 147 [2024-10-13 10:00:43,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:43,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:00:43,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:00:43,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:00:43,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:43,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:44,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:00:44,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:00:44,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:00:44,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:00:44,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (1/1) ... [2024-10-13 10:00:44,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:44,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:44,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:00:44,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:00:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:00:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 10:00:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 10:00:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 10:00:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 10:00:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 10:00:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 10:00:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:00:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:00:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 10:00:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 10:00:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:00:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:00:44,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:00:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:00:44,081 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:00:44,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:00:44,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:00:44,568 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:00:44,568 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:00:44,694 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:00:44,694 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 10:00:44,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:44 BoogieIcfgContainer [2024-10-13 10:00:44,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:00:44,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:00:44,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:00:44,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:00:44,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:00:43" (1/3) ... [2024-10-13 10:00:44,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507b733e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:44, skipping insertion in model container [2024-10-13 10:00:44,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:43" (2/3) ... [2024-10-13 10:00:44,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507b733e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:44, skipping insertion in model container [2024-10-13 10:00:44,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:44" (3/3) ... [2024-10-13 10:00:44,706 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2024-10-13 10:00:44,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:00:44,720 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-13 10:00:44,720 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:00:44,794 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 10:00:44,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 267 transitions, 555 flow [2024-10-13 10:00:44,919 INFO L124 PetriNetUnfolderBase]: 16/264 cut-off events. [2024-10-13 10:00:44,919 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 10:00:44,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 16/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 375 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2024-10-13 10:00:44,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 267 transitions, 555 flow [2024-10-13 10:00:44,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 247 transitions, 512 flow [2024-10-13 10:00:44,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:00:44,952 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;@40de809d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:00:44,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-13 10:00:44,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:00:44,958 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-13 10:00:44,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:00:44,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:44,958 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] [2024-10-13 10:00:44,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 510647353, now seen corresponding path program 1 times [2024-10-13 10:00:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425840539] [2024-10-13 10:00:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425840539] [2024-10-13 10:00:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425840539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854184762] [2024-10-13 10:00:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:45,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:45,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:45,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2024-10-13 10:00:45,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2024-10-13 10:00:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:45,457 INFO L124 PetriNetUnfolderBase]: 110/714 cut-off events. [2024-10-13 10:00:45,458 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-13 10:00:45,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 714 events. 110/714 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3768 event pairs, 71 based on Foata normal form. 6/609 useless extension candidates. Maximal degree in co-relation 712. Up to 174 conditions per place. [2024-10-13 10:00:45,469 INFO L140 encePairwiseOnDemand]: 245/267 looper letters, 19 selfloop transitions, 2 changer transitions 4/227 dead transitions. [2024-10-13 10:00:45,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 514 flow [2024-10-13 10:00:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-10-13 10:00:45,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8863920099875156 [2024-10-13 10:00:45,488 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 512 flow. Second operand 3 states and 710 transitions. [2024-10-13 10:00:45,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 514 flow [2024-10-13 10:00:45,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 502 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 10:00:45,497 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 456 flow [2024-10-13 10:00:45,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2024-10-13 10:00:45,502 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -15 predicate places. [2024-10-13 10:00:45,503 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 456 flow [2024-10-13 10:00:45,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:45,504 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] [2024-10-13 10:00:45,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:00:45,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1867613618, now seen corresponding path program 1 times [2024-10-13 10:00:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:45,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210437209] [2024-10-13 10:00:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:45,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:45,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210437209] [2024-10-13 10:00:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210437209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234278948] [2024-10-13 10:00:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:45,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:45,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:45,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-13 10:00:45,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-13 10:00:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:45,788 INFO L124 PetriNetUnfolderBase]: 262/953 cut-off events. [2024-10-13 10:00:45,788 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-13 10:00:45,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 953 events. 262/953 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5407 event pairs, 164 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1312. Up to 365 conditions per place. [2024-10-13 10:00:45,802 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 20 selfloop transitions, 1 changer transitions 2/217 dead transitions. [2024-10-13 10:00:45,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 488 flow [2024-10-13 10:00:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-10-13 10:00:45,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8476903870162297 [2024-10-13 10:00:45,806 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 456 flow. Second operand 3 states and 679 transitions. [2024-10-13 10:00:45,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 488 flow [2024-10-13 10:00:45,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:45,816 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 438 flow [2024-10-13 10:00:45,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2024-10-13 10:00:45,817 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-13 10:00:45,817 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 438 flow [2024-10-13 10:00:45,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:45,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:45,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:00:45,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:45,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash -75217045, now seen corresponding path program 1 times [2024-10-13 10:00:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:45,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850895526] [2024-10-13 10:00:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:46,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850895526] [2024-10-13 10:00:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850895526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591484160] [2024-10-13 10:00:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:46,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 267 [2024-10-13 10:00:46,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:46,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 267 [2024-10-13 10:00:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,560 INFO L124 PetriNetUnfolderBase]: 146/871 cut-off events. [2024-10-13 10:00:46,560 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 10:00:46,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 871 events. 146/871 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4903 event pairs, 92 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1107. Up to 232 conditions per place. [2024-10-13 10:00:46,566 INFO L140 encePairwiseOnDemand]: 255/267 looper letters, 30 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2024-10-13 10:00:46,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 213 transitions, 514 flow [2024-10-13 10:00:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1266 transitions. [2024-10-13 10:00:46,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7902621722846442 [2024-10-13 10:00:46,568 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 438 flow. Second operand 6 states and 1266 transitions. [2024-10-13 10:00:46,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 213 transitions, 514 flow [2024-10-13 10:00:46,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:46,572 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 453 flow [2024-10-13 10:00:46,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2024-10-13 10:00:46,574 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-13 10:00:46,574 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 453 flow [2024-10-13 10:00:46,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,575 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:00:46,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:46,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -518200873, now seen corresponding path program 1 times [2024-10-13 10:00:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424676750] [2024-10-13 10:00:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424676750] [2024-10-13 10:00:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424676750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229534373] [2024-10-13 10:00:46,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:46,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:46,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2024-10-13 10:00:46,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:46,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2024-10-13 10:00:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,689 INFO L124 PetriNetUnfolderBase]: 59/395 cut-off events. [2024-10-13 10:00:46,689 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 10:00:46,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 395 events. 59/395 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1412 event pairs, 38 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 481. Up to 93 conditions per place. [2024-10-13 10:00:46,692 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 14 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-13 10:00:46,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 212 transitions, 483 flow [2024-10-13 10:00:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2024-10-13 10:00:46,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2024-10-13 10:00:46,694 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 453 flow. Second operand 3 states and 701 transitions. [2024-10-13 10:00:46,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 212 transitions, 483 flow [2024-10-13 10:00:46,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 212 transitions, 463 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:46,697 INFO L231 Difference]: Finished difference. Result has 213 places, 212 transitions, 435 flow [2024-10-13 10:00:46,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=213, PETRI_TRANSITIONS=212} [2024-10-13 10:00:46,698 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -29 predicate places. [2024-10-13 10:00:46,699 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 212 transitions, 435 flow [2024-10-13 10:00:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:46,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:00:46,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:46,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash 20922305, now seen corresponding path program 1 times [2024-10-13 10:00:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629413961] [2024-10-13 10:00:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629413961] [2024-10-13 10:00:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629413961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103298357] [2024-10-13 10:00:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:46,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-13 10:00:46,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 212 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:46,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-13 10:00:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,790 INFO L124 PetriNetUnfolderBase]: 35/296 cut-off events. [2024-10-13 10:00:46,790 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 10:00:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 296 events. 35/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 748 event pairs, 20 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 336. Up to 59 conditions per place. [2024-10-13 10:00:46,792 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 13 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-13 10:00:46,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 463 flow [2024-10-13 10:00:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-10-13 10:00:46,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776529338327091 [2024-10-13 10:00:46,794 INFO L175 Difference]: Start difference. First operand has 213 places, 212 transitions, 435 flow. Second operand 3 states and 703 transitions. [2024-10-13 10:00:46,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 463 flow [2024-10-13 10:00:46,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:46,796 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 433 flow [2024-10-13 10:00:46,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2024-10-13 10:00:46,799 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -30 predicate places. [2024-10-13 10:00:46,799 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 433 flow [2024-10-13 10:00:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,800 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:46,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:00:46,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -987699900, now seen corresponding path program 1 times [2024-10-13 10:00:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065949062] [2024-10-13 10:00:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065949062] [2024-10-13 10:00:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065949062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766474601] [2024-10-13 10:00:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:46,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-13 10:00:46,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:46,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-13 10:00:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,950 INFO L124 PetriNetUnfolderBase]: 120/669 cut-off events. [2024-10-13 10:00:46,951 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 10:00:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 669 events. 120/669 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3254 event pairs, 38 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 842. Up to 100 conditions per place. [2024-10-13 10:00:46,954 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 17 selfloop transitions, 2 changer transitions 2/215 dead transitions. [2024-10-13 10:00:46,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 215 transitions, 483 flow [2024-10-13 10:00:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-10-13 10:00:46,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.885143570536829 [2024-10-13 10:00:46,957 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 433 flow. Second operand 3 states and 709 transitions. [2024-10-13 10:00:46,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 215 transitions, 483 flow [2024-10-13 10:00:46,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 215 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:46,960 INFO L231 Difference]: Finished difference. Result has 210 places, 207 transitions, 425 flow [2024-10-13 10:00:46,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=210, PETRI_TRANSITIONS=207} [2024-10-13 10:00:46,961 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -32 predicate places. [2024-10-13 10:00:46,961 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 207 transitions, 425 flow [2024-10-13 10:00:46,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,962 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:46,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:00:46,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 8192390, now seen corresponding path program 1 times [2024-10-13 10:00:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304027845] [2024-10-13 10:00:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:47,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:47,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304027845] [2024-10-13 10:00:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304027845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:47,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489416433] [2024-10-13 10:00:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:47,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:47,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:47,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 267 [2024-10-13 10:00:47,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 207 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 267 [2024-10-13 10:00:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:47,102 INFO L124 PetriNetUnfolderBase]: 104/641 cut-off events. [2024-10-13 10:00:47,102 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-13 10:00:47,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 641 events. 104/641 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3187 event pairs, 12 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 801. Up to 143 conditions per place. [2024-10-13 10:00:47,106 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-13 10:00:47,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 215 transitions, 490 flow [2024-10-13 10:00:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-10-13 10:00:47,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8976279650436954 [2024-10-13 10:00:47,108 INFO L175 Difference]: Start difference. First operand has 210 places, 207 transitions, 425 flow. Second operand 3 states and 719 transitions. [2024-10-13 10:00:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 215 transitions, 490 flow [2024-10-13 10:00:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:47,112 INFO L231 Difference]: Finished difference. Result has 208 places, 208 transitions, 433 flow [2024-10-13 10:00:47,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=208, PETRI_TRANSITIONS=208} [2024-10-13 10:00:47,113 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -34 predicate places. [2024-10-13 10:00:47,113 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 208 transitions, 433 flow [2024-10-13 10:00:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:47,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:47,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:00:47,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1371360790, now seen corresponding path program 1 times [2024-10-13 10:00:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073577848] [2024-10-13 10:00:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073577848] [2024-10-13 10:00:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073577848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:00:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128428657] [2024-10-13 10:00:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:47,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:00:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:00:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:00:47,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 267 [2024-10-13 10:00:47,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 208 transitions, 433 flow. Second operand has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:47,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:47,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 267 [2024-10-13 10:00:47,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:47,684 INFO L124 PetriNetUnfolderBase]: 258/1319 cut-off events. [2024-10-13 10:00:47,684 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-10-13 10:00:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 1319 events. 258/1319 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7489 event pairs, 150 based on Foata normal form. 13/1261 useless extension candidates. Maximal degree in co-relation 1917. Up to 274 conditions per place. [2024-10-13 10:00:47,691 INFO L140 encePairwiseOnDemand]: 246/267 looper letters, 46 selfloop transitions, 28 changer transitions 0/247 dead transitions. [2024-10-13 10:00:47,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 677 flow [2024-10-13 10:00:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:00:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:00:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2192 transitions. [2024-10-13 10:00:47,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8209737827715355 [2024-10-13 10:00:47,695 INFO L175 Difference]: Start difference. First operand has 208 places, 208 transitions, 433 flow. Second operand 10 states and 2192 transitions. [2024-10-13 10:00:47,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 677 flow [2024-10-13 10:00:47,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 247 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:47,699 INFO L231 Difference]: Finished difference. Result has 221 places, 224 transitions, 562 flow [2024-10-13 10:00:47,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=562, PETRI_PLACES=221, PETRI_TRANSITIONS=224} [2024-10-13 10:00:47,700 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -21 predicate places. [2024-10-13 10:00:47,700 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 224 transitions, 562 flow [2024-10-13 10:00:47,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:47,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:47,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:00:47,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:47,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1479561612, now seen corresponding path program 1 times [2024-10-13 10:00:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:47,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083881962] [2024-10-13 10:00:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:00:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083881962] [2024-10-13 10:00:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083881962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071385374] [2024-10-13 10:00:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:48,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:48,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-13 10:00:48,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 224 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:48,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-13 10:00:48,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:48,515 INFO L124 PetriNetUnfolderBase]: 408/1670 cut-off events. [2024-10-13 10:00:48,516 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-10-13 10:00:48,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1670 events. 408/1670 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10595 event pairs, 176 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 2711. Up to 517 conditions per place. [2024-10-13 10:00:48,524 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 51 selfloop transitions, 10 changer transitions 0/253 dead transitions. [2024-10-13 10:00:48,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 253 transitions, 758 flow [2024-10-13 10:00:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2024-10-13 10:00:48,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8495630461922596 [2024-10-13 10:00:48,527 INFO L175 Difference]: Start difference. First operand has 221 places, 224 transitions, 562 flow. Second operand 6 states and 1361 transitions. [2024-10-13 10:00:48,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 253 transitions, 758 flow [2024-10-13 10:00:48,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 253 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:48,531 INFO L231 Difference]: Finished difference. Result has 231 places, 233 transitions, 642 flow [2024-10-13 10:00:48,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=231, PETRI_TRANSITIONS=233} [2024-10-13 10:00:48,532 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -11 predicate places. [2024-10-13 10:00:48,532 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 233 transitions, 642 flow [2024-10-13 10:00:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:48,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:00:48,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 828749171, now seen corresponding path program 1 times [2024-10-13 10:00:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505594484] [2024-10-13 10:00:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:48,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505594484] [2024-10-13 10:00:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505594484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:48,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:48,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139520015] [2024-10-13 10:00:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:48,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:48,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2024-10-13 10:00:48,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 233 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:48,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2024-10-13 10:00:48,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:48,670 INFO L124 PetriNetUnfolderBase]: 163/917 cut-off events. [2024-10-13 10:00:48,671 INFO L125 PetriNetUnfolderBase]: For 437/479 co-relation queries the response was YES. [2024-10-13 10:00:48,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 917 events. 163/917 cut-off events. For 437/479 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4690 event pairs, 58 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 1511. Up to 221 conditions per place. [2024-10-13 10:00:48,677 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 14 selfloop transitions, 0 changer transitions 16/232 dead transitions. [2024-10-13 10:00:48,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 232 transitions, 672 flow [2024-10-13 10:00:48,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-10-13 10:00:48,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2024-10-13 10:00:48,679 INFO L175 Difference]: Start difference. First operand has 231 places, 233 transitions, 642 flow. Second operand 3 states and 711 transitions. [2024-10-13 10:00:48,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 232 transitions, 672 flow [2024-10-13 10:00:48,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 664 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:48,687 INFO L231 Difference]: Finished difference. Result has 232 places, 216 transitions, 556 flow [2024-10-13 10:00:48,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=232, PETRI_TRANSITIONS=216} [2024-10-13 10:00:48,688 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -10 predicate places. [2024-10-13 10:00:48,688 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 216 transitions, 556 flow [2024-10-13 10:00:48,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:48,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:48,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:00:48,689 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:48,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1005685385, now seen corresponding path program 1 times [2024-10-13 10:00:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541632744] [2024-10-13 10:00:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:00:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:48,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541632744] [2024-10-13 10:00:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541632744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:48,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000058291] [2024-10-13 10:00:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:48,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:48,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-13 10:00:48,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 216 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:48,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-13 10:00:48,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:48,932 INFO L124 PetriNetUnfolderBase]: 356/1390 cut-off events. [2024-10-13 10:00:48,933 INFO L125 PetriNetUnfolderBase]: For 478/482 co-relation queries the response was YES. [2024-10-13 10:00:48,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1390 events. 356/1390 cut-off events. For 478/482 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9230 event pairs, 152 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 2441. Up to 391 conditions per place. [2024-10-13 10:00:48,942 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 24 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-10-13 10:00:48,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 630 flow [2024-10-13 10:00:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-10-13 10:00:48,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8838951310861424 [2024-10-13 10:00:48,944 INFO L175 Difference]: Start difference. First operand has 232 places, 216 transitions, 556 flow. Second operand 3 states and 708 transitions. [2024-10-13 10:00:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 630 flow [2024-10-13 10:00:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 222 transitions, 592 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-13 10:00:48,949 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 520 flow [2024-10-13 10:00:48,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-10-13 10:00:48,951 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -23 predicate places. [2024-10-13 10:00:48,951 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 520 flow [2024-10-13 10:00:48,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:48,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:48,952 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:48,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:48,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1866061374, now seen corresponding path program 1 times [2024-10-13 10:00:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456562376] [2024-10-13 10:00:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:00:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456562376] [2024-10-13 10:00:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456562376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:49,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:49,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 10:00:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913312352] [2024-10-13 10:00:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:49,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:00:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:00:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:00:50,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-13 10:00:50,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 520 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:50,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:50,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-13 10:00:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:51,199 INFO L124 PetriNetUnfolderBase]: 975/3353 cut-off events. [2024-10-13 10:00:51,200 INFO L125 PetriNetUnfolderBase]: For 1066/1168 co-relation queries the response was YES. [2024-10-13 10:00:51,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3353 events. 975/3353 cut-off events. For 1066/1168 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27959 event pairs, 221 based on Foata normal form. 52/3183 useless extension candidates. Maximal degree in co-relation 6297. Up to 583 conditions per place. [2024-10-13 10:00:51,222 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 81 selfloop transitions, 44 changer transitions 0/285 dead transitions. [2024-10-13 10:00:51,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 285 transitions, 1030 flow [2024-10-13 10:00:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 10:00:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-13 10:00:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-13 10:00:51,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-13 10:00:51,231 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 520 flow. Second operand 24 states and 4804 transitions. [2024-10-13 10:00:51,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 285 transitions, 1030 flow [2024-10-13 10:00:51,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 285 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:51,238 INFO L231 Difference]: Finished difference. Result has 245 places, 240 transitions, 792 flow [2024-10-13 10:00:51,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=792, PETRI_PLACES=245, PETRI_TRANSITIONS=240} [2024-10-13 10:00:51,239 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-10-13 10:00:51,239 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 240 transitions, 792 flow [2024-10-13 10:00:51,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:51,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:51,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:51,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:51,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1913155474, now seen corresponding path program 2 times [2024-10-13 10:00:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52760665] [2024-10-13 10:00:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:00:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52760665] [2024-10-13 10:00:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52760665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:51,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:51,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 10:00:51,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523689782] [2024-10-13 10:00:51,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:51,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:00:51,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:00:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:00:52,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-13 10:00:52,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 240 transitions, 792 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:52,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:52,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-13 10:00:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:53,516 INFO L124 PetriNetUnfolderBase]: 1458/4674 cut-off events. [2024-10-13 10:00:53,517 INFO L125 PetriNetUnfolderBase]: For 5865/6167 co-relation queries the response was YES. [2024-10-13 10:00:53,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10890 conditions, 4674 events. 1458/4674 cut-off events. For 5865/6167 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 41797 event pairs, 389 based on Foata normal form. 170/4583 useless extension candidates. Maximal degree in co-relation 10874. Up to 1033 conditions per place. [2024-10-13 10:00:53,555 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 85 selfloop transitions, 65 changer transitions 0/310 dead transitions. [2024-10-13 10:00:53,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 310 transitions, 1488 flow [2024-10-13 10:00:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 10:00:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-13 10:00:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-13 10:00:53,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-13 10:00:53,567 INFO L175 Difference]: Start difference. First operand has 245 places, 240 transitions, 792 flow. Second operand 24 states and 4804 transitions. [2024-10-13 10:00:53,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 310 transitions, 1488 flow [2024-10-13 10:00:53,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 310 transitions, 1455 flow, removed 0 selfloop flow, removed 17 redundant places. [2024-10-13 10:00:53,580 INFO L231 Difference]: Finished difference. Result has 256 places, 272 transitions, 1224 flow [2024-10-13 10:00:53,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1224, PETRI_PLACES=256, PETRI_TRANSITIONS=272} [2024-10-13 10:00:53,582 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 14 predicate places. [2024-10-13 10:00:53,582 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 272 transitions, 1224 flow [2024-10-13 10:00:53,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:53,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:53,583 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:00:53,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1407441473, now seen corresponding path program 1 times [2024-10-13 10:00:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598679882] [2024-10-13 10:00:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598679882] [2024-10-13 10:00:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598679882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:00:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82994087] [2024-10-13 10:00:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:53,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:00:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:53,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:00:53,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:00:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:53,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:00:53,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:00:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:54,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:00:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82994087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:00:54,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:00:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-13 10:00:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88119331] [2024-10-13 10:00:54,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:00:54,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:00:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:00:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:00:55,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-13 10:00:55,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 272 transitions, 1224 flow. Second operand has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:55,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:55,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-13 10:00:55,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:56,696 INFO L124 PetriNetUnfolderBase]: 2502/7426 cut-off events. [2024-10-13 10:00:56,697 INFO L125 PetriNetUnfolderBase]: For 11997/12868 co-relation queries the response was YES. [2024-10-13 10:00:56,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18804 conditions, 7426 events. 2502/7426 cut-off events. For 11997/12868 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 70468 event pairs, 1113 based on Foata normal form. 208/7199 useless extension candidates. Maximal degree in co-relation 18783. Up to 2249 conditions per place. [2024-10-13 10:00:56,750 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 117 selfloop transitions, 71 changer transitions 1/383 dead transitions. [2024-10-13 10:00:56,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 383 transitions, 2144 flow [2024-10-13 10:00:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:00:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-13 10:00:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4794 transitions. [2024-10-13 10:00:56,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806546165119688 [2024-10-13 10:00:56,759 INFO L175 Difference]: Start difference. First operand has 256 places, 272 transitions, 1224 flow. Second operand 23 states and 4794 transitions. [2024-10-13 10:00:56,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 383 transitions, 2144 flow [2024-10-13 10:00:56,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 383 transitions, 2055 flow, removed 26 selfloop flow, removed 17 redundant places. [2024-10-13 10:00:56,785 INFO L231 Difference]: Finished difference. Result has 274 places, 319 transitions, 1668 flow [2024-10-13 10:00:56,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1668, PETRI_PLACES=274, PETRI_TRANSITIONS=319} [2024-10-13 10:00:56,786 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 32 predicate places. [2024-10-13 10:00:56,786 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 319 transitions, 1668 flow [2024-10-13 10:00:56,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:56,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:56,788 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:56,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:00:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 10:00:56,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:00:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -863254300, now seen corresponding path program 1 times [2024-10-13 10:00:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019384122] [2024-10-13 10:00:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019384122] [2024-10-13 10:00:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019384122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:00:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438781553] [2024-10-13 10:00:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:00:57,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:57,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:00:57,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:00:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:00:57,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:00:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:57,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:00:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:00:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438781553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:00:58,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:00:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-13 10:00:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180291722] [2024-10-13 10:00:58,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:00:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:00:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:00:58,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-13 10:00:58,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 319 transitions, 1668 flow. Second operand has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:58,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-13 10:00:58,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:00,583 INFO L124 PetriNetUnfolderBase]: 2295/8330 cut-off events. [2024-10-13 10:01:00,584 INFO L125 PetriNetUnfolderBase]: For 14521/14707 co-relation queries the response was YES. [2024-10-13 10:01:00,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21209 conditions, 8330 events. 2295/8330 cut-off events. For 14521/14707 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 79861 event pairs, 805 based on Foata normal form. 89/7995 useless extension candidates. Maximal degree in co-relation 21175. Up to 1735 conditions per place. [2024-10-13 10:01:00,631 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 65 selfloop transitions, 33 changer transitions 119/411 dead transitions. [2024-10-13 10:01:00,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 411 transitions, 2576 flow [2024-10-13 10:01:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:01:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-13 10:01:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4806 transitions. [2024-10-13 10:01:00,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2024-10-13 10:01:00,639 INFO L175 Difference]: Start difference. First operand has 274 places, 319 transitions, 1668 flow. Second operand 23 states and 4806 transitions. [2024-10-13 10:01:00,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 411 transitions, 2576 flow [2024-10-13 10:01:00,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 411 transitions, 2550 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:00,679 INFO L231 Difference]: Finished difference. Result has 300 places, 280 transitions, 1405 flow [2024-10-13 10:01:00,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1405, PETRI_PLACES=300, PETRI_TRANSITIONS=280} [2024-10-13 10:01:00,680 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 58 predicate places. [2024-10-13 10:01:00,680 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 280 transitions, 1405 flow [2024-10-13 10:01:00,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:00,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:00,682 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:00,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:01:00,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 10:01:00,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-13 10:01:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash 963910473, now seen corresponding path program 2 times [2024-10-13 10:01:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:00,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43271437] [2024-10-13 10:01:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:01:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43271437] [2024-10-13 10:01:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43271437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:01:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60212400] [2024-10-13 10:01:02,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:01:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:01:02,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:02,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:01:02,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:01:02,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:01:02,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:01:02,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-13 10:01:02,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:01:02,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:01:02,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:01:02,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:01:03,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:01:03,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:01:03,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:01:03,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 10:01:03,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:01:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:01:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:01:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:01:03,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2024-10-13 10:01:03,633 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 79 treesize of output 60 [2024-10-13 10:01:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:01:07,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:01:10,608 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-10-13 10:01:10,609 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 8 case distinctions, treesize of input 82 treesize of output 118 [2024-10-13 10:01:10,625 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-13 10:01:10,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2024-10-13 10:01:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-10-13 10:01:10,651 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-13 10:01:10,652 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 8 case distinctions, treesize of input 81 treesize of output 1 [2024-10-13 10:01:10,667 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-13 10:01:10,667 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 8 case distinctions, treesize of input 82 treesize of output 1 [2024-10-13 10:01:10,687 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-13 10:01:10,688 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 8 case distinctions, treesize of input 82 treesize of output 1 [2024-10-13 10:01:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:01:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60212400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:01:36,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:01:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 65 [2024-10-13 10:01:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132422824] [2024-10-13 10:01:36,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:01:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-13 10:01:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-13 10:01:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3884, Unknown=35, NotChecked=0, Total=4290 [2024-10-13 10:01:40,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:01:44,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:01:48,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:01:52,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:01:56,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:02:00,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:02:04,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:02:09,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:02:13,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:02:17,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]