./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:27:55,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:27:55,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:27:55,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:27:55,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:27:55,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:27:55,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:27:55,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:27:55,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:27:55,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:27:55,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:27:55,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:27:55,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:27:55,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:27:55,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:27:55,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:27:55,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:27:55,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:27:55,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:27:55,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:27:55,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:27:55,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:27:55,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:27:55,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:27:55,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:27:55,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:27:55,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:27:55,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:27:55,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:27:55,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:27:55,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:27:55,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:27:55,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:27:55,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:27:55,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:27:55,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:27:55,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:27:55,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:27:55,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:27:55,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:27:55,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:27:55,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:27:55,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:27:55,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:27:55,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:27:55,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:27:55,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:27:55,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:27:55,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:27:55,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:27:55,356 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:27:55,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:27:55,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:27:55,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:27:55,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:27:55,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:27:55,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:27:55,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:27:55,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:27:55,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:27:55,360 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:27:55,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:27:55,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:27:55,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:27:55,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:27:55,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:27:55,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:27:55,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:27:55,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:55,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:27:55,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:27:55,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:27:55,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:27:55,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:27:55,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:27:55,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:27:55,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:27:55,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b [2022-11-02 20:27:55,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:27:55,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:27:55,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:27:55,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:27:55,714 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:27:55,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2022-11-02 20:27:55,786 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/data/b423bb5ab/c571a491c05a4e0badb98043d26a4268/FLAG06ed3c99b [2022-11-02 20:27:56,309 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:27:56,310 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2022-11-02 20:27:56,325 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/data/b423bb5ab/c571a491c05a4e0badb98043d26a4268/FLAG06ed3c99b [2022-11-02 20:27:56,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/data/b423bb5ab/c571a491c05a4e0badb98043d26a4268 [2022-11-02 20:27:56,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:27:56,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:27:56,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:56,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:27:56,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:27:56,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f788556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:56, skipping insertion in model container [2022-11-02 20:27:56,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:56" (1/1) ... [2022-11-02 20:27:56,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:27:56,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:27:57,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-11-02 20:27:57,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:57,059 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:27:57,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-11-02 20:27:57,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:57,131 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:27:57,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57 WrapperNode [2022-11-02 20:27:57,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:57,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:57,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:27:57,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:27:57,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,217 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 495 [2022-11-02 20:27:57,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:57,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:27:57,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:27:57,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:27:57,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:27:57,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:27:57,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:27:57,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:27:57,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (1/1) ... [2022-11-02 20:27:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:57,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:27:57,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:27:57,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:27:57,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:27:57,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:27:57,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:27:57,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:27:57,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:27:57,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:27:57,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:27:57,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:27:57,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:27:57,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:27:57,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:27:57,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:27:57,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:27:57,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:27:57,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:27:57,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:27:57,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:27:57,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:27:57,409 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:27:57,556 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:27:57,558 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:27:58,324 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:27:58,873 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:27:58,874 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:27:58,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:58 BoogieIcfgContainer [2022-11-02 20:27:58,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:27:58,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:27:58,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:27:58,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:27:58,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:27:56" (1/3) ... [2022-11-02 20:27:58,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:58, skipping insertion in model container [2022-11-02 20:27:58,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:57" (2/3) ... [2022-11-02 20:27:58,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:58, skipping insertion in model container [2022-11-02 20:27:58,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:58" (3/3) ... [2022-11-02 20:27:58,892 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2022-11-02 20:27:58,903 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:27:58,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:27:58,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-02 20:27:58,914 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:27:59,088 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:27:59,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 400 transitions, 832 flow [2022-11-02 20:27:59,369 INFO L130 PetriNetUnfolder]: 18/396 cut-off events. [2022-11-02 20:27:59,369 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:27:59,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 396 events. 18/396 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 461 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 333. Up to 3 conditions per place. [2022-11-02 20:27:59,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 395 places, 400 transitions, 832 flow [2022-11-02 20:27:59,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 374 transitions, 772 flow [2022-11-02 20:27:59,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:59,402 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@60d19f81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:59,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2022-11-02 20:27:59,407 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-11-02 20:27:59,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:27:59,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:59,409 INFO L208 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] [2022-11-02 20:27:59,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:27:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2014585814, now seen corresponding path program 1 times [2022-11-02 20:27:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884433559] [2022-11-02 20:27:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:59,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884433559] [2022-11-02 20:27:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884433559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:59,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228903877] [2022-11-02 20:27:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:59,749 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 400 [2022-11-02 20:27:59,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 374 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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) [2022-11-02 20:27:59,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:59,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 400 [2022-11-02 20:27:59,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:00,767 INFO L130 PetriNetUnfolder]: 1092/2414 cut-off events. [2022-11-02 20:28:00,768 INFO L131 PetriNetUnfolder]: For 316/419 co-relation queries the response was YES. [2022-11-02 20:28:00,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4317 conditions, 2414 events. 1092/2414 cut-off events. For 316/419 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15243 event pairs, 886 based on Foata normal form. 262/2436 useless extension candidates. Maximal degree in co-relation 3937. Up to 1531 conditions per place. [2022-11-02 20:28:00,825 INFO L137 encePairwiseOnDemand]: 338/400 looper letters, 32 selfloop transitions, 2 changer transitions 6/314 dead transitions. [2022-11-02 20:28:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 314 transitions, 720 flow [2022-11-02 20:28:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2022-11-02 20:28:00,849 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8383333333333334 [2022-11-02 20:28:00,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1006 transitions. [2022-11-02 20:28:00,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1006 transitions. [2022-11-02 20:28:00,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:00,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1006 transitions. [2022-11-02 20:28:00,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 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) [2022-11-02 20:28:00,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:00,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:00,876 INFO L175 Difference]: Start difference. First operand has 370 places, 374 transitions, 772 flow. Second operand 3 states and 1006 transitions. [2022-11-02 20:28:00,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 314 transitions, 720 flow [2022-11-02 20:28:00,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 314 transitions, 704 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:28:00,895 INFO L231 Difference]: Finished difference. Result has 315 places, 308 transitions, 628 flow [2022-11-02 20:28:00,899 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=315, PETRI_TRANSITIONS=308} [2022-11-02 20:28:00,905 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -55 predicate places. [2022-11-02 20:28:00,906 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 308 transitions, 628 flow [2022-11-02 20:28:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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) [2022-11-02 20:28:00,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:00,907 INFO L208 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] [2022-11-02 20:28:00,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:28:00,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1231959817, now seen corresponding path program 1 times [2022-11-02 20:28:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635802742] [2022-11-02 20:28:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635802742] [2022-11-02 20:28:01,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635802742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:01,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:01,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791580672] [2022-11-02 20:28:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:01,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:01,045 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 400 [2022-11-02 20:28:01,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 308 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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) [2022-11-02 20:28:01,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:01,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 400 [2022-11-02 20:28:01,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:01,724 INFO L130 PetriNetUnfolder]: 921/2093 cut-off events. [2022-11-02 20:28:01,724 INFO L131 PetriNetUnfolder]: For 52/136 co-relation queries the response was YES. [2022-11-02 20:28:01,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 2093 events. 921/2093 cut-off events. For 52/136 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12734 event pairs, 743 based on Foata normal form. 0/1942 useless extension candidates. Maximal degree in co-relation 3477. Up to 1288 conditions per place. [2022-11-02 20:28:01,744 INFO L137 encePairwiseOnDemand]: 396/400 looper letters, 27 selfloop transitions, 1 changer transitions 0/305 dead transitions. [2022-11-02 20:28:01,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 678 flow [2022-11-02 20:28:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2022-11-02 20:28:01,748 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2022-11-02 20:28:01,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 952 transitions. [2022-11-02 20:28:01,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 952 transitions. [2022-11-02 20:28:01,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:01,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 952 transitions. [2022-11-02 20:28:01,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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) [2022-11-02 20:28:01,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:01,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:01,782 INFO L175 Difference]: Start difference. First operand has 315 places, 308 transitions, 628 flow. Second operand 3 states and 952 transitions. [2022-11-02 20:28:01,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 678 flow [2022-11-02 20:28:01,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:01,794 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2022-11-02 20:28:01,794 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2022-11-02 20:28:01,795 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -64 predicate places. [2022-11-02 20:28:01,796 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2022-11-02 20:28:01,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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) [2022-11-02 20:28:01,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:01,797 INFO L208 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] [2022-11-02 20:28:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:28:01,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1126587739, now seen corresponding path program 1 times [2022-11-02 20:28:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:01,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982933714] [2022-11-02 20:28:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:01,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982933714] [2022-11-02 20:28:01,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982933714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:01,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:01,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725405577] [2022-11-02 20:28:01,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:01,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:01,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:01,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:01,922 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 400 [2022-11-02 20:28:01,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:01,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:01,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 400 [2022-11-02 20:28:01,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:02,500 INFO L130 PetriNetUnfolder]: 677/1566 cut-off events. [2022-11-02 20:28:02,500 INFO L131 PetriNetUnfolder]: For 91/153 co-relation queries the response was YES. [2022-11-02 20:28:02,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1566 events. 677/1566 cut-off events. For 91/153 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8414 event pairs, 457 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 2531. Up to 922 conditions per place. [2022-11-02 20:28:02,514 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 26 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-11-02 20:28:02,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 674 flow [2022-11-02 20:28:02,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-02 20:28:02,519 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7991666666666667 [2022-11-02 20:28:02,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-02 20:28:02,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-02 20:28:02,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:02,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-02 20:28:02,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 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) [2022-11-02 20:28:02,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:02,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:02,527 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 959 transitions. [2022-11-02 20:28:02,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 674 flow [2022-11-02 20:28:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 304 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:02,533 INFO L231 Difference]: Finished difference. Result has 306 places, 304 transitions, 621 flow [2022-11-02 20:28:02,533 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=306, PETRI_TRANSITIONS=304} [2022-11-02 20:28:02,536 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -64 predicate places. [2022-11-02 20:28:02,536 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 304 transitions, 621 flow [2022-11-02 20:28:02,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:02,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:02,537 INFO L208 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] [2022-11-02 20:28:02,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:28:02,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1022833663, now seen corresponding path program 1 times [2022-11-02 20:28:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:02,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229425228] [2022-11-02 20:28:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229425228] [2022-11-02 20:28:02,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229425228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:02,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:02,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299430391] [2022-11-02 20:28:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:02,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:02,622 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 400 [2022-11-02 20:28:02,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 304 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:02,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:02,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 400 [2022-11-02 20:28:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:03,062 INFO L130 PetriNetUnfolder]: 677/1565 cut-off events. [2022-11-02 20:28:03,062 INFO L131 PetriNetUnfolder]: For 91/153 co-relation queries the response was YES. [2022-11-02 20:28:03,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 1565 events. 677/1565 cut-off events. For 91/153 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8407 event pairs, 457 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 2532. Up to 922 conditions per place. [2022-11-02 20:28:03,077 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 26 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-02 20:28:03,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 303 transitions, 675 flow [2022-11-02 20:28:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-02 20:28:03,080 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7991666666666667 [2022-11-02 20:28:03,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:03,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 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) [2022-11-02 20:28:03,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:03,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:03,088 INFO L175 Difference]: Start difference. First operand has 306 places, 304 transitions, 621 flow. Second operand 3 states and 959 transitions. [2022-11-02 20:28:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 303 transitions, 675 flow [2022-11-02 20:28:03,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 303 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:03,094 INFO L231 Difference]: Finished difference. Result has 305 places, 303 transitions, 619 flow [2022-11-02 20:28:03,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=305, PETRI_TRANSITIONS=303} [2022-11-02 20:28:03,096 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -65 predicate places. [2022-11-02 20:28:03,096 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 303 transitions, 619 flow [2022-11-02 20:28:03,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:03,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:03,097 INFO L208 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] [2022-11-02 20:28:03,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:28:03,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1338387911, now seen corresponding path program 1 times [2022-11-02 20:28:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:03,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847046840] [2022-11-02 20:28:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:03,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847046840] [2022-11-02 20:28:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847046840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:03,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301058658] [2022-11-02 20:28:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:03,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:03,147 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 400 [2022-11-02 20:28:03,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 303 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:03,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:03,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 400 [2022-11-02 20:28:03,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:03,588 INFO L130 PetriNetUnfolder]: 677/1564 cut-off events. [2022-11-02 20:28:03,588 INFO L131 PetriNetUnfolder]: For 91/153 co-relation queries the response was YES. [2022-11-02 20:28:03,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1564 events. 677/1564 cut-off events. For 91/153 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8423 event pairs, 457 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 2531. Up to 922 conditions per place. [2022-11-02 20:28:03,604 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 26 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-02 20:28:03,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 673 flow [2022-11-02 20:28:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-02 20:28:03,607 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7991666666666667 [2022-11-02 20:28:03,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:03,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-02 20:28:03,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 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) [2022-11-02 20:28:03,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:03,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:03,615 INFO L175 Difference]: Start difference. First operand has 305 places, 303 transitions, 619 flow. Second operand 3 states and 959 transitions. [2022-11-02 20:28:03,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 673 flow [2022-11-02 20:28:03,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:03,621 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 617 flow [2022-11-02 20:28:03,622 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=304, PETRI_TRANSITIONS=302} [2022-11-02 20:28:03,625 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -66 predicate places. [2022-11-02 20:28:03,626 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 617 flow [2022-11-02 20:28:03,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:03,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:03,627 INFO L208 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] [2022-11-02 20:28:03,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:28:03,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1650166299, now seen corresponding path program 1 times [2022-11-02 20:28:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:03,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057162354] [2022-11-02 20:28:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:03,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:03,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057162354] [2022-11-02 20:28:03,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057162354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:03,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:03,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340899910] [2022-11-02 20:28:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:03,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:03,700 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 400 [2022-11-02 20:28:03,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 302 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:03,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:03,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 400 [2022-11-02 20:28:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:04,192 INFO L130 PetriNetUnfolder]: 677/1563 cut-off events. [2022-11-02 20:28:04,193 INFO L131 PetriNetUnfolder]: For 91/153 co-relation queries the response was YES. [2022-11-02 20:28:04,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1563 events. 677/1563 cut-off events. For 91/153 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8415 event pairs, 457 based on Foata normal form. 0/1430 useless extension candidates. Maximal degree in co-relation 2530. Up to 922 conditions per place. [2022-11-02 20:28:04,210 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 26 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:28:04,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 301 transitions, 671 flow [2022-11-02 20:28:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-02 20:28:04,213 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7991666666666667 [2022-11-02 20:28:04,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-02 20:28:04,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-02 20:28:04,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:04,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-02 20:28:04,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 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) [2022-11-02 20:28:04,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:04,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:04,222 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 617 flow. Second operand 3 states and 959 transitions. [2022-11-02 20:28:04,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 301 transitions, 671 flow [2022-11-02 20:28:04,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 301 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:04,229 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 615 flow [2022-11-02 20:28:04,230 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2022-11-02 20:28:04,231 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:04,231 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 615 flow [2022-11-02 20:28:04,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:04,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:04,232 INFO L208 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] [2022-11-02 20:28:04,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:28:04,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1413647169, now seen corresponding path program 1 times [2022-11-02 20:28:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:04,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413275729] [2022-11-02 20:28:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:04,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413275729] [2022-11-02 20:28:04,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413275729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:04,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:04,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6327844] [2022-11-02 20:28:04,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:04,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:04,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:04,300 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:04,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:04,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:04,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:04,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:04,843 INFO L130 PetriNetUnfolder]: 819/1881 cut-off events. [2022-11-02 20:28:04,843 INFO L131 PetriNetUnfolder]: For 118/183 co-relation queries the response was YES. [2022-11-02 20:28:04,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3101 conditions, 1881 events. 819/1881 cut-off events. For 118/183 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10530 event pairs, 163 based on Foata normal form. 1/1709 useless extension candidates. Maximal degree in co-relation 3061. Up to 782 conditions per place. [2022-11-02 20:28:04,859 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 36 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 20:28:04,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 314 transitions, 723 flow [2022-11-02 20:28:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-11-02 20:28:04,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.815 [2022-11-02 20:28:04,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-11-02 20:28:04,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-11-02 20:28:04,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:04,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-11-02 20:28:04,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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) [2022-11-02 20:28:04,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:04,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:04,869 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 615 flow. Second operand 3 states and 978 transitions. [2022-11-02 20:28:04,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 314 transitions, 723 flow [2022-11-02 20:28:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 314 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:04,875 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 619 flow [2022-11-02 20:28:04,876 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2022-11-02 20:28:04,876 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:04,877 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 619 flow [2022-11-02 20:28:04,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:04,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:04,877 INFO L208 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] [2022-11-02 20:28:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:28:04,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -189062542, now seen corresponding path program 1 times [2022-11-02 20:28:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747799827] [2022-11-02 20:28:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:04,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747799827] [2022-11-02 20:28:04,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747799827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:04,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:04,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706991982] [2022-11-02 20:28:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:04,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:04,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:04,922 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:04,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:04,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:04,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:04,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:05,369 INFO L130 PetriNetUnfolder]: 820/1907 cut-off events. [2022-11-02 20:28:05,369 INFO L131 PetriNetUnfolder]: For 213/285 co-relation queries the response was YES. [2022-11-02 20:28:05,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 1907 events. 820/1907 cut-off events. For 213/285 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11187 event pairs, 566 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 3227. Up to 1120 conditions per place. [2022-11-02 20:28:05,389 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2022-11-02 20:28:05,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 300 transitions, 669 flow [2022-11-02 20:28:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2022-11-02 20:28:05,393 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8041666666666667 [2022-11-02 20:28:05,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2022-11-02 20:28:05,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2022-11-02 20:28:05,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:05,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2022-11-02 20:28:05,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 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) [2022-11-02 20:28:05,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:05,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:05,401 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 619 flow. Second operand 3 states and 965 transitions. [2022-11-02 20:28:05,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 300 transitions, 669 flow [2022-11-02 20:28:05,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 300 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:05,408 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 619 flow [2022-11-02 20:28:05,409 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2022-11-02 20:28:05,410 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:05,410 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 619 flow [2022-11-02 20:28:05,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:05,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:05,411 INFO L208 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] [2022-11-02 20:28:05,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:28:05,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1658863805, now seen corresponding path program 1 times [2022-11-02 20:28:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807264681] [2022-11-02 20:28:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807264681] [2022-11-02 20:28:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807264681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:05,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947649799] [2022-11-02 20:28:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:05,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:05,500 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:05,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:05,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:05,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:06,157 INFO L130 PetriNetUnfolder]: 1013/2357 cut-off events. [2022-11-02 20:28:06,157 INFO L131 PetriNetUnfolder]: For 268/349 co-relation queries the response was YES. [2022-11-02 20:28:06,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 2357 events. 1013/2357 cut-off events. For 268/349 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14639 event pairs, 264 based on Foata normal form. 2/2136 useless extension candidates. Maximal degree in co-relation 3942. Up to 867 conditions per place. [2022-11-02 20:28:06,178 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 38 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 20:28:06,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 314 transitions, 736 flow [2022-11-02 20:28:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-11-02 20:28:06,181 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.815 [2022-11-02 20:28:06,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-11-02 20:28:06,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-11-02 20:28:06,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:06,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-11-02 20:28:06,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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) [2022-11-02 20:28:06,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:06,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:06,188 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 619 flow. Second operand 3 states and 978 transitions. [2022-11-02 20:28:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 314 transitions, 736 flow [2022-11-02 20:28:06,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 314 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:06,194 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 623 flow [2022-11-02 20:28:06,195 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2022-11-02 20:28:06,195 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:06,196 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 623 flow [2022-11-02 20:28:06,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:06,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:06,197 INFO L208 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] [2022-11-02 20:28:06,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:28:06,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2133308045, now seen corresponding path program 1 times [2022-11-02 20:28:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:06,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44687308] [2022-11-02 20:28:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:06,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44687308] [2022-11-02 20:28:06,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44687308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:06,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:06,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316983195] [2022-11-02 20:28:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:06,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:06,237 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:06,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:06,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:06,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:06,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:06,806 INFO L130 PetriNetUnfolder]: 1014/2429 cut-off events. [2022-11-02 20:28:06,806 INFO L131 PetriNetUnfolder]: For 409/492 co-relation queries the response was YES. [2022-11-02 20:28:06,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 2429 events. 1014/2429 cut-off events. For 409/492 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16089 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4223. Up to 1390 conditions per place. [2022-11-02 20:28:06,832 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 25 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2022-11-02 20:28:06,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 675 flow [2022-11-02 20:28:06,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2022-11-02 20:28:06,835 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8041666666666667 [2022-11-02 20:28:06,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2022-11-02 20:28:06,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2022-11-02 20:28:06,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:06,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2022-11-02 20:28:06,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 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) [2022-11-02 20:28:06,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:06,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:06,841 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 623 flow. Second operand 3 states and 965 transitions. [2022-11-02 20:28:06,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 675 flow [2022-11-02 20:28:06,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 299 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:06,849 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 623 flow [2022-11-02 20:28:06,850 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-11-02 20:28:06,851 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:06,851 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 623 flow [2022-11-02 20:28:06,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:06,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:06,852 INFO L208 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] [2022-11-02 20:28:06,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:28:06,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -530077399, now seen corresponding path program 1 times [2022-11-02 20:28:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:06,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390625197] [2022-11-02 20:28:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390625197] [2022-11-02 20:28:06,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390625197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:06,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:06,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230603478] [2022-11-02 20:28:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:06,910 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 400 [2022-11-02 20:28:06,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:06,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:06,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 400 [2022-11-02 20:28:06,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:07,463 INFO L130 PetriNetUnfolder]: 1014/2428 cut-off events. [2022-11-02 20:28:07,463 INFO L131 PetriNetUnfolder]: For 408/491 co-relation queries the response was YES. [2022-11-02 20:28:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 2428 events. 1014/2428 cut-off events. For 408/491 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16039 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4162. Up to 1398 conditions per place. [2022-11-02 20:28:07,486 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 27 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2022-11-02 20:28:07,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 679 flow [2022-11-02 20:28:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2022-11-02 20:28:07,489 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7983333333333333 [2022-11-02 20:28:07,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 958 transitions. [2022-11-02 20:28:07,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 958 transitions. [2022-11-02 20:28:07,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:07,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 958 transitions. [2022-11-02 20:28:07,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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) [2022-11-02 20:28:07,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:07,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:07,495 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 623 flow. Second operand 3 states and 958 transitions. [2022-11-02 20:28:07,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 679 flow [2022-11-02 20:28:07,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:07,500 INFO L231 Difference]: Finished difference. Result has 302 places, 298 transitions, 621 flow [2022-11-02 20:28:07,501 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=302, PETRI_TRANSITIONS=298} [2022-11-02 20:28:07,502 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -68 predicate places. [2022-11-02 20:28:07,502 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 298 transitions, 621 flow [2022-11-02 20:28:07,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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) [2022-11-02 20:28:07,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:07,503 INFO L208 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] [2022-11-02 20:28:07,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:28:07,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1060390472, now seen corresponding path program 1 times [2022-11-02 20:28:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:07,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428076170] [2022-11-02 20:28:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428076170] [2022-11-02 20:28:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428076170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:07,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879626826] [2022-11-02 20:28:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:07,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:07,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:07,541 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:07,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 298 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:07,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:07,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:07,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:08,096 INFO L130 PetriNetUnfolder]: 1014/2427 cut-off events. [2022-11-02 20:28:08,096 INFO L131 PetriNetUnfolder]: For 408/491 co-relation queries the response was YES. [2022-11-02 20:28:08,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4195 conditions, 2427 events. 1014/2427 cut-off events. For 408/491 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15993 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4153. Up to 1388 conditions per place. [2022-11-02 20:28:08,121 INFO L137 encePairwiseOnDemand]: 398/400 looper letters, 25 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2022-11-02 20:28:08,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 671 flow [2022-11-02 20:28:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:28:08,125 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8033333333333333 [2022-11-02 20:28:08,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:28:08,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:28:08,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:08,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:28:08,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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) [2022-11-02 20:28:08,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:08,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:08,133 INFO L175 Difference]: Start difference. First operand has 302 places, 298 transitions, 621 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:28:08,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 671 flow [2022-11-02 20:28:08,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 297 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:08,140 INFO L231 Difference]: Finished difference. Result has 301 places, 297 transitions, 617 flow [2022-11-02 20:28:08,140 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=301, PETRI_TRANSITIONS=297} [2022-11-02 20:28:08,141 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -69 predicate places. [2022-11-02 20:28:08,141 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 297 transitions, 617 flow [2022-11-02 20:28:08,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:08,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:08,142 INFO L208 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] [2022-11-02 20:28:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:28:08,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash -178945074, now seen corresponding path program 1 times [2022-11-02 20:28:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:08,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108492149] [2022-11-02 20:28:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108492149] [2022-11-02 20:28:08,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108492149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:08,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:08,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395797172] [2022-11-02 20:28:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:08,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:08,206 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:08,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 297 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:08,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:08,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:08,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:08,921 INFO L130 PetriNetUnfolder]: 1014/2426 cut-off events. [2022-11-02 20:28:08,921 INFO L131 PetriNetUnfolder]: For 408/491 co-relation queries the response was YES. [2022-11-02 20:28:08,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 2426 events. 1014/2426 cut-off events. For 408/491 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15966 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4151. Up to 1390 conditions per place. [2022-11-02 20:28:08,948 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 25 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-02 20:28:08,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 296 transitions, 669 flow [2022-11-02 20:28:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2022-11-02 20:28:08,952 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8041666666666667 [2022-11-02 20:28:08,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2022-11-02 20:28:08,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2022-11-02 20:28:08,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:08,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2022-11-02 20:28:08,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 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) [2022-11-02 20:28:08,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:08,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:08,959 INFO L175 Difference]: Start difference. First operand has 301 places, 297 transitions, 617 flow. Second operand 3 states and 965 transitions. [2022-11-02 20:28:08,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 296 transitions, 669 flow [2022-11-02 20:28:08,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 296 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:08,967 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 618 flow [2022-11-02 20:28:08,967 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2022-11-02 20:28:08,968 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -69 predicate places. [2022-11-02 20:28:08,968 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 618 flow [2022-11-02 20:28:08,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:08,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:08,969 INFO L208 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] [2022-11-02 20:28:08,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:28:08,970 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash -119368119, now seen corresponding path program 1 times [2022-11-02 20:28:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:08,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161902886] [2022-11-02 20:28:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:08,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:09,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161902886] [2022-11-02 20:28:09,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161902886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:09,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:09,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052676362] [2022-11-02 20:28:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:09,705 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 400 [2022-11-02 20:28:09,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:09,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:09,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 400 [2022-11-02 20:28:09,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:12,191 INFO L130 PetriNetUnfolder]: 5899/9227 cut-off events. [2022-11-02 20:28:12,191 INFO L131 PetriNetUnfolder]: For 1360/1360 co-relation queries the response was YES. [2022-11-02 20:28:12,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18620 conditions, 9227 events. 5899/9227 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 54711 event pairs, 4691 based on Foata normal form. 0/8769 useless extension candidates. Maximal degree in co-relation 18578. Up to 7901 conditions per place. [2022-11-02 20:28:12,266 INFO L137 encePairwiseOnDemand]: 388/400 looper letters, 68 selfloop transitions, 10 changer transitions 0/294 dead transitions. [2022-11-02 20:28:12,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 294 transitions, 770 flow [2022-11-02 20:28:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:28:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1644 transitions. [2022-11-02 20:28:12,270 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.685 [2022-11-02 20:28:12,270 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1644 transitions. [2022-11-02 20:28:12,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1644 transitions. [2022-11-02 20:28:12,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:12,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1644 transitions. [2022-11-02 20:28:12,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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) [2022-11-02 20:28:12,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:12,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:12,280 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 618 flow. Second operand 6 states and 1644 transitions. [2022-11-02 20:28:12,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 294 transitions, 770 flow [2022-11-02 20:28:12,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 294 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:12,286 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 630 flow [2022-11-02 20:28:12,287 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2022-11-02 20:28:12,287 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -68 predicate places. [2022-11-02 20:28:12,287 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 630 flow [2022-11-02 20:28:12,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:12,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:12,288 INFO L208 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] [2022-11-02 20:28:12,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:28:12,289 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2037069522, now seen corresponding path program 1 times [2022-11-02 20:28:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:12,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473327576] [2022-11-02 20:28:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:12,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473327576] [2022-11-02 20:28:12,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473327576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:12,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:12,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033734417] [2022-11-02 20:28:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:12,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:12,341 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:12,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:12,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:12,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:12,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:13,031 INFO L130 PetriNetUnfolder]: 1014/2423 cut-off events. [2022-11-02 20:28:13,032 INFO L131 PetriNetUnfolder]: For 408/491 co-relation queries the response was YES. [2022-11-02 20:28:13,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 2423 events. 1014/2423 cut-off events. For 408/491 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16018 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4165. Up to 1388 conditions per place. [2022-11-02 20:28:13,058 INFO L137 encePairwiseOnDemand]: 398/400 looper letters, 25 selfloop transitions, 1 changer transitions 0/293 dead transitions. [2022-11-02 20:28:13,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 293 transitions, 680 flow [2022-11-02 20:28:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:28:13,063 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8033333333333333 [2022-11-02 20:28:13,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:28:13,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:28:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:13,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:28:13,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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) [2022-11-02 20:28:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:13,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:13,070 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 630 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:28:13,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 293 transitions, 680 flow [2022-11-02 20:28:13,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 660 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:28:13,078 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 610 flow [2022-11-02 20:28:13,079 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2022-11-02 20:28:13,080 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -72 predicate places. [2022-11-02 20:28:13,080 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 610 flow [2022-11-02 20:28:13,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:13,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:13,081 INFO L208 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] [2022-11-02 20:28:13,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:28:13,081 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash 430970520, now seen corresponding path program 1 times [2022-11-02 20:28:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:13,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73256126] [2022-11-02 20:28:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73256126] [2022-11-02 20:28:13,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73256126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:13,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:13,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999105603] [2022-11-02 20:28:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:13,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:13,174 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:13,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:13,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:13,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:13,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:13,720 INFO L130 PetriNetUnfolder]: 1014/2422 cut-off events. [2022-11-02 20:28:13,720 INFO L131 PetriNetUnfolder]: For 408/491 co-relation queries the response was YES. [2022-11-02 20:28:13,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 2422 events. 1014/2422 cut-off events. For 408/491 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15972 event pairs, 719 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 4148. Up to 1390 conditions per place. [2022-11-02 20:28:13,739 INFO L137 encePairwiseOnDemand]: 397/400 looper letters, 25 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2022-11-02 20:28:13,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 662 flow [2022-11-02 20:28:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2022-11-02 20:28:13,742 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8041666666666667 [2022-11-02 20:28:13,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2022-11-02 20:28:13,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2022-11-02 20:28:13,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:13,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2022-11-02 20:28:13,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 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) [2022-11-02 20:28:13,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:13,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:13,748 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 610 flow. Second operand 3 states and 965 transitions. [2022-11-02 20:28:13,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 662 flow [2022-11-02 20:28:13,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 292 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:13,753 INFO L231 Difference]: Finished difference. Result has 298 places, 292 transitions, 611 flow [2022-11-02 20:28:13,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=298, PETRI_TRANSITIONS=292} [2022-11-02 20:28:13,754 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -72 predicate places. [2022-11-02 20:28:13,755 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 292 transitions, 611 flow [2022-11-02 20:28:13,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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) [2022-11-02 20:28:13,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:13,755 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:13,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:28:13,756 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1158050724, now seen corresponding path program 1 times [2022-11-02 20:28:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:13,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610075915] [2022-11-02 20:28:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610075915] [2022-11-02 20:28:14,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610075915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:14,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:14,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842928345] [2022-11-02 20:28:14,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:14,360 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 400 [2022-11-02 20:28:14,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 292 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 279.1666666666667) internal successors, (1675), 6 states have internal predecessors, (1675), 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) [2022-11-02 20:28:14,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:14,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 400 [2022-11-02 20:28:14,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:16,498 INFO L130 PetriNetUnfolder]: 5899/9224 cut-off events. [2022-11-02 20:28:16,498 INFO L131 PetriNetUnfolder]: For 1360/1360 co-relation queries the response was YES. [2022-11-02 20:28:16,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18599 conditions, 9224 events. 5899/9224 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 54521 event pairs, 1065 based on Foata normal form. 0/8953 useless extension candidates. Maximal degree in co-relation 18555. Up to 3588 conditions per place. [2022-11-02 20:28:16,558 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 111 selfloop transitions, 4 changer transitions 0/347 dead transitions. [2022-11-02 20:28:16,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 347 transitions, 983 flow [2022-11-02 20:28:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:28:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1768 transitions. [2022-11-02 20:28:16,563 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7366666666666667 [2022-11-02 20:28:16,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1768 transitions. [2022-11-02 20:28:16,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1768 transitions. [2022-11-02 20:28:16,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:16,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1768 transitions. [2022-11-02 20:28:16,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 294.6666666666667) internal successors, (1768), 6 states have internal predecessors, (1768), 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) [2022-11-02 20:28:16,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:16,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:16,574 INFO L175 Difference]: Start difference. First operand has 298 places, 292 transitions, 611 flow. Second operand 6 states and 1768 transitions. [2022-11-02 20:28:16,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 347 transitions, 983 flow [2022-11-02 20:28:16,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 347 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:28:16,580 INFO L231 Difference]: Finished difference. Result has 300 places, 291 transitions, 613 flow [2022-11-02 20:28:16,580 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=300, PETRI_TRANSITIONS=291} [2022-11-02 20:28:16,581 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -70 predicate places. [2022-11-02 20:28:16,581 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 291 transitions, 613 flow [2022-11-02 20:28:16,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.1666666666667) internal successors, (1675), 6 states have internal predecessors, (1675), 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) [2022-11-02 20:28:16,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:16,582 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:16,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:28:16,582 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1680868287, now seen corresponding path program 1 times [2022-11-02 20:28:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:16,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689715844] [2022-11-02 20:28:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689715844] [2022-11-02 20:28:17,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689715844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:17,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:17,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945644745] [2022-11-02 20:28:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:17,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:17,213 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 400 [2022-11-02 20:28:17,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 291 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 280.1666666666667) internal successors, (1681), 6 states have internal predecessors, (1681), 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) [2022-11-02 20:28:17,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:17,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 400 [2022-11-02 20:28:17,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:19,739 INFO L130 PetriNetUnfolder]: 4807/7877 cut-off events. [2022-11-02 20:28:19,740 INFO L131 PetriNetUnfolder]: For 1585/1585 co-relation queries the response was YES. [2022-11-02 20:28:19,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16576 conditions, 7877 events. 4807/7877 cut-off events. For 1585/1585 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 48805 event pairs, 3339 based on Foata normal form. 0/7674 useless extension candidates. Maximal degree in co-relation 16532. Up to 5142 conditions per place. [2022-11-02 20:28:19,796 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 102 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2022-11-02 20:28:19,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 338 transitions, 951 flow [2022-11-02 20:28:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:28:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1759 transitions. [2022-11-02 20:28:19,802 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7329166666666667 [2022-11-02 20:28:19,802 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1759 transitions. [2022-11-02 20:28:19,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1759 transitions. [2022-11-02 20:28:19,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:19,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1759 transitions. [2022-11-02 20:28:19,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 293.1666666666667) internal successors, (1759), 6 states have internal predecessors, (1759), 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) [2022-11-02 20:28:19,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:19,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:19,813 INFO L175 Difference]: Start difference. First operand has 300 places, 291 transitions, 613 flow. Second operand 6 states and 1759 transitions. [2022-11-02 20:28:19,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 338 transitions, 951 flow [2022-11-02 20:28:19,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 338 transitions, 944 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:28:19,821 INFO L231 Difference]: Finished difference. Result has 300 places, 290 transitions, 612 flow [2022-11-02 20:28:19,822 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=290} [2022-11-02 20:28:19,823 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -70 predicate places. [2022-11-02 20:28:19,823 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 290 transitions, 612 flow [2022-11-02 20:28:19,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.1666666666667) internal successors, (1681), 6 states have internal predecessors, (1681), 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) [2022-11-02 20:28:19,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:19,824 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:19,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:28:19,824 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1172788081, now seen corresponding path program 1 times [2022-11-02 20:28:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:19,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111476088] [2022-11-02 20:28:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111476088] [2022-11-02 20:28:20,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111476088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:20,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:20,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463676506] [2022-11-02 20:28:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:20,102 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 400 [2022-11-02 20:28:20,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 290 transitions, 612 flow. Second operand has 4 states, 4 states have (on average 316.5) internal successors, (1266), 4 states have internal predecessors, (1266), 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) [2022-11-02 20:28:20,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:20,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 400 [2022-11-02 20:28:20,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:21,234 INFO L130 PetriNetUnfolder]: 1715/3667 cut-off events. [2022-11-02 20:28:21,234 INFO L131 PetriNetUnfolder]: For 607/665 co-relation queries the response was YES. [2022-11-02 20:28:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 3667 events. 1715/3667 cut-off events. For 607/665 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25418 event pairs, 370 based on Foata normal form. 1/3329 useless extension candidates. Maximal degree in co-relation 6619. Up to 976 conditions per place. [2022-11-02 20:28:21,275 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 61 selfloop transitions, 5 changer transitions 0/330 dead transitions. [2022-11-02 20:28:21,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 330 transitions, 849 flow [2022-11-02 20:28:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:28:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:28:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1631 transitions. [2022-11-02 20:28:21,281 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8155 [2022-11-02 20:28:21,281 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1631 transitions. [2022-11-02 20:28:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1631 transitions. [2022-11-02 20:28:21,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:21,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1631 transitions. [2022-11-02 20:28:21,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 326.2) internal successors, (1631), 5 states have internal predecessors, (1631), 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) [2022-11-02 20:28:21,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 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) [2022-11-02 20:28:21,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 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) [2022-11-02 20:28:21,293 INFO L175 Difference]: Start difference. First operand has 300 places, 290 transitions, 612 flow. Second operand 5 states and 1631 transitions. [2022-11-02 20:28:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 330 transitions, 849 flow [2022-11-02 20:28:21,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 330 transitions, 842 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:28:21,301 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 636 flow [2022-11-02 20:28:21,302 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2022-11-02 20:28:21,302 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -67 predicate places. [2022-11-02 20:28:21,303 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 636 flow [2022-11-02 20:28:21,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 316.5) internal successors, (1266), 4 states have internal predecessors, (1266), 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) [2022-11-02 20:28:21,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:21,304 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:21,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:28:21,304 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -621834276, now seen corresponding path program 1 times [2022-11-02 20:28:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:21,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014531464] [2022-11-02 20:28:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:22,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014531464] [2022-11-02 20:28:22,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014531464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:22,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:22,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96024224] [2022-11-02 20:28:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:22,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:22,164 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 400 [2022-11-02 20:28:22,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 636 flow. Second operand has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 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) [2022-11-02 20:28:22,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:22,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 400 [2022-11-02 20:28:22,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:25,050 INFO L130 PetriNetUnfolder]: 6583/10659 cut-off events. [2022-11-02 20:28:25,050 INFO L131 PetriNetUnfolder]: For 4382/4382 co-relation queries the response was YES. [2022-11-02 20:28:25,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24178 conditions, 10659 events. 6583/10659 cut-off events. For 4382/4382 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 69794 event pairs, 4957 based on Foata normal form. 0/10423 useless extension candidates. Maximal degree in co-relation 24131. Up to 8727 conditions per place. [2022-11-02 20:28:25,137 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 76 selfloop transitions, 4 changer transitions 0/312 dead transitions. [2022-11-02 20:28:25,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 312 transitions, 850 flow [2022-11-02 20:28:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:28:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1734 transitions. [2022-11-02 20:28:25,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7225 [2022-11-02 20:28:25,142 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1734 transitions. [2022-11-02 20:28:25,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1734 transitions. [2022-11-02 20:28:25,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:25,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1734 transitions. [2022-11-02 20:28:25,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 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) [2022-11-02 20:28:25,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:25,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:25,153 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 636 flow. Second operand 6 states and 1734 transitions. [2022-11-02 20:28:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 312 transitions, 850 flow [2022-11-02 20:28:25,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 312 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:25,163 INFO L231 Difference]: Finished difference. Result has 306 places, 292 transitions, 639 flow [2022-11-02 20:28:25,163 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=306, PETRI_TRANSITIONS=292} [2022-11-02 20:28:25,164 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -64 predicate places. [2022-11-02 20:28:25,164 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 292 transitions, 639 flow [2022-11-02 20:28:25,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 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) [2022-11-02 20:28:25,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:25,165 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:25,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:28:25,165 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:25,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1184854232, now seen corresponding path program 1 times [2022-11-02 20:28:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:25,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054011178] [2022-11-02 20:28:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:25,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054011178] [2022-11-02 20:28:25,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054011178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:25,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:25,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409885533] [2022-11-02 20:28:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:25,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:25,518 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 400 [2022-11-02 20:28:25,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 292 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 317.25) internal successors, (1269), 4 states have internal predecessors, (1269), 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) [2022-11-02 20:28:25,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:25,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 400 [2022-11-02 20:28:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:26,875 INFO L130 PetriNetUnfolder]: 2487/5593 cut-off events. [2022-11-02 20:28:26,875 INFO L131 PetriNetUnfolder]: For 1562/1701 co-relation queries the response was YES. [2022-11-02 20:28:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10893 conditions, 5593 events. 2487/5593 cut-off events. For 1562/1701 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 44679 event pairs, 402 based on Foata normal form. 1/5254 useless extension candidates. Maximal degree in co-relation 10847. Up to 1403 conditions per place. [2022-11-02 20:28:26,935 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 64 selfloop transitions, 7 changer transitions 0/334 dead transitions. [2022-11-02 20:28:26,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 334 transitions, 910 flow [2022-11-02 20:28:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:28:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:28:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1632 transitions. [2022-11-02 20:28:26,940 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.816 [2022-11-02 20:28:26,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1632 transitions. [2022-11-02 20:28:26,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1632 transitions. [2022-11-02 20:28:26,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:26,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1632 transitions. [2022-11-02 20:28:26,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 326.4) internal successors, (1632), 5 states have internal predecessors, (1632), 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) [2022-11-02 20:28:26,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 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) [2022-11-02 20:28:26,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 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) [2022-11-02 20:28:26,950 INFO L175 Difference]: Start difference. First operand has 306 places, 292 transitions, 639 flow. Second operand 5 states and 1632 transitions. [2022-11-02 20:28:26,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 334 transitions, 910 flow [2022-11-02 20:28:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 334 transitions, 903 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:28:26,959 INFO L231 Difference]: Finished difference. Result has 309 places, 296 transitions, 678 flow [2022-11-02 20:28:26,959 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=678, PETRI_PLACES=309, PETRI_TRANSITIONS=296} [2022-11-02 20:28:26,960 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -61 predicate places. [2022-11-02 20:28:26,960 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 296 transitions, 678 flow [2022-11-02 20:28:26,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 317.25) internal successors, (1269), 4 states have internal predecessors, (1269), 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) [2022-11-02 20:28:26,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:26,961 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:26,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:28:26,961 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2023491146, now seen corresponding path program 2 times [2022-11-02 20:28:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:26,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596069426] [2022-11-02 20:28:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596069426] [2022-11-02 20:28:27,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596069426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:27,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:27,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852184099] [2022-11-02 20:28:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:27,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:28:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:28:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:28:27,765 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 400 [2022-11-02 20:28:27,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 296 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 282.6666666666667) internal successors, (1696), 6 states have internal predecessors, (1696), 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) [2022-11-02 20:28:27,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:27,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 400 [2022-11-02 20:28:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:31,676 INFO L130 PetriNetUnfolder]: 9674/15771 cut-off events. [2022-11-02 20:28:31,676 INFO L131 PetriNetUnfolder]: For 11034/11034 co-relation queries the response was YES. [2022-11-02 20:28:31,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38382 conditions, 15771 events. 9674/15771 cut-off events. For 11034/11034 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 113646 event pairs, 6885 based on Foata normal form. 0/15558 useless extension candidates. Maximal degree in co-relation 38332. Up to 13089 conditions per place. [2022-11-02 20:28:31,789 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 59 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-02 20:28:31,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 295 transitions, 802 flow [2022-11-02 20:28:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:28:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1717 transitions. [2022-11-02 20:28:31,793 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7154166666666667 [2022-11-02 20:28:31,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1717 transitions. [2022-11-02 20:28:31,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1717 transitions. [2022-11-02 20:28:31,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:31,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1717 transitions. [2022-11-02 20:28:31,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.1666666666667) internal successors, (1717), 6 states have internal predecessors, (1717), 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) [2022-11-02 20:28:31,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:31,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 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) [2022-11-02 20:28:31,803 INFO L175 Difference]: Start difference. First operand has 309 places, 296 transitions, 678 flow. Second operand 6 states and 1717 transitions. [2022-11-02 20:28:31,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 295 transitions, 802 flow [2022-11-02 20:28:31,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 295 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:28:31,826 INFO L231 Difference]: Finished difference. Result has 312 places, 295 transitions, 680 flow [2022-11-02 20:28:31,827 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=680, PETRI_PLACES=312, PETRI_TRANSITIONS=295} [2022-11-02 20:28:31,827 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -58 predicate places. [2022-11-02 20:28:31,827 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 295 transitions, 680 flow [2022-11-02 20:28:31,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.6666666666667) internal successors, (1696), 6 states have internal predecessors, (1696), 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) [2022-11-02 20:28:31,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:28:31,828 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:31,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:28:31,829 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 121 more)] === [2022-11-02 20:28:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash -151511638, now seen corresponding path program 1 times [2022-11-02 20:28:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:31,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476365961] [2022-11-02 20:28:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:28:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476365961] [2022-11-02 20:28:31,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476365961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:31,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:31,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:28:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603777085] [2022-11-02 20:28:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:31,922 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 400 [2022-11-02 20:28:31,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 295 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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) [2022-11-02 20:28:31,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:28:31,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 400 [2022-11-02 20:28:31,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:28:32,894 INFO L130 PetriNetUnfolder]: 1827/4314 cut-off events. [2022-11-02 20:28:32,895 INFO L131 PetriNetUnfolder]: For 2188/2312 co-relation queries the response was YES. [2022-11-02 20:28:32,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8868 conditions, 4314 events. 1827/4314 cut-off events. For 2188/2312 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 33933 event pairs, 537 based on Foata normal form. 5/4120 useless extension candidates. Maximal degree in co-relation 8820. Up to 2171 conditions per place. [2022-11-02 20:28:32,914 INFO L137 encePairwiseOnDemand]: 393/400 looper letters, 0 selfloop transitions, 0 changer transitions 314/314 dead transitions. [2022-11-02 20:28:32,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 314 transitions, 854 flow [2022-11-02 20:28:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:28:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2022-11-02 20:28:32,917 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8158333333333333 [2022-11-02 20:28:32,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2022-11-02 20:28:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2022-11-02 20:28:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:28:32,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2022-11-02 20:28:32,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 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) [2022-11-02 20:28:32,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:32,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 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) [2022-11-02 20:28:32,924 INFO L175 Difference]: Start difference. First operand has 312 places, 295 transitions, 680 flow. Second operand 3 states and 979 transitions. [2022-11-02 20:28:32,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 314 transitions, 854 flow [2022-11-02 20:28:32,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 314 transitions, 847 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:28:32,930 INFO L231 Difference]: Finished difference. Result has 309 places, 0 transitions, 0 flow [2022-11-02 20:28:32,931 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=309, PETRI_TRANSITIONS=0} [2022-11-02 20:28:32,931 INFO L287 CegarLoopForPetriNet]: 370 programPoint places, -61 predicate places. [2022-11-02 20:28:32,931 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 0 transitions, 0 flow [2022-11-02 20:28:32,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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) [2022-11-02 20:28:32,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 125 remaining) [2022-11-02 20:28:32,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (123 of 125 remaining) [2022-11-02 20:28:32,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (122 of 125 remaining) [2022-11-02 20:28:32,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (121 of 125 remaining) [2022-11-02 20:28:32,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (120 of 125 remaining) [2022-11-02 20:28:32,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (119 of 125 remaining) [2022-11-02 20:28:32,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (118 of 125 remaining) [2022-11-02 20:28:32,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 125 remaining) [2022-11-02 20:28:32,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (116 of 125 remaining) [2022-11-02 20:28:32,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (115 of 125 remaining) [2022-11-02 20:28:32,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (114 of 125 remaining) [2022-11-02 20:28:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (113 of 125 remaining) [2022-11-02 20:28:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (112 of 125 remaining) [2022-11-02 20:28:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 125 remaining) [2022-11-02 20:28:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (110 of 125 remaining) [2022-11-02 20:28:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (109 of 125 remaining) [2022-11-02 20:28:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (108 of 125 remaining) [2022-11-02 20:28:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (107 of 125 remaining) [2022-11-02 20:28:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (106 of 125 remaining) [2022-11-02 20:28:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (105 of 125 remaining) [2022-11-02 20:28:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 125 remaining) [2022-11-02 20:28:32,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (103 of 125 remaining) [2022-11-02 20:28:32,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (102 of 125 remaining) [2022-11-02 20:28:32,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (101 of 125 remaining) [2022-11-02 20:28:32,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (100 of 125 remaining) [2022-11-02 20:28:32,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (99 of 125 remaining) [2022-11-02 20:28:32,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 125 remaining) [2022-11-02 20:28:32,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (97 of 125 remaining) [2022-11-02 20:28:32,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (96 of 125 remaining) [2022-11-02 20:28:32,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (95 of 125 remaining) [2022-11-02 20:28:32,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (94 of 125 remaining) [2022-11-02 20:28:32,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (93 of 125 remaining) [2022-11-02 20:28:32,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 125 remaining) [2022-11-02 20:28:32,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 125 remaining) [2022-11-02 20:28:32,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 125 remaining) [2022-11-02 20:28:32,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 125 remaining) [2022-11-02 20:28:32,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 125 remaining) [2022-11-02 20:28:32,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 125 remaining) [2022-11-02 20:28:32,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 125 remaining) [2022-11-02 20:28:32,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 125 remaining) [2022-11-02 20:28:32,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 125 remaining) [2022-11-02 20:28:32,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 125 remaining) [2022-11-02 20:28:32,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 125 remaining) [2022-11-02 20:28:32,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 125 remaining) [2022-11-02 20:28:32,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (79 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (78 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (77 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (75 of 125 remaining) [2022-11-02 20:28:32,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (74 of 125 remaining) [2022-11-02 20:28:32,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (73 of 125 remaining) [2022-11-02 20:28:32,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 125 remaining) [2022-11-02 20:28:32,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (71 of 125 remaining) [2022-11-02 20:28:32,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 125 remaining) [2022-11-02 20:28:32,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 125 remaining) [2022-11-02 20:28:32,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (68 of 125 remaining) [2022-11-02 20:28:32,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (67 of 125 remaining) [2022-11-02 20:28:32,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 125 remaining) [2022-11-02 20:28:32,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (65 of 125 remaining) [2022-11-02 20:28:32,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (62 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (61 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (59 of 125 remaining) [2022-11-02 20:28:32,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (58 of 125 remaining) [2022-11-02 20:28:32,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (57 of 125 remaining) [2022-11-02 20:28:32,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (56 of 125 remaining) [2022-11-02 20:28:32,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 125 remaining) [2022-11-02 20:28:32,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 125 remaining) [2022-11-02 20:28:32,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (51 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (49 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 125 remaining) [2022-11-02 20:28:32,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 125 remaining) [2022-11-02 20:28:32,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 125 remaining) [2022-11-02 20:28:32,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 125 remaining) [2022-11-02 20:28:32,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 125 remaining) [2022-11-02 20:28:32,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 125 remaining) [2022-11-02 20:28:32,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (40 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (39 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 125 remaining) [2022-11-02 20:28:32,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 125 remaining) [2022-11-02 20:28:32,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 125 remaining) [2022-11-02 20:28:32,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 125 remaining) [2022-11-02 20:28:32,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 125 remaining) [2022-11-02 20:28:32,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 125 remaining) [2022-11-02 20:28:32,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 125 remaining) [2022-11-02 20:28:32,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 125 remaining) [2022-11-02 20:28:32,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (24 of 125 remaining) [2022-11-02 20:28:32,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (23 of 125 remaining) [2022-11-02 20:28:32,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (22 of 125 remaining) [2022-11-02 20:28:32,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (21 of 125 remaining) [2022-11-02 20:28:32,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (20 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (17 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (16 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 125 remaining) [2022-11-02 20:28:32,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (14 of 125 remaining) [2022-11-02 20:28:32,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 125 remaining) [2022-11-02 20:28:32,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 125 remaining) [2022-11-02 20:28:32,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 125 remaining) [2022-11-02 20:28:32,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (10 of 125 remaining) [2022-11-02 20:28:32,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (9 of 125 remaining) [2022-11-02 20:28:32,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 125 remaining) [2022-11-02 20:28:32,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 125 remaining) [2022-11-02 20:28:32,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 125 remaining) [2022-11-02 20:28:32,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (5 of 125 remaining) [2022-11-02 20:28:32,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (4 of 125 remaining) [2022-11-02 20:28:32,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 125 remaining) [2022-11-02 20:28:32,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 125 remaining) [2022-11-02 20:28:32,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 125 remaining) [2022-11-02 20:28:32,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 125 remaining) [2022-11-02 20:28:32,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:28:32,960 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:32,966 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:28:32,966 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:28:32,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:28:32 BasicIcfg [2022-11-02 20:28:32,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:28:32,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:28:32,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:28:32,973 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:28:32,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:58" (3/4) ... [2022-11-02 20:28:32,976 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:28:32,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:28:32,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:28:32,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:28:32,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:28:32,988 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-02 20:28:32,988 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:28:32,989 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:28:32,989 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:28:33,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:28:33,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:28:33,037 INFO L158 Benchmark]: Toolchain (without parser) took 36364.71ms. Allocated memory was 119.5MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 88.1MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:28:33,038 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:28:33,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.35ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 91.2MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:28:33,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.26ms. Allocated memory is still 119.5MB. Free memory was 91.2MB in the beginning and 87.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:28:33,039 INFO L158 Benchmark]: Boogie Preprocessor took 91.77ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 84.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:28:33,039 INFO L158 Benchmark]: RCFGBuilder took 1562.58ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 84.5MB in the beginning and 92.2MB in the end (delta: -7.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-11-02 20:28:33,039 INFO L158 Benchmark]: TraceAbstraction took 34090.15ms. Allocated memory was 151.0MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 91.4MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-02 20:28:33,040 INFO L158 Benchmark]: Witness Printer took 64.45ms. Allocated memory is still 9.4GB. Free memory was 8.2GB in the beginning and 8.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:28:33,042 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.35ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 91.2MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.26ms. Allocated memory is still 119.5MB. Free memory was 91.2MB in the beginning and 87.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.77ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 84.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1562.58ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 84.5MB in the beginning and 92.2MB in the end (delta: -7.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34090.15ms. Allocated memory was 151.0MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 91.4MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 64.45ms. Allocated memory is still 9.4GB. Free memory was 8.2GB in the beginning and 8.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 99]: 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: 99]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 9 procedures, 472 locations, 125 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: 33.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1584 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 227 mSDtfsCounter, 1584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=0, InterpolantAutomatonStates: 88, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2854 ConstructedInterpolants, 0 QuantifiedInterpolants, 3789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:28:33,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_077b8644-680e-4b55-9ab2-6c275ba6916f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE