./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f 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_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8 --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 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --- 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-e04fb08 [2022-11-16 11:50:04,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:50:04,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:50:04,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:50:04,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:50:04,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:50:04,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:50:04,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:50:04,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:50:04,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:50:04,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:50:04,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:50:04,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:50:04,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:50:04,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:50:04,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:50:04,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:50:04,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:50:04,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:50:04,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:50:04,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:50:04,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:50:04,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:50:04,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:50:04,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:50:04,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:50:04,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:50:04,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:50:04,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:50:04,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:50:04,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:50:04,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:50:04,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:50:04,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:50:04,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:50:04,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:50:04,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:50:04,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:50:04,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:50:04,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:50:04,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:50:04,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:50:04,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:50:04,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:50:04,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:50:04,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:50:04,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:50:04,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:50:04,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:50:04,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:50:04,774 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:50:04,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:50:04,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:50:04,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:50:04,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:50:04,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:50:04,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:50:04,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:50:04,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:50:04,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:50:04,778 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:50:04,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:50:04,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:50:04,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:50:04,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:50:04,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:50:04,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:50:04,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:50:04,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:50:04,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:50:04,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:50:04,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:50:04,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:50:04,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:50:04,782 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:50:04,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:50:04,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:50:04,783 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_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/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_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8 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 -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 [2022-11-16 11:50:05,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:50:05,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:50:05,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:50:05,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:50:05,242 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:50:05,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-16 11:50:05,328 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/data/04d8c76ea/71420264c9244130990cf6039293b7b1/FLAGeafb5ca7a [2022-11-16 11:50:05,846 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:50:05,847 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-16 11:50:05,857 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/data/04d8c76ea/71420264c9244130990cf6039293b7b1/FLAGeafb5ca7a [2022-11-16 11:50:06,200 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/data/04d8c76ea/71420264c9244130990cf6039293b7b1 [2022-11-16 11:50:06,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:50:06,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:50:06,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:50:06,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:50:06,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:50:06,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4dbe0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06, skipping insertion in model container [2022-11-16 11:50:06,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:50:06,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:50:06,653 WARN L229 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_187134af-2f25-44b9-be4e-40cc518055f3/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-16 11:50:06,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:50:06,674 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:50:06,734 WARN L229 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_187134af-2f25-44b9-be4e-40cc518055f3/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-16 11:50:06,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:50:06,761 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:50:06,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06 WrapperNode [2022-11-16 11:50:06,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:50:06,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:50:06,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:50:06,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:50:06,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,848 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 715 [2022-11-16 11:50:06,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:50:06,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:50:06,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:50:06,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:50:06,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:06,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:50:06,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:50:06,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:50:07,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:50:07,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (1/1) ... [2022-11-16 11:50:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:50:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:07,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:50:07,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:50:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:50:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:50:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:50:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:50:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:50:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:50:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:50:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:50:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:50:07,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:50:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:50:07,153 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:50:07,387 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:50:07,405 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:50:08,983 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:50:10,470 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:50:10,470 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 11:50:10,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:50:10 BoogieIcfgContainer [2022-11-16 11:50:10,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:50:10,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:50:10,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:50:10,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:50:10,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:50:06" (1/3) ... [2022-11-16 11:50:10,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50551f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:10, skipping insertion in model container [2022-11-16 11:50:10,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:06" (2/3) ... [2022-11-16 11:50:10,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50551f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:10, skipping insertion in model container [2022-11-16 11:50:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:50:10" (3/3) ... [2022-11-16 11:50:10,494 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-11-16 11:50:10,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:50:10,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:50:10,533 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 116 error locations. [2022-11-16 11:50:10,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:50:10,918 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:50:11,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 479 transitions, 982 flow [2022-11-16 11:50:11,306 INFO L130 PetriNetUnfolder]: 19/476 cut-off events. [2022-11-16 11:50:11,306 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:50:11,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 476 events. 19/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 707 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 397. Up to 2 conditions per place. [2022-11-16 11:50:11,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 479 transitions, 982 flow [2022-11-16 11:50:11,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 448 places, 456 transitions, 930 flow [2022-11-16 11:50:11,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:50:11,378 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;@420d601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:50:11,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 207 error locations. [2022-11-16 11:50:11,399 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-16 11:50:11,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:50:11,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:11,402 INFO L209 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] [2022-11-16 11:50:11,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 361508747, now seen corresponding path program 1 times [2022-11-16 11:50:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:11,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178543469] [2022-11-16 11:50:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:11,834 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-16 11:50:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:11,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178543469] [2022-11-16 11:50:11,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178543469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:11,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:11,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350049946] [2022-11-16 11:50:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:11,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:11,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 456 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:11,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:11,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:12,586 INFO L130 PetriNetUnfolder]: 66/439 cut-off events. [2022-11-16 11:50:12,587 INFO L131 PetriNetUnfolder]: For 37/49 co-relation queries the response was YES. [2022-11-16 11:50:12,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 439 events. 66/439 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 527 event pairs, 31 based on Foata normal form. 41/431 useless extension candidates. Maximal degree in co-relation 372. Up to 104 conditions per place. [2022-11-16 11:50:12,598 INFO L137 encePairwiseOnDemand]: 376/479 looper letters, 19 selfloop transitions, 2 changer transitions 6/355 dead transitions. [2022-11-16 11:50:12,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 355 transitions, 770 flow [2022-11-16 11:50:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2022-11-16 11:50:12,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8239387613082811 [2022-11-16 11:50:12,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1184 transitions. [2022-11-16 11:50:12,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1184 transitions. [2022-11-16 11:50:12,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:12,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1184 transitions. [2022-11-16 11:50:12,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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-16 11:50:12,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:12,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:12,683 INFO L175 Difference]: Start difference. First operand has 448 places, 456 transitions, 930 flow. Second operand 3 states and 1184 transitions. [2022-11-16 11:50:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 355 transitions, 770 flow [2022-11-16 11:50:12,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 355 transitions, 758 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:50:12,709 INFO L231 Difference]: Finished difference. Result has 355 places, 349 transitions, 708 flow [2022-11-16 11:50:12,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=355, PETRI_TRANSITIONS=349} [2022-11-16 11:50:12,718 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -93 predicate places. [2022-11-16 11:50:12,719 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 349 transitions, 708 flow [2022-11-16 11:50:12,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:12,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:12,721 INFO L209 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] [2022-11-16 11:50:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:50:12,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -442970851, now seen corresponding path program 1 times [2022-11-16 11:50:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:12,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600965945] [2022-11-16 11:50:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:12,905 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-16 11:50:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:12,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600965945] [2022-11-16 11:50:12,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600965945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:12,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:12,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210347875] [2022-11-16 11:50:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:12,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:12,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:12,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:12,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:12,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:13,333 INFO L130 PetriNetUnfolder]: 66/432 cut-off events. [2022-11-16 11:50:13,334 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-16 11:50:13,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 432 events. 66/432 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 521 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 515. Up to 105 conditions per place. [2022-11-16 11:50:13,337 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2022-11-16 11:50:13,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 348 transitions, 750 flow [2022-11-16 11:50:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:13,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:13,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:13,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:13,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:13,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:13,356 INFO L175 Difference]: Start difference. First operand has 355 places, 349 transitions, 708 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:13,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 348 transitions, 750 flow [2022-11-16 11:50:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 348 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:13,368 INFO L231 Difference]: Finished difference. Result has 348 places, 348 transitions, 706 flow [2022-11-16 11:50:13,369 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=348, PETRI_TRANSITIONS=348} [2022-11-16 11:50:13,371 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -100 predicate places. [2022-11-16 11:50:13,371 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 348 transitions, 706 flow [2022-11-16 11:50:13,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:13,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:13,373 INFO L209 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] [2022-11-16 11:50:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:50:13,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2120855895, now seen corresponding path program 1 times [2022-11-16 11:50:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:13,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822658981] [2022-11-16 11:50:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:13,532 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-16 11:50:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822658981] [2022-11-16 11:50:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822658981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:13,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:13,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323344107] [2022-11-16 11:50:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:13,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:13,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 348 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:13,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:13,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:13,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:13,864 INFO L130 PetriNetUnfolder]: 66/431 cut-off events. [2022-11-16 11:50:13,865 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-16 11:50:13,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 431 events. 66/431 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 523 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 507. Up to 105 conditions per place. [2022-11-16 11:50:13,869 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-16 11:50:13,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 347 transitions, 748 flow [2022-11-16 11:50:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:13,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:13,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:13,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:13,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:13,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:13,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:13,889 INFO L175 Difference]: Start difference. First operand has 348 places, 348 transitions, 706 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:13,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 347 transitions, 748 flow [2022-11-16 11:50:13,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 347 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:13,901 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 704 flow [2022-11-16 11:50:13,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-16 11:50:13,903 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-16 11:50:13,903 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 704 flow [2022-11-16 11:50:13,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:13,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:13,905 INFO L209 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] [2022-11-16 11:50:13,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:50:13,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -383090007, now seen corresponding path program 1 times [2022-11-16 11:50:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:13,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011622444] [2022-11-16 11:50:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:13,986 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-16 11:50:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:13,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011622444] [2022-11-16 11:50:13,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011622444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:13,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:13,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451601603] [2022-11-16 11:50:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:13,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:13,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:13,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:13,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:13,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:14,475 INFO L130 PetriNetUnfolder]: 89/558 cut-off events. [2022-11-16 11:50:14,476 INFO L131 PetriNetUnfolder]: For 15/33 co-relation queries the response was YES. [2022-11-16 11:50:14,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 558 events. 89/558 cut-off events. For 15/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1192 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 662. Up to 107 conditions per place. [2022-11-16 11:50:14,482 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 26 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-11-16 11:50:14,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 356 transitions, 783 flow [2022-11-16 11:50:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2022-11-16 11:50:14,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7654836464857342 [2022-11-16 11:50:14,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1100 transitions. [2022-11-16 11:50:14,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1100 transitions. [2022-11-16 11:50:14,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:14,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1100 transitions. [2022-11-16 11:50:14,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 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-16 11:50:14,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:14,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:14,502 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 704 flow. Second operand 3 states and 1100 transitions. [2022-11-16 11:50:14,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 356 transitions, 783 flow [2022-11-16 11:50:14,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 356 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:14,513 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 708 flow [2022-11-16 11:50:14,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-16 11:50:14,515 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-16 11:50:14,516 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 708 flow [2022-11-16 11:50:14,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:14,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:14,518 INFO L209 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-16 11:50:14,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:50:14,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2036418058, now seen corresponding path program 1 times [2022-11-16 11:50:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:14,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499008328] [2022-11-16 11:50:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:14,605 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-16 11:50:14,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499008328] [2022-11-16 11:50:14,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499008328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:14,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:14,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769327920] [2022-11-16 11:50:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:14,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:14,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:14,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:14,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:14,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:14,973 INFO L130 PetriNetUnfolder]: 89/531 cut-off events. [2022-11-16 11:50:14,973 INFO L131 PetriNetUnfolder]: For 29/44 co-relation queries the response was YES. [2022-11-16 11:50:14,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 531 events. 89/531 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1031 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 351. Up to 139 conditions per place. [2022-11-16 11:50:14,978 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2022-11-16 11:50:14,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 346 transitions, 746 flow [2022-11-16 11:50:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:14,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:14,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:14,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:14,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:14,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:14,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:14,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:14,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:14,996 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 708 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 346 transitions, 746 flow [2022-11-16 11:50:15,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:15,006 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 708 flow [2022-11-16 11:50:15,007 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2022-11-16 11:50:15,008 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-16 11:50:15,009 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 708 flow [2022-11-16 11:50:15,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:15,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:15,010 INFO L209 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] [2022-11-16 11:50:15,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:50:15,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash 519389193, now seen corresponding path program 1 times [2022-11-16 11:50:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689240087] [2022-11-16 11:50:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,072 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-16 11:50:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:15,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689240087] [2022-11-16 11:50:15,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689240087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:15,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:15,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903092877] [2022-11-16 11:50:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:15,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:15,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:15,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:15,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:15,413 INFO L130 PetriNetUnfolder]: 89/530 cut-off events. [2022-11-16 11:50:15,413 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-16 11:50:15,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 530 events. 89/530 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1039 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 137 conditions per place. [2022-11-16 11:50:15,419 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 18 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2022-11-16 11:50:15,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 744 flow [2022-11-16 11:50:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-16 11:50:15,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-16 11:50:15,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-16 11:50:15,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-16 11:50:15,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:15,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-16 11:50:15,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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-16 11:50:15,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:15,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:15,437 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 708 flow. Second operand 3 states and 1090 transitions. [2022-11-16 11:50:15,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 744 flow [2022-11-16 11:50:15,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:15,450 INFO L231 Difference]: Finished difference. Result has 346 places, 345 transitions, 704 flow [2022-11-16 11:50:15,451 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=346, PETRI_TRANSITIONS=345} [2022-11-16 11:50:15,456 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-16 11:50:15,456 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 345 transitions, 704 flow [2022-11-16 11:50:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:15,459 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:15,459 INFO L209 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] [2022-11-16 11:50:15,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:50:15,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash -175073494, now seen corresponding path program 1 times [2022-11-16 11:50:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992818115] [2022-11-16 11:50:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:15,615 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-16 11:50:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992818115] [2022-11-16 11:50:15,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992818115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:15,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429456681] [2022-11-16 11:50:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:15,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:15,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:15,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:15,622 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:15,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 345 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:15,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:15,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:15,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:15,958 INFO L130 PetriNetUnfolder]: 89/529 cut-off events. [2022-11-16 11:50:15,958 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-16 11:50:15,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 529 events. 89/529 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1034 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 139 conditions per place. [2022-11-16 11:50:15,964 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2022-11-16 11:50:15,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 742 flow [2022-11-16 11:50:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:15,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:15,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:15,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:15,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:15,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:15,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:15,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:15,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:15,980 INFO L175 Difference]: Start difference. First operand has 346 places, 345 transitions, 704 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:15,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 742 flow [2022-11-16 11:50:15,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:15,990 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 705 flow [2022-11-16 11:50:15,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2022-11-16 11:50:15,992 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-16 11:50:15,992 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 705 flow [2022-11-16 11:50:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:15,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:15,994 INFO L209 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] [2022-11-16 11:50:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:50:15,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash 184583361, now seen corresponding path program 1 times [2022-11-16 11:50:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319615749] [2022-11-16 11:50:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,742 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-16 11:50:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319615749] [2022-11-16 11:50:16,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319615749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:16,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:16,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983300126] [2022-11-16 11:50:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:16,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 479 [2022-11-16 11:50:16,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 705 flow. Second operand has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 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-16 11:50:16,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:16,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 479 [2022-11-16 11:50:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:17,863 INFO L130 PetriNetUnfolder]: 569/1174 cut-off events. [2022-11-16 11:50:17,864 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-16 11:50:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 1174 events. 569/1174 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3654 event pairs, 320 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2052. Up to 841 conditions per place. [2022-11-16 11:50:17,873 INFO L137 encePairwiseOnDemand]: 461/479 looper letters, 66 selfloop transitions, 15 changer transitions 0/341 dead transitions. [2022-11-16 11:50:17,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 341 transitions, 861 flow [2022-11-16 11:50:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1847 transitions. [2022-11-16 11:50:17,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6426583159359778 [2022-11-16 11:50:17,878 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1847 transitions. [2022-11-16 11:50:17,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1847 transitions. [2022-11-16 11:50:17,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:17,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1847 transitions. [2022-11-16 11:50:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 307.8333333333333) internal successors, (1847), 6 states have internal predecessors, (1847), 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-16 11:50:17,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:17,892 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:17,892 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 705 flow. Second operand 6 states and 1847 transitions. [2022-11-16 11:50:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 341 transitions, 861 flow [2022-11-16 11:50:17,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 341 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:17,900 INFO L231 Difference]: Finished difference. Result has 346 places, 341 transitions, 725 flow [2022-11-16 11:50:17,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=346, PETRI_TRANSITIONS=341} [2022-11-16 11:50:17,902 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-16 11:50:17,902 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 341 transitions, 725 flow [2022-11-16 11:50:17,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 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-16 11:50:17,904 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:17,904 INFO L209 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] [2022-11-16 11:50:17,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:50:17,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1666495121, now seen corresponding path program 1 times [2022-11-16 11:50:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:17,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811523281] [2022-11-16 11:50:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:17,955 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-16 11:50:17,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:17,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811523281] [2022-11-16 11:50:17,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811523281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:17,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:17,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069186316] [2022-11-16 11:50:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:17,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:17,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:17,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 341 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:17,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:17,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:17,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:18,245 INFO L130 PetriNetUnfolder]: 89/525 cut-off events. [2022-11-16 11:50:18,245 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-16 11:50:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 525 events. 89/525 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1022 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 670. Up to 142 conditions per place. [2022-11-16 11:50:18,249 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 21 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2022-11-16 11:50:18,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 340 transitions, 769 flow [2022-11-16 11:50:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:18,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:18,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:18,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:18,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:18,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:18,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:18,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:18,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:18,261 INFO L175 Difference]: Start difference. First operand has 346 places, 341 transitions, 725 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:18,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 340 transitions, 769 flow [2022-11-16 11:50:18,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 340 transitions, 739 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:50:18,268 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 697 flow [2022-11-16 11:50:18,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-16 11:50:18,269 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-16 11:50:18,269 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 697 flow [2022-11-16 11:50:18,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:18,270 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:18,270 INFO L209 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] [2022-11-16 11:50:18,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:50:18,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1773761217, now seen corresponding path program 1 times [2022-11-16 11:50:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476752122] [2022-11-16 11:50:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:18,314 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-16 11:50:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476752122] [2022-11-16 11:50:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476752122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:18,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:18,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710101784] [2022-11-16 11:50:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:18,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:18,319 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:18,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:18,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:18,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:18,702 INFO L130 PetriNetUnfolder]: 149/740 cut-off events. [2022-11-16 11:50:18,702 INFO L131 PetriNetUnfolder]: For 51/70 co-relation queries the response was YES. [2022-11-16 11:50:18,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 740 events. 149/740 cut-off events. For 51/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2417 event pairs, 50 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 956. Up to 121 conditions per place. [2022-11-16 11:50:18,707 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 29 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2022-11-16 11:50:18,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 788 flow [2022-11-16 11:50:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-16 11:50:18,710 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-16 11:50:18,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-16 11:50:18,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-16 11:50:18,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:18,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-16 11:50:18,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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-16 11:50:18,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:18,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:18,718 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 697 flow. Second operand 3 states and 1101 transitions. [2022-11-16 11:50:18,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 788 flow [2022-11-16 11:50:18,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:18,725 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 701 flow [2022-11-16 11:50:18,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-16 11:50:18,727 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-16 11:50:18,727 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 701 flow [2022-11-16 11:50:18,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:18,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:18,728 INFO L209 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] [2022-11-16 11:50:18,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:50:18,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -847127388, now seen corresponding path program 1 times [2022-11-16 11:50:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:18,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161021268] [2022-11-16 11:50:18,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:18,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:18,772 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-16 11:50:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161021268] [2022-11-16 11:50:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161021268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452909548] [2022-11-16 11:50:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:18,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:18,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:18,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:18,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:18,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:19,134 INFO L130 PetriNetUnfolder]: 149/719 cut-off events. [2022-11-16 11:50:19,135 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-16 11:50:19,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 719 events. 149/719 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2327 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 982. Up to 233 conditions per place. [2022-11-16 11:50:19,140 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2022-11-16 11:50:19,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 741 flow [2022-11-16 11:50:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:19,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:19,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:19,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:19,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:19,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:19,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:19,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:19,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:19,153 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 701 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 741 flow [2022-11-16 11:50:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 339 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:19,161 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 701 flow [2022-11-16 11:50:19,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-16 11:50:19,163 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-16 11:50:19,163 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 701 flow [2022-11-16 11:50:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:19,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:19,164 INFO L209 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] [2022-11-16 11:50:19,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:50:19,165 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -820869240, now seen corresponding path program 1 times [2022-11-16 11:50:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:19,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087062894] [2022-11-16 11:50:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:19,219 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-16 11:50:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087062894] [2022-11-16 11:50:19,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087062894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:19,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:19,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620765243] [2022-11-16 11:50:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:19,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:19,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:19,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:19,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:19,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:19,599 INFO L130 PetriNetUnfolder]: 149/718 cut-off events. [2022-11-16 11:50:19,599 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-16 11:50:19,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 718 events. 149/718 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2331 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 970. Up to 236 conditions per place. [2022-11-16 11:50:19,604 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2022-11-16 11:50:19,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 338 transitions, 747 flow [2022-11-16 11:50:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:19,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:19,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:19,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:19,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:19,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:19,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:19,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:19,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:19,614 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 701 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:19,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 338 transitions, 747 flow [2022-11-16 11:50:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 338 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:19,621 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 699 flow [2022-11-16 11:50:19,622 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2022-11-16 11:50:19,622 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -107 predicate places. [2022-11-16 11:50:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 699 flow [2022-11-16 11:50:19,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:19,623 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:19,624 INFO L209 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] [2022-11-16 11:50:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:50:19,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1878791325, now seen corresponding path program 1 times [2022-11-16 11:50:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426623893] [2022-11-16 11:50:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:19,667 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-16 11:50:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:19,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426623893] [2022-11-16 11:50:19,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426623893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:19,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:19,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87946094] [2022-11-16 11:50:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:19,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:19,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:19,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:19,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:19,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:19,991 INFO L130 PetriNetUnfolder]: 149/717 cut-off events. [2022-11-16 11:50:19,992 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-16 11:50:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 717 events. 149/717 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2311 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 966. Up to 231 conditions per place. [2022-11-16 11:50:19,997 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 19 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2022-11-16 11:50:19,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 737 flow [2022-11-16 11:50:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-16 11:50:20,003 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-16 11:50:20,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-16 11:50:20,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-16 11:50:20,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:20,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-16 11:50:20,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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-16 11:50:20,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,010 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 699 flow. Second operand 3 states and 1090 transitions. [2022-11-16 11:50:20,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 737 flow [2022-11-16 11:50:20,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 337 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:20,017 INFO L231 Difference]: Finished difference. Result has 340 places, 337 transitions, 695 flow [2022-11-16 11:50:20,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=340, PETRI_TRANSITIONS=337} [2022-11-16 11:50:20,018 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-16 11:50:20,018 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 337 transitions, 695 flow [2022-11-16 11:50:20,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:20,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:20,020 INFO L209 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] [2022-11-16 11:50:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:50:20,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1356856705, now seen corresponding path program 1 times [2022-11-16 11:50:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323892662] [2022-11-16 11:50:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:20,083 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-16 11:50:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323892662] [2022-11-16 11:50:20,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323892662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:20,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:20,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941668160] [2022-11-16 11:50:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:20,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:20,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:20,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:20,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:20,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 337 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:20,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:20,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:20,425 INFO L130 PetriNetUnfolder]: 149/716 cut-off events. [2022-11-16 11:50:20,425 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-16 11:50:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 716 events. 149/716 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2311 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 964. Up to 233 conditions per place. [2022-11-16 11:50:20,429 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2022-11-16 11:50:20,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 336 transitions, 735 flow [2022-11-16 11:50:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:20,433 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:20,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:20,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:20,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:20,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:20,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:20,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,439 INFO L175 Difference]: Start difference. First operand has 340 places, 337 transitions, 695 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 336 transitions, 735 flow [2022-11-16 11:50:20,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:20,445 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 696 flow [2022-11-16 11:50:20,446 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2022-11-16 11:50:20,446 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-16 11:50:20,447 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 696 flow [2022-11-16 11:50:20,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:20,447 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:20,448 INFO L209 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] [2022-11-16 11:50:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:50:20,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 597954493, now seen corresponding path program 1 times [2022-11-16 11:50:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:20,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723706285] [2022-11-16 11:50:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:20,505 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-16 11:50:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:20,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723706285] [2022-11-16 11:50:20,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723706285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:20,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:20,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568224781] [2022-11-16 11:50:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:20,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:20,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:20,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:20,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:20,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:20,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:20,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:20,829 INFO L130 PetriNetUnfolder]: 149/715 cut-off events. [2022-11-16 11:50:20,829 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-16 11:50:20,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 715 events. 149/715 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2329 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 968. Up to 236 conditions per place. [2022-11-16 11:50:20,835 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2022-11-16 11:50:20,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 335 transitions, 742 flow [2022-11-16 11:50:20,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:20,838 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:20,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:20,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:20,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:20,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:20,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:20,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:20,846 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 696 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:20,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 335 transitions, 742 flow [2022-11-16 11:50:20,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 335 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:20,852 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 694 flow [2022-11-16 11:50:20,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-16 11:50:20,854 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-16 11:50:20,854 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 694 flow [2022-11-16 11:50:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:20,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:20,855 INFO L209 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] [2022-11-16 11:50:20,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:50:20,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1824779301, now seen corresponding path program 1 times [2022-11-16 11:50:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:20,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382781165] [2022-11-16 11:50:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:20,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:20,912 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-16 11:50:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:20,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382781165] [2022-11-16 11:50:20,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382781165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:20,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:20,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352588603] [2022-11-16 11:50:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:20,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:20,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:20,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:20,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:20,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:20,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:21,529 INFO L130 PetriNetUnfolder]: 223/1059 cut-off events. [2022-11-16 11:50:21,530 INFO L131 PetriNetUnfolder]: For 119/150 co-relation queries the response was YES. [2022-11-16 11:50:21,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 1059 events. 223/1059 cut-off events. For 119/150 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4923 event pairs, 32 based on Foata normal form. 3/967 useless extension candidates. Maximal degree in co-relation 1461. Up to 254 conditions per place. [2022-11-16 11:50:21,537 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 31 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-16 11:50:21,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 347 transitions, 796 flow [2022-11-16 11:50:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-16 11:50:21,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-16 11:50:21,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-16 11:50:21,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-16 11:50:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:21,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-16 11:50:21,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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-16 11:50:21,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:21,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:21,549 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 694 flow. Second operand 3 states and 1101 transitions. [2022-11-16 11:50:21,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 347 transitions, 796 flow [2022-11-16 11:50:21,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 347 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:21,556 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 698 flow [2022-11-16 11:50:21,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-16 11:50:21,557 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-16 11:50:21,557 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 698 flow [2022-11-16 11:50:21,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:21,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:21,560 INFO L209 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] [2022-11-16 11:50:21,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:50:21,561 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1330974816, now seen corresponding path program 1 times [2022-11-16 11:50:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:21,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968385729] [2022-11-16 11:50:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,622 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-16 11:50:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968385729] [2022-11-16 11:50:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968385729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:21,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315131385] [2022-11-16 11:50:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:21,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:21,626 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:21,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:21,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:21,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:21,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:22,218 INFO L130 PetriNetUnfolder]: 223/1030 cut-off events. [2022-11-16 11:50:22,218 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-16 11:50:22,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 1030 events. 223/1030 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4865 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1530. Up to 352 conditions per place. [2022-11-16 11:50:22,230 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2022-11-16 11:50:22,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 334 transitions, 740 flow [2022-11-16 11:50:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:22,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:22,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:22,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:22,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:22,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:22,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:22,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:22,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:22,245 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 698 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:22,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 334 transitions, 740 flow [2022-11-16 11:50:22,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 334 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:22,254 INFO L231 Difference]: Finished difference. Result has 339 places, 334 transitions, 698 flow [2022-11-16 11:50:22,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=334} [2022-11-16 11:50:22,255 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-16 11:50:22,255 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 698 flow [2022-11-16 11:50:22,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:22,256 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:22,257 INFO L209 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] [2022-11-16 11:50:22,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:50:22,257 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash -998629159, now seen corresponding path program 1 times [2022-11-16 11:50:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:22,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119602973] [2022-11-16 11:50:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,331 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-16 11:50:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:22,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119602973] [2022-11-16 11:50:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119602973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:22,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:22,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900232388] [2022-11-16 11:50:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:22,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:22,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-16 11:50:22,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:22,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:22,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-16 11:50:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:22,907 INFO L130 PetriNetUnfolder]: 223/1029 cut-off events. [2022-11-16 11:50:22,907 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-16 11:50:22,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1029 events. 223/1029 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4836 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1501. Up to 355 conditions per place. [2022-11-16 11:50:22,918 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 23 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2022-11-16 11:50:22,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 333 transitions, 746 flow [2022-11-16 11:50:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-16 11:50:22,922 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-16 11:50:22,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-16 11:50:22,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-16 11:50:22,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:22,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-16 11:50:22,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 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-16 11:50:22,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:22,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:22,931 INFO L175 Difference]: Start difference. First operand has 339 places, 334 transitions, 698 flow. Second operand 3 states and 1085 transitions. [2022-11-16 11:50:22,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 333 transitions, 746 flow [2022-11-16 11:50:22,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 333 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:22,938 INFO L231 Difference]: Finished difference. Result has 338 places, 333 transitions, 696 flow [2022-11-16 11:50:22,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=338, PETRI_TRANSITIONS=333} [2022-11-16 11:50:22,940 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -110 predicate places. [2022-11-16 11:50:22,940 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 333 transitions, 696 flow [2022-11-16 11:50:22,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 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-16 11:50:22,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:22,941 INFO L209 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] [2022-11-16 11:50:22,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:50:22,941 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -905714229, now seen corresponding path program 1 times [2022-11-16 11:50:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:22,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435297883] [2022-11-16 11:50:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,006 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-16 11:50:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:23,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435297883] [2022-11-16 11:50:23,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435297883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:23,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:23,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655344744] [2022-11-16 11:50:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:23,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:23,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:23,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 333 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:23,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:23,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:23,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:23,522 INFO L130 PetriNetUnfolder]: 223/1028 cut-off events. [2022-11-16 11:50:23,522 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-16 11:50:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1028 events. 223/1028 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4846 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1497. Up to 350 conditions per place. [2022-11-16 11:50:23,531 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 20 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2022-11-16 11:50:23,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 332 transitions, 736 flow [2022-11-16 11:50:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-16 11:50:23,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-16 11:50:23,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-16 11:50:23,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-16 11:50:23,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:23,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-16 11:50:23,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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-16 11:50:23,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:23,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:23,544 INFO L175 Difference]: Start difference. First operand has 338 places, 333 transitions, 696 flow. Second operand 3 states and 1090 transitions. [2022-11-16 11:50:23,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 332 transitions, 736 flow [2022-11-16 11:50:23,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 332 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:23,551 INFO L231 Difference]: Finished difference. Result has 337 places, 332 transitions, 692 flow [2022-11-16 11:50:23,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=337, PETRI_TRANSITIONS=332} [2022-11-16 11:50:23,552 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-16 11:50:23,552 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 332 transitions, 692 flow [2022-11-16 11:50:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:23,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:23,553 INFO L209 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] [2022-11-16 11:50:23,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:50:23,553 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1941591913, now seen corresponding path program 1 times [2022-11-16 11:50:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:23,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098481792] [2022-11-16 11:50:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:23,630 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-16 11:50:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098481792] [2022-11-16 11:50:23,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098481792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:23,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:23,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116918781] [2022-11-16 11:50:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:23,634 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:23,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 332 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:23,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:23,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:23,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:24,128 INFO L130 PetriNetUnfolder]: 223/1027 cut-off events. [2022-11-16 11:50:24,129 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-16 11:50:24,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1027 events. 223/1027 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4815 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-16 11:50:24,141 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2022-11-16 11:50:24,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 331 transitions, 734 flow [2022-11-16 11:50:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:24,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:24,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:24,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:24,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:24,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:24,152 INFO L175 Difference]: Start difference. First operand has 337 places, 332 transitions, 692 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:24,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 331 transitions, 734 flow [2022-11-16 11:50:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 331 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:50:24,158 INFO L231 Difference]: Finished difference. Result has 337 places, 331 transitions, 693 flow [2022-11-16 11:50:24,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=337, PETRI_TRANSITIONS=331} [2022-11-16 11:50:24,159 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-16 11:50:24,159 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 331 transitions, 693 flow [2022-11-16 11:50:24,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:24,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:24,160 INFO L209 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] [2022-11-16 11:50:24,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:50:24,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 618760609, now seen corresponding path program 1 times [2022-11-16 11:50:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:24,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143908857] [2022-11-16 11:50:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,227 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-16 11:50:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143908857] [2022-11-16 11:50:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143908857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521366952] [2022-11-16 11:50:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:24,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:24,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:24,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 331 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:24,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:24,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:24,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:24,786 INFO L130 PetriNetUnfolder]: 223/1026 cut-off events. [2022-11-16 11:50:24,786 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-16 11:50:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1026 events. 223/1026 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4840 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1496. Up to 352 conditions per place. [2022-11-16 11:50:24,794 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2022-11-16 11:50:24,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 330 transitions, 735 flow [2022-11-16 11:50:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:24,799 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:24,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:24,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:24,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:24,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:24,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:24,808 INFO L175 Difference]: Start difference. First operand has 337 places, 331 transitions, 693 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:24,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 330 transitions, 735 flow [2022-11-16 11:50:24,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 330 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:24,815 INFO L231 Difference]: Finished difference. Result has 336 places, 330 transitions, 691 flow [2022-11-16 11:50:24,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=336, PETRI_TRANSITIONS=330} [2022-11-16 11:50:24,817 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -112 predicate places. [2022-11-16 11:50:24,817 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 691 flow [2022-11-16 11:50:24,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:24,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:24,818 INFO L209 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] [2022-11-16 11:50:24,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:50:24,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1929497099, now seen corresponding path program 1 times [2022-11-16 11:50:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:24,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567913781] [2022-11-16 11:50:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,903 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-16 11:50:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:24,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567913781] [2022-11-16 11:50:24,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567913781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:24,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:24,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567436800] [2022-11-16 11:50:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:24,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:24,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:24,908 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:24,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:24,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:24,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:25,438 INFO L130 PetriNetUnfolder]: 223/1025 cut-off events. [2022-11-16 11:50:25,438 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-16 11:50:25,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1025 events. 223/1025 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4812 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-16 11:50:25,446 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-16 11:50:25,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 733 flow [2022-11-16 11:50:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-16 11:50:25,449 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-16 11:50:25,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-16 11:50:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-16 11:50:25,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:25,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-16 11:50:25,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-16 11:50:25,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:25,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:25,461 INFO L175 Difference]: Start difference. First operand has 336 places, 330 transitions, 691 flow. Second operand 3 states and 1091 transitions. [2022-11-16 11:50:25,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 329 transitions, 733 flow [2022-11-16 11:50:25,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 329 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:25,468 INFO L231 Difference]: Finished difference. Result has 335 places, 329 transitions, 689 flow [2022-11-16 11:50:25,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=335, PETRI_TRANSITIONS=329} [2022-11-16 11:50:25,469 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -113 predicate places. [2022-11-16 11:50:25,469 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 329 transitions, 689 flow [2022-11-16 11:50:25,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-16 11:50:25,470 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:25,471 INFO L209 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-16 11:50:25,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:50:25,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -626006107, now seen corresponding path program 1 times [2022-11-16 11:50:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381858205] [2022-11-16 11:50:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:26,387 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-16 11:50:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:26,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381858205] [2022-11-16 11:50:26,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381858205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:26,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:26,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834647937] [2022-11-16 11:50:26,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:26,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:26,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:26,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-16 11:50:26,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 329 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 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-16 11:50:26,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:26,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-16 11:50:26,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:29,002 INFO L130 PetriNetUnfolder]: 1687/3138 cut-off events. [2022-11-16 11:50:29,002 INFO L131 PetriNetUnfolder]: For 882/882 co-relation queries the response was YES. [2022-11-16 11:50:29,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 3138 events. 1687/3138 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16001 event pairs, 233 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 6464. Up to 1216 conditions per place. [2022-11-16 11:50:29,023 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 93 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2022-11-16 11:50:29,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 372 transitions, 1017 flow [2022-11-16 11:50:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2009 transitions. [2022-11-16 11:50:29,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6990257480862909 [2022-11-16 11:50:29,029 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2009 transitions. [2022-11-16 11:50:29,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2009 transitions. [2022-11-16 11:50:29,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:29,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2009 transitions. [2022-11-16 11:50:29,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 334.8333333333333) internal successors, (2009), 6 states have internal predecessors, (2009), 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-16 11:50:29,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:29,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:29,042 INFO L175 Difference]: Start difference. First operand has 335 places, 329 transitions, 689 flow. Second operand 6 states and 2009 transitions. [2022-11-16 11:50:29,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 372 transitions, 1017 flow [2022-11-16 11:50:29,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 372 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:50:29,049 INFO L231 Difference]: Finished difference. Result has 337 places, 328 transitions, 691 flow [2022-11-16 11:50:29,050 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=328} [2022-11-16 11:50:29,050 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-16 11:50:29,050 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 328 transitions, 691 flow [2022-11-16 11:50:29,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 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-16 11:50:29,051 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:29,052 INFO L209 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, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:29,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:50:29,052 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -490622007, now seen corresponding path program 1 times [2022-11-16 11:50:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936859614] [2022-11-16 11:50:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:29,777 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-16 11:50:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:29,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936859614] [2022-11-16 11:50:29,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936859614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:29,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:29,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133430678] [2022-11-16 11:50:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:29,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:29,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:29,781 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-16 11:50:29,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 328 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 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-16 11:50:29,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:29,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-16 11:50:29,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:32,266 INFO L130 PetriNetUnfolder]: 1512/2940 cut-off events. [2022-11-16 11:50:32,268 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-11-16 11:50:32,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 2940 events. 1512/2940 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14966 event pairs, 837 based on Foata normal form. 0/2815 useless extension candidates. Maximal degree in co-relation 6181. Up to 1608 conditions per place. [2022-11-16 11:50:32,344 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 72 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2022-11-16 11:50:32,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 351 transitions, 921 flow [2022-11-16 11:50:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1992 transitions. [2022-11-16 11:50:32,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6931106471816284 [2022-11-16 11:50:32,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1992 transitions. [2022-11-16 11:50:32,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1992 transitions. [2022-11-16 11:50:32,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:32,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1992 transitions. [2022-11-16 11:50:32,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-16 11:50:32,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:32,386 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:32,386 INFO L175 Difference]: Start difference. First operand has 337 places, 328 transitions, 691 flow. Second operand 6 states and 1992 transitions. [2022-11-16 11:50:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 351 transitions, 921 flow [2022-11-16 11:50:32,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 351 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:32,397 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 690 flow [2022-11-16 11:50:32,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2022-11-16 11:50:32,399 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-16 11:50:32,400 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 690 flow [2022-11-16 11:50:32,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 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-16 11:50:32,401 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:32,401 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:50:32,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:50:32,404 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash -888181121, now seen corresponding path program 1 times [2022-11-16 11:50:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:32,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759577105] [2022-11-16 11:50:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:33,455 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-16 11:50:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759577105] [2022-11-16 11:50:33,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759577105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:33,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:33,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:50:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056590056] [2022-11-16 11:50:33,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:50:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:50:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:50:33,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-16 11:50:33,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 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-16 11:50:33,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:33,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-16 11:50:33,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:36,095 INFO L130 PetriNetUnfolder]: 1489/2909 cut-off events. [2022-11-16 11:50:36,095 INFO L131 PetriNetUnfolder]: For 786/786 co-relation queries the response was YES. [2022-11-16 11:50:36,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 2909 events. 1489/2909 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14845 event pairs, 1015 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 6015. Up to 1995 conditions per place. [2022-11-16 11:50:36,125 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 59 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2022-11-16 11:50:36,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 338 transitions, 854 flow [2022-11-16 11:50:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:50:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:50:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1983 transitions. [2022-11-16 11:50:36,133 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6899791231732777 [2022-11-16 11:50:36,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1983 transitions. [2022-11-16 11:50:36,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1983 transitions. [2022-11-16 11:50:36,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:36,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1983 transitions. [2022-11-16 11:50:36,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.5) internal successors, (1983), 6 states have internal predecessors, (1983), 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-16 11:50:36,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:36,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 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-16 11:50:36,152 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 690 flow. Second operand 6 states and 1983 transitions. [2022-11-16 11:50:36,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 338 transitions, 854 flow [2022-11-16 11:50:36,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 338 transitions, 847 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:36,161 INFO L231 Difference]: Finished difference. Result has 337 places, 326 transitions, 689 flow [2022-11-16 11:50:36,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=689, PETRI_PLACES=337, PETRI_TRANSITIONS=326} [2022-11-16 11:50:36,163 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-16 11:50:36,163 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 326 transitions, 689 flow [2022-11-16 11:50:36,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 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-16 11:50:36,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:50:36,165 INFO L209 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, 1, 1, 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-16 11:50:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:50:36,166 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-16 11:50:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1253771268, now seen corresponding path program 1 times [2022-11-16 11:50:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:36,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755517535] [2022-11-16 11:50:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:36,290 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-16 11:50:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755517535] [2022-11-16 11:50:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755517535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:36,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:36,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:50:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836127741] [2022-11-16 11:50:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:50:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:50:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:50:36,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-16 11:50:36,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 326 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 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-16 11:50:36,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:50:36,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-16 11:50:36,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:50:36,948 INFO L130 PetriNetUnfolder]: 223/1007 cut-off events. [2022-11-16 11:50:36,948 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-16 11:50:36,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1007 events. 223/1007 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4697 event pairs, 146 based on Foata normal form. 8/926 useless extension candidates. Maximal degree in co-relation 1507. Up to 351 conditions per place. [2022-11-16 11:50:36,954 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 0 selfloop transitions, 0 changer transitions 325/325 dead transitions. [2022-11-16 11:50:36,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 325 transitions, 727 flow [2022-11-16 11:50:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:50:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:50:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2022-11-16 11:50:36,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7578288100208769 [2022-11-16 11:50:36,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1089 transitions. [2022-11-16 11:50:36,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1089 transitions. [2022-11-16 11:50:36,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:50:36,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1089 transitions. [2022-11-16 11:50:36,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 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-16 11:50:36,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:36,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 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-16 11:50:36,973 INFO L175 Difference]: Start difference. First operand has 337 places, 326 transitions, 689 flow. Second operand 3 states and 1089 transitions. [2022-11-16 11:50:36,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 325 transitions, 727 flow [2022-11-16 11:50:36,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 325 transitions, 720 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:50:36,979 INFO L231 Difference]: Finished difference. Result has 334 places, 0 transitions, 0 flow [2022-11-16 11:50:36,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=334, PETRI_TRANSITIONS=0} [2022-11-16 11:50:36,981 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -114 predicate places. [2022-11-16 11:50:36,982 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 0 transitions, 0 flow [2022-11-16 11:50:36,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 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-16 11:50:36,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (206 of 207 remaining) [2022-11-16 11:50:36,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (205 of 207 remaining) [2022-11-16 11:50:36,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (204 of 207 remaining) [2022-11-16 11:50:36,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (203 of 207 remaining) [2022-11-16 11:50:36,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (202 of 207 remaining) [2022-11-16 11:50:36,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (201 of 207 remaining) [2022-11-16 11:50:36,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (200 of 207 remaining) [2022-11-16 11:50:36,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (199 of 207 remaining) [2022-11-16 11:50:36,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (198 of 207 remaining) [2022-11-16 11:50:36,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (197 of 207 remaining) [2022-11-16 11:50:36,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (196 of 207 remaining) [2022-11-16 11:50:36,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (195 of 207 remaining) [2022-11-16 11:50:36,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (194 of 207 remaining) [2022-11-16 11:50:36,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 207 remaining) [2022-11-16 11:50:36,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (192 of 207 remaining) [2022-11-16 11:50:36,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (191 of 207 remaining) [2022-11-16 11:50:36,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (190 of 207 remaining) [2022-11-16 11:50:36,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (189 of 207 remaining) [2022-11-16 11:50:36,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (188 of 207 remaining) [2022-11-16 11:50:36,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (187 of 207 remaining) [2022-11-16 11:50:36,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (186 of 207 remaining) [2022-11-16 11:50:37,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (185 of 207 remaining) [2022-11-16 11:50:37,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (184 of 207 remaining) [2022-11-16 11:50:37,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 207 remaining) [2022-11-16 11:50:37,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (182 of 207 remaining) [2022-11-16 11:50:37,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (181 of 207 remaining) [2022-11-16 11:50:37,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (180 of 207 remaining) [2022-11-16 11:50:37,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (179 of 207 remaining) [2022-11-16 11:50:37,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (178 of 207 remaining) [2022-11-16 11:50:37,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (177 of 207 remaining) [2022-11-16 11:50:37,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (176 of 207 remaining) [2022-11-16 11:50:37,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (175 of 207 remaining) [2022-11-16 11:50:37,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (174 of 207 remaining) [2022-11-16 11:50:37,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (173 of 207 remaining) [2022-11-16 11:50:37,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (172 of 207 remaining) [2022-11-16 11:50:37,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (171 of 207 remaining) [2022-11-16 11:50:37,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (170 of 207 remaining) [2022-11-16 11:50:37,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (169 of 207 remaining) [2022-11-16 11:50:37,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (168 of 207 remaining) [2022-11-16 11:50:37,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (167 of 207 remaining) [2022-11-16 11:50:37,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (166 of 207 remaining) [2022-11-16 11:50:37,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (165 of 207 remaining) [2022-11-16 11:50:37,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (164 of 207 remaining) [2022-11-16 11:50:37,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (163 of 207 remaining) [2022-11-16 11:50:37,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (162 of 207 remaining) [2022-11-16 11:50:37,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (161 of 207 remaining) [2022-11-16 11:50:37,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (160 of 207 remaining) [2022-11-16 11:50:37,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (159 of 207 remaining) [2022-11-16 11:50:37,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (158 of 207 remaining) [2022-11-16 11:50:37,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (157 of 207 remaining) [2022-11-16 11:50:37,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (156 of 207 remaining) [2022-11-16 11:50:37,011 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (155 of 207 remaining) [2022-11-16 11:50:37,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (154 of 207 remaining) [2022-11-16 11:50:37,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (153 of 207 remaining) [2022-11-16 11:50:37,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (152 of 207 remaining) [2022-11-16 11:50:37,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (151 of 207 remaining) [2022-11-16 11:50:37,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 207 remaining) [2022-11-16 11:50:37,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (149 of 207 remaining) [2022-11-16 11:50:37,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (148 of 207 remaining) [2022-11-16 11:50:37,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (147 of 207 remaining) [2022-11-16 11:50:37,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (146 of 207 remaining) [2022-11-16 11:50:37,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (145 of 207 remaining) [2022-11-16 11:50:37,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (144 of 207 remaining) [2022-11-16 11:50:37,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (143 of 207 remaining) [2022-11-16 11:50:37,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (142 of 207 remaining) [2022-11-16 11:50:37,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (141 of 207 remaining) [2022-11-16 11:50:37,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (140 of 207 remaining) [2022-11-16 11:50:37,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (139 of 207 remaining) [2022-11-16 11:50:37,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (138 of 207 remaining) [2022-11-16 11:50:37,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 207 remaining) [2022-11-16 11:50:37,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (136 of 207 remaining) [2022-11-16 11:50:37,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (135 of 207 remaining) [2022-11-16 11:50:37,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (134 of 207 remaining) [2022-11-16 11:50:37,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (133 of 207 remaining) [2022-11-16 11:50:37,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (132 of 207 remaining) [2022-11-16 11:50:37,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (131 of 207 remaining) [2022-11-16 11:50:37,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (130 of 207 remaining) [2022-11-16 11:50:37,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (129 of 207 remaining) [2022-11-16 11:50:37,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 207 remaining) [2022-11-16 11:50:37,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (127 of 207 remaining) [2022-11-16 11:50:37,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (126 of 207 remaining) [2022-11-16 11:50:37,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (125 of 207 remaining) [2022-11-16 11:50:37,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (124 of 207 remaining) [2022-11-16 11:50:37,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (123 of 207 remaining) [2022-11-16 11:50:37,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (122 of 207 remaining) [2022-11-16 11:50:37,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (121 of 207 remaining) [2022-11-16 11:50:37,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (120 of 207 remaining) [2022-11-16 11:50:37,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (119 of 207 remaining) [2022-11-16 11:50:37,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 207 remaining) [2022-11-16 11:50:37,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 207 remaining) [2022-11-16 11:50:37,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 207 remaining) [2022-11-16 11:50:37,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 207 remaining) [2022-11-16 11:50:37,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 207 remaining) [2022-11-16 11:50:37,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 207 remaining) [2022-11-16 11:50:37,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (112 of 207 remaining) [2022-11-16 11:50:37,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (111 of 207 remaining) [2022-11-16 11:50:37,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 207 remaining) [2022-11-16 11:50:37,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 207 remaining) [2022-11-16 11:50:37,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (108 of 207 remaining) [2022-11-16 11:50:37,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (107 of 207 remaining) [2022-11-16 11:50:37,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 207 remaining) [2022-11-16 11:50:37,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 207 remaining) [2022-11-16 11:50:37,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 207 remaining) [2022-11-16 11:50:37,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 207 remaining) [2022-11-16 11:50:37,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 207 remaining) [2022-11-16 11:50:37,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 207 remaining) [2022-11-16 11:50:37,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 207 remaining) [2022-11-16 11:50:37,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 207 remaining) [2022-11-16 11:50:37,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (98 of 207 remaining) [2022-11-16 11:50:37,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (97 of 207 remaining) [2022-11-16 11:50:37,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 207 remaining) [2022-11-16 11:50:37,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 207 remaining) [2022-11-16 11:50:37,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 207 remaining) [2022-11-16 11:50:37,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (93 of 207 remaining) [2022-11-16 11:50:37,028 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (92 of 207 remaining) [2022-11-16 11:50:37,028 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (91 of 207 remaining) [2022-11-16 11:50:37,028 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 207 remaining) [2022-11-16 11:50:37,028 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 207 remaining) [2022-11-16 11:50:37,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 207 remaining) [2022-11-16 11:50:37,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (87 of 207 remaining) [2022-11-16 11:50:37,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 207 remaining) [2022-11-16 11:50:37,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 207 remaining) [2022-11-16 11:50:37,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (84 of 207 remaining) [2022-11-16 11:50:37,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (83 of 207 remaining) [2022-11-16 11:50:37,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 207 remaining) [2022-11-16 11:50:37,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 207 remaining) [2022-11-16 11:50:37,031 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 207 remaining) [2022-11-16 11:50:37,031 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 207 remaining) [2022-11-16 11:50:37,031 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 207 remaining) [2022-11-16 11:50:37,031 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 207 remaining) [2022-11-16 11:50:37,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 207 remaining) [2022-11-16 11:50:37,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 207 remaining) [2022-11-16 11:50:37,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (74 of 207 remaining) [2022-11-16 11:50:37,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (73 of 207 remaining) [2022-11-16 11:50:37,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (72 of 207 remaining) [2022-11-16 11:50:37,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (71 of 207 remaining) [2022-11-16 11:50:37,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (70 of 207 remaining) [2022-11-16 11:50:37,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (69 of 207 remaining) [2022-11-16 11:50:37,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (68 of 207 remaining) [2022-11-16 11:50:37,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (67 of 207 remaining) [2022-11-16 11:50:37,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (66 of 207 remaining) [2022-11-16 11:50:37,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (65 of 207 remaining) [2022-11-16 11:50:37,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (64 of 207 remaining) [2022-11-16 11:50:37,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (63 of 207 remaining) [2022-11-16 11:50:37,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (62 of 207 remaining) [2022-11-16 11:50:37,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (61 of 207 remaining) [2022-11-16 11:50:37,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (60 of 207 remaining) [2022-11-16 11:50:37,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (59 of 207 remaining) [2022-11-16 11:50:37,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (58 of 207 remaining) [2022-11-16 11:50:37,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (57 of 207 remaining) [2022-11-16 11:50:37,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (56 of 207 remaining) [2022-11-16 11:50:37,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (55 of 207 remaining) [2022-11-16 11:50:37,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (54 of 207 remaining) [2022-11-16 11:50:37,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (53 of 207 remaining) [2022-11-16 11:50:37,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (52 of 207 remaining) [2022-11-16 11:50:37,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (51 of 207 remaining) [2022-11-16 11:50:37,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (50 of 207 remaining) [2022-11-16 11:50:37,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (49 of 207 remaining) [2022-11-16 11:50:37,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (48 of 207 remaining) [2022-11-16 11:50:37,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (47 of 207 remaining) [2022-11-16 11:50:37,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (46 of 207 remaining) [2022-11-16 11:50:37,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (45 of 207 remaining) [2022-11-16 11:50:37,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (44 of 207 remaining) [2022-11-16 11:50:37,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 207 remaining) [2022-11-16 11:50:37,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 207 remaining) [2022-11-16 11:50:37,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 207 remaining) [2022-11-16 11:50:37,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 207 remaining) [2022-11-16 11:50:37,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 207 remaining) [2022-11-16 11:50:37,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 207 remaining) [2022-11-16 11:50:37,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 207 remaining) [2022-11-16 11:50:37,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 207 remaining) [2022-11-16 11:50:37,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (35 of 207 remaining) [2022-11-16 11:50:37,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 207 remaining) [2022-11-16 11:50:37,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (33 of 207 remaining) [2022-11-16 11:50:37,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (32 of 207 remaining) [2022-11-16 11:50:37,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 207 remaining) [2022-11-16 11:50:37,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 207 remaining) [2022-11-16 11:50:37,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 207 remaining) [2022-11-16 11:50:37,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (28 of 207 remaining) [2022-11-16 11:50:37,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (27 of 207 remaining) [2022-11-16 11:50:37,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (26 of 207 remaining) [2022-11-16 11:50:37,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (25 of 207 remaining) [2022-11-16 11:50:37,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (24 of 207 remaining) [2022-11-16 11:50:37,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (23 of 207 remaining) [2022-11-16 11:50:37,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 207 remaining) [2022-11-16 11:50:37,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 207 remaining) [2022-11-16 11:50:37,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 207 remaining) [2022-11-16 11:50:37,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 207 remaining) [2022-11-16 11:50:37,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 207 remaining) [2022-11-16 11:50:37,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 207 remaining) [2022-11-16 11:50:37,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 207 remaining) [2022-11-16 11:50:37,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 207 remaining) [2022-11-16 11:50:37,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 207 remaining) [2022-11-16 11:50:37,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 207 remaining) [2022-11-16 11:50:37,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 207 remaining) [2022-11-16 11:50:37,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 207 remaining) [2022-11-16 11:50:37,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 207 remaining) [2022-11-16 11:50:37,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (9 of 207 remaining) [2022-11-16 11:50:37,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (8 of 207 remaining) [2022-11-16 11:50:37,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (7 of 207 remaining) [2022-11-16 11:50:37,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (6 of 207 remaining) [2022-11-16 11:50:37,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (5 of 207 remaining) [2022-11-16 11:50:37,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (4 of 207 remaining) [2022-11-16 11:50:37,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (3 of 207 remaining) [2022-11-16 11:50:37,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (2 of 207 remaining) [2022-11-16 11:50:37,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (1 of 207 remaining) [2022-11-16 11:50:37,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (0 of 207 remaining) [2022-11-16 11:50:37,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:50:37,052 INFO L444 BasicCegarLoop]: Path program 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] [2022-11-16 11:50:37,068 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:50:37,068 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:50:37,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:50:37 BasicIcfg [2022-11-16 11:50:37,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:50:37,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:50:37,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:50:37,080 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:50:37,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:50:10" (3/4) ... [2022-11-16 11:50:37,086 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:50:37,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 11:50:37,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 11:50:37,095 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-16 11:50:37,118 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-16 11:50:37,118 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 11:50:37,119 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 11:50:37,120 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:50:37,220 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:50:37,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:50:37,222 INFO L158 Benchmark]: Toolchain (without parser) took 31013.02ms. Allocated memory was 98.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 64.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,223 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:50:37,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.32ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 70.2MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.33ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 65.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,225 INFO L158 Benchmark]: Boogie Preprocessor took 134.49ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 61.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,225 INFO L158 Benchmark]: RCFGBuilder took 3485.15ms. Allocated memory was 98.6MB in the beginning and 184.5MB in the end (delta: 86.0MB). Free memory was 61.2MB in the beginning and 108.2MB in the end (delta: -47.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,226 INFO L158 Benchmark]: TraceAbstraction took 26596.92ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 108.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 667.6MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,226 INFO L158 Benchmark]: Witness Printer took 141.19ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:50:37,236 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.22ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.32ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 70.2MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.33ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 65.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.49ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 61.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3485.15ms. Allocated memory was 98.6MB in the beginning and 184.5MB in the end (delta: 86.0MB). Free memory was 61.2MB in the beginning and 108.2MB in the end (delta: -47.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26596.92ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 108.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 667.6MB. Max. memory is 16.1GB. * Witness Printer took 141.19ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 107]: 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: 107]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: 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: 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: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: 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: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: 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: 143]: 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: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 578 locations, 207 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: 26.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 230 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=0, InterpolantAutomatonStates: 90, 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.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3513 NumberOfCodeBlocks, 3513 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3487 ConstructedInterpolants, 0 QuantifiedInterpolants, 3889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 116 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 11:50:37,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_187134af-2f25-44b9-be4e-40cc518055f3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE