./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-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:02,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:02,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:17:02,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:02,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:02,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:02,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:02,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:02,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:02,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:02,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:02,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:02,820 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:02,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:02,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:02,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:02,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:02,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:02,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:02,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:02,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:02,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:02,823 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:02,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:02,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:02,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:02,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:02,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:02,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:02,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:02,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:02,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:02,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:02,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:02,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:02,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:02,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:02,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:02,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:02,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:02,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:02,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2024-10-11 17:17:03,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:03,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:03,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:03,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:03,048 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:03,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2024-10-11 17:17:04,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:04,488 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:04,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2024-10-11 17:17:04,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e133f894a/0837d59bc08f4c3a89fb04c70c940c76/FLAG0d0afb037 [2024-10-11 17:17:04,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e133f894a/0837d59bc08f4c3a89fb04c70c940c76 [2024-10-11 17:17:04,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:04,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:04,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:04,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:04,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:04,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7846a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:04, skipping insertion in model container [2024-10-11 17:17:04,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:04" (1/1) ... [2024-10-11 17:17:04,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:05,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:05,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:05,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:05,203 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:05,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05 WrapperNode [2024-10-11 17:17:05,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:05,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:05,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:05,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:05,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,250 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 304 [2024-10-11 17:17:05,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:05,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:05,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:05,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:05,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:05,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:05,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:05,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:05,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (1/1) ... [2024-10-11 17:17:05,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:05,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:05,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:17:05,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:17:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:17:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:17:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:05,369 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:17:05,461 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:05,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:05,967 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:05,968 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:06,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:06,188 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:17:06,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:06 BoogieIcfgContainer [2024-10-11 17:17:06,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:06,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:06,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:06,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:06,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:04" (1/3) ... [2024-10-11 17:17:06,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fab749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:06, skipping insertion in model container [2024-10-11 17:17:06,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:05" (2/3) ... [2024-10-11 17:17:06,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fab749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:06, skipping insertion in model container [2024-10-11 17:17:06,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:06" (3/3) ... [2024-10-11 17:17:06,198 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2024-10-11 17:17:06,212 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:06,214 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-11 17:17:06,214 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:06,273 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:17:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 256 transitions, 533 flow [2024-10-11 17:17:06,391 INFO L124 PetriNetUnfolderBase]: 9/253 cut-off events. [2024-10-11 17:17:06,391 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:06,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 9/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 352 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 189. Up to 2 conditions per place. [2024-10-11 17:17:06,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 256 transitions, 533 flow [2024-10-11 17:17:06,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 236 transitions, 490 flow [2024-10-11 17:17:06,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:06,422 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;@6e50023c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:06,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-10-11 17:17:06,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:06,427 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:17:06,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:06,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:06,428 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-11 17:17:06,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:06,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1654981696, now seen corresponding path program 1 times [2024-10-11 17:17:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682511646] [2024-10-11 17:17:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682511646] [2024-10-11 17:17:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682511646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528694046] [2024-10-11 17:17:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:06,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:06,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-10-11 17:17:06,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 236 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:06,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:06,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-10-11 17:17:06,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:06,851 INFO L124 PetriNetUnfolderBase]: 96/510 cut-off events. [2024-10-11 17:17:06,852 INFO L125 PetriNetUnfolderBase]: For 54/74 co-relation queries the response was YES. [2024-10-11 17:17:06,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 510 events. 96/510 cut-off events. For 54/74 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2237 event pairs, 71 based on Foata normal form. 3/456 useless extension candidates. Maximal degree in co-relation 548. Up to 160 conditions per place. [2024-10-11 17:17:06,859 INFO L140 encePairwiseOnDemand]: 225/256 looper letters, 16 selfloop transitions, 2 changer transitions 2/207 dead transitions. [2024-10-11 17:17:06,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 207 transitions, 468 flow [2024-10-11 17:17:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-10-11 17:17:06,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8658854166666666 [2024-10-11 17:17:06,881 INFO L175 Difference]: Start difference. First operand has 238 places, 236 transitions, 490 flow. Second operand 3 states and 665 transitions. [2024-10-11 17:17:06,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 207 transitions, 468 flow [2024-10-11 17:17:06,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 456 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:17:06,891 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 420 flow [2024-10-11 17:17:06,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2024-10-11 17:17:06,898 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2024-10-11 17:17:06,898 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 420 flow [2024-10-11 17:17:06,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:06,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:06,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:06,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:06,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:06,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1225850048, now seen corresponding path program 1 times [2024-10-11 17:17:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383960474] [2024-10-11 17:17:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:06,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:06,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383960474] [2024-10-11 17:17:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383960474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091444678] [2024-10-11 17:17:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:06,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:06,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-10-11 17:17:06,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:06,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:06,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-10-11 17:17:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,069 INFO L124 PetriNetUnfolderBase]: 43/728 cut-off events. [2024-10-11 17:17:07,070 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:17:07,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 728 events. 43/728 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3867 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 797. Up to 81 conditions per place. [2024-10-11 17:17:07,078 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 14 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-10-11 17:17:07,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 204 transitions, 450 flow [2024-10-11 17:17:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-10-11 17:17:07,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346354166666666 [2024-10-11 17:17:07,084 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 420 flow. Second operand 3 states and 641 transitions. [2024-10-11 17:17:07,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 204 transitions, 450 flow [2024-10-11 17:17:07,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:07,088 INFO L231 Difference]: Finished difference. Result has 207 places, 204 transitions, 418 flow [2024-10-11 17:17:07,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=207, PETRI_TRANSITIONS=204} [2024-10-11 17:17:07,091 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2024-10-11 17:17:07,091 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 204 transitions, 418 flow [2024-10-11 17:17:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,092 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] [2024-10-11 17:17:07,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:07,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:07,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1016754418, now seen corresponding path program 1 times [2024-10-11 17:17:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527761393] [2024-10-11 17:17:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527761393] [2024-10-11 17:17:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527761393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582411105] [2024-10-11 17:17:07,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:07,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 256 [2024-10-11 17:17:07,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 204 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 256 [2024-10-11 17:17:07,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,274 INFO L124 PetriNetUnfolderBase]: 43/727 cut-off events. [2024-10-11 17:17:07,275 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:17:07,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 727 events. 43/727 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3868 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 790. Up to 82 conditions per place. [2024-10-11 17:17:07,280 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 15 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-10-11 17:17:07,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 203 transitions, 450 flow [2024-10-11 17:17:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2024-10-11 17:17:07,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.83203125 [2024-10-11 17:17:07,282 INFO L175 Difference]: Start difference. First operand has 207 places, 204 transitions, 418 flow. Second operand 3 states and 639 transitions. [2024-10-11 17:17:07,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 203 transitions, 450 flow [2024-10-11 17:17:07,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:07,287 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 416 flow [2024-10-11 17:17:07,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2024-10-11 17:17:07,288 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-10-11 17:17:07,289 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 416 flow [2024-10-11 17:17:07,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,289 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] [2024-10-11 17:17:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:07,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 146855060, now seen corresponding path program 1 times [2024-10-11 17:17:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118434031] [2024-10-11 17:17:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118434031] [2024-10-11 17:17:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118434031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:07,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871456209] [2024-10-11 17:17:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:07,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 256 [2024-10-11 17:17:07,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 256 [2024-10-11 17:17:07,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,478 INFO L124 PetriNetUnfolderBase]: 79/764 cut-off events. [2024-10-11 17:17:07,478 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-11 17:17:07,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 764 events. 79/764 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4270 event pairs, 74 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 881. Up to 144 conditions per place. [2024-10-11 17:17:07,484 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 17 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-10-11 17:17:07,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 452 flow [2024-10-11 17:17:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-10-11 17:17:07,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8268229166666666 [2024-10-11 17:17:07,486 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 416 flow. Second operand 3 states and 635 transitions. [2024-10-11 17:17:07,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 452 flow [2024-10-11 17:17:07,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:07,506 INFO L231 Difference]: Finished difference. Result has 205 places, 202 transitions, 414 flow [2024-10-11 17:17:07,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=205, PETRI_TRANSITIONS=202} [2024-10-11 17:17:07,507 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2024-10-11 17:17:07,507 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 202 transitions, 414 flow [2024-10-11 17:17:07,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,508 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] [2024-10-11 17:17:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:07,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1571545145, now seen corresponding path program 1 times [2024-10-11 17:17:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585050374] [2024-10-11 17:17:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:07,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585050374] [2024-10-11 17:17:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585050374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:07,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101907860] [2024-10-11 17:17:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:07,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 256 [2024-10-11 17:17:07,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 256 [2024-10-11 17:17:07,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,728 INFO L124 PetriNetUnfolderBase]: 115/777 cut-off events. [2024-10-11 17:17:07,729 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-10-11 17:17:07,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 777 events. 115/777 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4380 event pairs, 110 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 945. Up to 203 conditions per place. [2024-10-11 17:17:07,735 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 17 selfloop transitions, 1 changer transitions 0/199 dead transitions. [2024-10-11 17:17:07,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 199 transitions, 444 flow [2024-10-11 17:17:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2024-10-11 17:17:07,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.828125 [2024-10-11 17:17:07,737 INFO L175 Difference]: Start difference. First operand has 205 places, 202 transitions, 414 flow. Second operand 3 states and 636 transitions. [2024-10-11 17:17:07,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 199 transitions, 444 flow [2024-10-11 17:17:07,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:07,740 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 406 flow [2024-10-11 17:17:07,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-10-11 17:17:07,743 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-10-11 17:17:07,743 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 406 flow [2024-10-11 17:17:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,744 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] [2024-10-11 17:17:07,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:07,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:07,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -377031059, now seen corresponding path program 1 times [2024-10-11 17:17:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94962918] [2024-10-11 17:17:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94962918] [2024-10-11 17:17:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94962918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188042339] [2024-10-11 17:17:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:07,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-10-11 17:17:07,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-10-11 17:17:07,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:07,877 INFO L124 PetriNetUnfolderBase]: 43/700 cut-off events. [2024-10-11 17:17:07,877 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:17:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 700 events. 43/700 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3645 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 745. Up to 81 conditions per place. [2024-10-11 17:17:07,881 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 14 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-10-11 17:17:07,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 436 flow [2024-10-11 17:17:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-10-11 17:17:07,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346354166666666 [2024-10-11 17:17:07,883 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 406 flow. Second operand 3 states and 641 transitions. [2024-10-11 17:17:07,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 436 flow [2024-10-11 17:17:07,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:07,885 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 407 flow [2024-10-11 17:17:07,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2024-10-11 17:17:07,886 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-10-11 17:17:07,886 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 407 flow [2024-10-11 17:17:07,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:07,887 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-11 17:17:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:07,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -792030389, now seen corresponding path program 1 times [2024-10-11 17:17:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677365091] [2024-10-11 17:17:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677365091] [2024-10-11 17:17:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677365091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246949680] [2024-10-11 17:17:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:07,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-10-11 17:17:07,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:07,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:07,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-10-11 17:17:07,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,017 INFO L124 PetriNetUnfolderBase]: 43/699 cut-off events. [2024-10-11 17:17:08,017 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-11 17:17:08,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 699 events. 43/699 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3644 event pairs, 38 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 744. Up to 79 conditions per place. [2024-10-11 17:17:08,021 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 13 selfloop transitions, 1 changer transitions 0/197 dead transitions. [2024-10-11 17:17:08,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 197 transitions, 433 flow [2024-10-11 17:17:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-10-11 17:17:08,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-10-11 17:17:08,022 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 407 flow. Second operand 3 states and 648 transitions. [2024-10-11 17:17:08,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 197 transitions, 433 flow [2024-10-11 17:17:08,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:08,025 INFO L231 Difference]: Finished difference. Result has 201 places, 197 transitions, 403 flow [2024-10-11 17:17:08,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=201, PETRI_TRANSITIONS=197} [2024-10-11 17:17:08,026 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -37 predicate places. [2024-10-11 17:17:08,026 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 197 transitions, 403 flow [2024-10-11 17:17:08,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:08,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,028 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] [2024-10-11 17:17:08,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:08,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:08,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 240995789, now seen corresponding path program 1 times [2024-10-11 17:17:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711481368] [2024-10-11 17:17:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711481368] [2024-10-11 17:17:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711481368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821559827] [2024-10-11 17:17:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:08,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 256 [2024-10-11 17:17:08,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 197 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:08,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 256 [2024-10-11 17:17:08,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,723 INFO L124 PetriNetUnfolderBase]: 187/850 cut-off events. [2024-10-11 17:17:08,723 INFO L125 PetriNetUnfolderBase]: For 40/41 co-relation queries the response was YES. [2024-10-11 17:17:08,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 850 events. 187/850 cut-off events. For 40/41 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5070 event pairs, 182 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1153. Up to 334 conditions per place. [2024-10-11 17:17:08,728 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 27 selfloop transitions, 5 changer transitions 0/196 dead transitions. [2024-10-11 17:17:08,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 465 flow [2024-10-11 17:17:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1191 transitions. [2024-10-11 17:17:08,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.775390625 [2024-10-11 17:17:08,731 INFO L175 Difference]: Start difference. First operand has 201 places, 197 transitions, 403 flow. Second operand 6 states and 1191 transitions. [2024-10-11 17:17:08,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 465 flow [2024-10-11 17:17:08,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:08,735 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 410 flow [2024-10-11 17:17:08,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2024-10-11 17:17:08,737 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -34 predicate places. [2024-10-11 17:17:08,738 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 410 flow [2024-10-11 17:17:08,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:08,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,739 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] [2024-10-11 17:17:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:08,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1483377538, now seen corresponding path program 1 times [2024-10-11 17:17:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747662446] [2024-10-11 17:17:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:08,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747662446] [2024-10-11 17:17:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747662446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987924919] [2024-10-11 17:17:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-10-11 17:17:08,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:08,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:08,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-10-11 17:17:08,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:08,916 INFO L124 PetriNetUnfolderBase]: 79/735 cut-off events. [2024-10-11 17:17:08,916 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-11 17:17:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 735 events. 79/735 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3965 event pairs, 74 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 884. Up to 143 conditions per place. [2024-10-11 17:17:08,921 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 16 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-10-11 17:17:08,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 195 transitions, 444 flow [2024-10-11 17:17:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2024-10-11 17:17:08,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294270833333334 [2024-10-11 17:17:08,923 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 410 flow. Second operand 3 states and 637 transitions. [2024-10-11 17:17:08,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 195 transitions, 444 flow [2024-10-11 17:17:08,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 195 transitions, 434 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:08,927 INFO L231 Difference]: Finished difference. Result has 200 places, 195 transitions, 402 flow [2024-10-11 17:17:08,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=200, PETRI_TRANSITIONS=195} [2024-10-11 17:17:08,928 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -38 predicate places. [2024-10-11 17:17:08,929 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 195 transitions, 402 flow [2024-10-11 17:17:08,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:08,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:08,930 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] [2024-10-11 17:17:08,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:08,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1303173861, now seen corresponding path program 1 times [2024-10-11 17:17:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:08,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140614324] [2024-10-11 17:17:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140614324] [2024-10-11 17:17:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140614324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268551858] [2024-10-11 17:17:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:08,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:08,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:08,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:08,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-10-11 17:17:09,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 195 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-10-11 17:17:09,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,099 INFO L124 PetriNetUnfolderBase]: 148/659 cut-off events. [2024-10-11 17:17:09,099 INFO L125 PetriNetUnfolderBase]: For 13/38 co-relation queries the response was YES. [2024-10-11 17:17:09,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 659 events. 148/659 cut-off events. For 13/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3298 event pairs, 97 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 883. Up to 235 conditions per place. [2024-10-11 17:17:09,105 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-10-11 17:17:09,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 452 flow [2024-10-11 17:17:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2024-10-11 17:17:09,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8424479166666666 [2024-10-11 17:17:09,107 INFO L175 Difference]: Start difference. First operand has 200 places, 195 transitions, 402 flow. Second operand 3 states and 647 transitions. [2024-10-11 17:17:09,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 452 flow [2024-10-11 17:17:09,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:09,115 INFO L231 Difference]: Finished difference. Result has 199 places, 195 transitions, 408 flow [2024-10-11 17:17:09,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=199, PETRI_TRANSITIONS=195} [2024-10-11 17:17:09,116 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -39 predicate places. [2024-10-11 17:17:09,116 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 195 transitions, 408 flow [2024-10-11 17:17:09,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,117 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] [2024-10-11 17:17:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:09,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1717335503, now seen corresponding path program 1 times [2024-10-11 17:17:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477554158] [2024-10-11 17:17:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477554158] [2024-10-11 17:17:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477554158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:09,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:09,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:09,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863120044] [2024-10-11 17:17:09,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:09,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:09,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:09,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:09,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-10-11 17:17:09,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 195 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-10-11 17:17:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,348 INFO L124 PetriNetUnfolderBase]: 129/874 cut-off events. [2024-10-11 17:17:09,349 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-10-11 17:17:09,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 874 events. 129/874 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5198 event pairs, 38 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1080. Up to 198 conditions per place. [2024-10-11 17:17:09,355 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 21 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2024-10-11 17:17:09,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 201 transitions, 470 flow [2024-10-11 17:17:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-10-11 17:17:09,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8463541666666666 [2024-10-11 17:17:09,358 INFO L175 Difference]: Start difference. First operand has 199 places, 195 transitions, 408 flow. Second operand 3 states and 650 transitions. [2024-10-11 17:17:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 201 transitions, 470 flow [2024-10-11 17:17:09,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 201 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:09,362 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 425 flow [2024-10-11 17:17:09,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-10-11 17:17:09,364 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -38 predicate places. [2024-10-11 17:17:09,364 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 425 flow [2024-10-11 17:17:09,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,365 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] [2024-10-11 17:17:09,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:09,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 248836725, now seen corresponding path program 1 times [2024-10-11 17:17:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486542399] [2024-10-11 17:17:09,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:09,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:09,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486542399] [2024-10-11 17:17:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486542399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:17:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106554138] [2024-10-11 17:17:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:09,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:09,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-10-11 17:17:09,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-10-11 17:17:09,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,562 INFO L124 PetriNetUnfolderBase]: 42/608 cut-off events. [2024-10-11 17:17:09,563 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2024-10-11 17:17:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 608 events. 42/608 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2719 event pairs, 16 based on Foata normal form. 7/574 useless extension candidates. Maximal degree in co-relation 705. Up to 60 conditions per place. [2024-10-11 17:17:09,566 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 18 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2024-10-11 17:17:09,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 472 flow [2024-10-11 17:17:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-10-11 17:17:09,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528645833333334 [2024-10-11 17:17:09,568 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 425 flow. Second operand 3 states and 655 transitions. [2024-10-11 17:17:09,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 472 flow [2024-10-11 17:17:09,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:09,572 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 431 flow [2024-10-11 17:17:09,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-10-11 17:17:09,574 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2024-10-11 17:17:09,574 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 431 flow [2024-10-11 17:17:09,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:09,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:09,575 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1443948509, now seen corresponding path program 1 times [2024-10-11 17:17:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61076074] [2024-10-11 17:17:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61076074] [2024-10-11 17:17:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61076074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:17:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044521826] [2024-10-11 17:17:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:09,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:17:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:17:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:17:09,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-10-11 17:17:09,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-10-11 17:17:09,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:09,767 INFO L124 PetriNetUnfolderBase]: 31/366 cut-off events. [2024-10-11 17:17:09,767 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2024-10-11 17:17:09,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 366 events. 31/366 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 929 event pairs, 8 based on Foata normal form. 9/355 useless extension candidates. Maximal degree in co-relation 458. Up to 24 conditions per place. [2024-10-11 17:17:09,769 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 18 selfloop transitions, 5 changer transitions 0/201 dead transitions. [2024-10-11 17:17:09,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 493 flow [2024-10-11 17:17:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:17:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:17:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2024-10-11 17:17:09,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84765625 [2024-10-11 17:17:09,771 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 431 flow. Second operand 4 states and 868 transitions. [2024-10-11 17:17:09,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 493 flow [2024-10-11 17:17:09,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:09,774 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 440 flow [2024-10-11 17:17:09,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2024-10-11 17:17:09,775 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2024-10-11 17:17:09,775 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 440 flow [2024-10-11 17:17:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:09,776 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] [2024-10-11 17:17:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:09,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:09,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:09,777 INFO L85 PathProgramCache]: Analyzing trace with hash -223500219, now seen corresponding path program 1 times [2024-10-11 17:17:09,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195787976] [2024-10-11 17:17:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195787976] [2024-10-11 17:17:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195787976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58195999] [2024-10-11 17:17:10,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:10,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 256 [2024-10-11 17:17:10,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:10,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:10,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 256 [2024-10-11 17:17:10,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:10,427 INFO L124 PetriNetUnfolderBase]: 42/384 cut-off events. [2024-10-11 17:17:10,427 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-11 17:17:10,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 384 events. 42/384 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1131 event pairs, 22 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 517. Up to 65 conditions per place. [2024-10-11 17:17:10,429 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 30 selfloop transitions, 4 changer transitions 0/202 dead transitions. [2024-10-11 17:17:10,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 202 transitions, 530 flow [2024-10-11 17:17:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2024-10-11 17:17:10,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.806640625 [2024-10-11 17:17:10,432 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 440 flow. Second operand 6 states and 1239 transitions. [2024-10-11 17:17:10,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 202 transitions, 530 flow [2024-10-11 17:17:10,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 202 transitions, 518 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-10-11 17:17:10,437 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 434 flow [2024-10-11 17:17:10,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2024-10-11 17:17:10,438 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-10-11 17:17:10,438 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 434 flow [2024-10-11 17:17:10,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:10,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:10,439 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] [2024-10-11 17:17:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:10,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 221640397, now seen corresponding path program 1 times [2024-10-11 17:17:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061205271] [2024-10-11 17:17:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061205271] [2024-10-11 17:17:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061205271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168020413] [2024-10-11 17:17:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:11,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 256 [2024-10-11 17:17:11,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 256 [2024-10-11 17:17:11,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,131 INFO L124 PetriNetUnfolderBase]: 42/371 cut-off events. [2024-10-11 17:17:11,132 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-11 17:17:11,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 371 events. 42/371 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 22 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 490. Up to 65 conditions per place. [2024-10-11 17:17:11,133 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 30 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2024-10-11 17:17:11,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 201 transitions, 524 flow [2024-10-11 17:17:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2024-10-11 17:17:11,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.806640625 [2024-10-11 17:17:11,137 INFO L175 Difference]: Start difference. First operand has 206 places, 194 transitions, 434 flow. Second operand 6 states and 1239 transitions. [2024-10-11 17:17:11,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 201 transitions, 524 flow [2024-10-11 17:17:11,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 201 transitions, 517 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:11,142 INFO L231 Difference]: Finished difference. Result has 206 places, 193 transitions, 433 flow [2024-10-11 17:17:11,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=193} [2024-10-11 17:17:11,144 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2024-10-11 17:17:11,144 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 193 transitions, 433 flow [2024-10-11 17:17:11,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,145 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] [2024-10-11 17:17:11,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:11,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1167097120, now seen corresponding path program 1 times [2024-10-11 17:17:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679006115] [2024-10-11 17:17:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679006115] [2024-10-11 17:17:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679006115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888250670] [2024-10-11 17:17:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:11,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 256 [2024-10-11 17:17:11,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 193 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 256 [2024-10-11 17:17:11,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,281 INFO L124 PetriNetUnfolderBase]: 40/360 cut-off events. [2024-10-11 17:17:11,281 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 17:17:11,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 360 events. 40/360 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1029 event pairs, 26 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 472. Up to 69 conditions per place. [2024-10-11 17:17:11,283 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 18 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-10-11 17:17:11,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 477 flow [2024-10-11 17:17:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-10-11 17:17:11,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2024-10-11 17:17:11,285 INFO L175 Difference]: Start difference. First operand has 206 places, 193 transitions, 433 flow. Second operand 3 states and 646 transitions. [2024-10-11 17:17:11,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 477 flow [2024-10-11 17:17:11,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 194 transitions, 470 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:17:11,289 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 428 flow [2024-10-11 17:17:11,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=203, PETRI_TRANSITIONS=192} [2024-10-11 17:17:11,290 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2024-10-11 17:17:11,290 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 428 flow [2024-10-11 17:17:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:11,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:11,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:11,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2024-10-11 17:17:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1307809786, now seen corresponding path program 1 times [2024-10-11 17:17:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040885088] [2024-10-11 17:17:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040885088] [2024-10-11 17:17:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040885088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035825067] [2024-10-11 17:17:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:11,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:11,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 256 [2024-10-11 17:17:11,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:11,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 256 [2024-10-11 17:17:11,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:11,401 INFO L124 PetriNetUnfolderBase]: 34/346 cut-off events. [2024-10-11 17:17:11,401 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-10-11 17:17:11,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 346 events. 34/346 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 957 event pairs, 24 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 461. Up to 63 conditions per place. [2024-10-11 17:17:11,402 INFO L140 encePairwiseOnDemand]: 254/256 looper letters, 0 selfloop transitions, 0 changer transitions 191/191 dead transitions. [2024-10-11 17:17:11,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 191 transitions, 456 flow [2024-10-11 17:17:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2024-10-11 17:17:11,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8424479166666666 [2024-10-11 17:17:11,404 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 428 flow. Second operand 3 states and 647 transitions. [2024-10-11 17:17:11,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 191 transitions, 456 flow [2024-10-11 17:17:11,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:11,406 INFO L231 Difference]: Finished difference. Result has 202 places, 0 transitions, 0 flow [2024-10-11 17:17:11,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=202, PETRI_TRANSITIONS=0} [2024-10-11 17:17:11,407 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2024-10-11 17:17:11,407 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 0 transitions, 0 flow [2024-10-11 17:17:11,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:11,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (76 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (75 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (74 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (73 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (72 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (71 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (70 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (69 of 77 remaining) [2024-10-11 17:17:11,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (68 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (66 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 77 remaining) [2024-10-11 17:17:11,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (57 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (56 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (55 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (54 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 77 remaining) [2024-10-11 17:17:11,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (46 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (45 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 77 remaining) [2024-10-11 17:17:11,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 77 remaining) [2024-10-11 17:17:11,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 77 remaining) [2024-10-11 17:17:11,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 77 remaining) [2024-10-11 17:17:11,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 77 remaining) [2024-10-11 17:17:11,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 77 remaining) [2024-10-11 17:17:11,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 77 remaining) [2024-10-11 17:17:11,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 77 remaining) [2024-10-11 17:17:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:17:11,417 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:11,423 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:17:11,423 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:17:11,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:17:11 BasicIcfg [2024-10-11 17:17:11,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:17:11,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:17:11,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:17:11,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:17:11,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:06" (3/4) ... [2024-10-11 17:17:11,429 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:17:11,431 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:17:11,432 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:17:11,432 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:17:11,435 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 17:17:11,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:17:11,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:17:11,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:17:11,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:17:11,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:17:11,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:17:11,519 INFO L158 Benchmark]: Toolchain (without parser) took 6614.54ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 108.4MB in the beginning and 166.1MB in the end (delta: -57.7MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,519 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:17:11,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.54ms. Allocated memory is still 178.3MB. Free memory was 107.9MB in the beginning and 93.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.36ms. Allocated memory is still 178.3MB. Free memory was 93.7MB in the beginning and 90.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,519 INFO L158 Benchmark]: Boogie Preprocessor took 38.07ms. Allocated memory is still 178.3MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,520 INFO L158 Benchmark]: RCFGBuilder took 898.47ms. Allocated memory is still 178.3MB. Free memory was 88.6MB in the beginning and 102.2MB in the end (delta: -13.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,520 INFO L158 Benchmark]: TraceAbstraction took 5237.62ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 101.2MB in the beginning and 171.3MB in the end (delta: -70.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,520 INFO L158 Benchmark]: Witness Printer took 90.39ms. Allocated memory is still 339.7MB. Free memory was 171.3MB in the beginning and 166.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:17:11,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.54ms. Allocated memory is still 178.3MB. Free memory was 107.9MB in the beginning and 93.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.36ms. Allocated memory is still 178.3MB. Free memory was 93.7MB in the beginning and 90.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.07ms. Allocated memory is still 178.3MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 898.47ms. Allocated memory is still 178.3MB. Free memory was 88.6MB in the beginning and 102.2MB in the end (delta: -13.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5237.62ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 101.2MB in the beginning and 171.3MB in the end (delta: -70.1MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Witness Printer took 90.39ms. Allocated memory is still 339.7MB. Free memory was 171.3MB in the beginning and 166.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 345 locations, 77 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 57 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1507 NumberOfCodeBlocks, 1507 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 2105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:17:11,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE