./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:57:04,633 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:57:04,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:57:04,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:57:04,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:57:04,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:57:04,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:57:04,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:57:04,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:57:04,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:57:04,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:57:04,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:57:04,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:57:04,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:57:04,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:57:04,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:57:04,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:57:04,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:57:04,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:57:04,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:57:04,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:57:04,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:57:04,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:57:04,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:57:04,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:57:04,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:57:04,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:57:04,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:57:04,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:57:04,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:57:04,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:57:04,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:57:04,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:57:04,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:57:04,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:57:04,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:57:04,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:57:04,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:57:04,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:57:04,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:57:04,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:57:04,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2022-11-02 20:57:04,785 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:57:04,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:57:04,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:57:04,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:57:04,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:57:04,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:57:04,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:57:04,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:57:04,788 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:57:04,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:57:04,789 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:57:04,790 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-11-02 20:57:04,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:57:04,790 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:57:04,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:57:04,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:57:04,791 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:57:04,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:57:04,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:57:04,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:57:04,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:57:04,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:57:04,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:57:04,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:57:04,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:57:04,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:57:04,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:57:04,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:57:04,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:57:04,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:57:04,795 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_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494
[2022-11-02 20:57:05,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:57:05,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:57:05,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:57:05,102 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:57:05,102 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:57:05,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c
[2022-11-02 20:57:05,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/data/381e2735b/28271c3119d34205b0bae555c43af6ff/FLAG0d12f1755
[2022-11-02 20:57:05,745 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:57:05,746 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c
[2022-11-02 20:57:05,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/data/381e2735b/28271c3119d34205b0bae555c43af6ff/FLAG0d12f1755
[2022-11-02 20:57:06,093 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/data/381e2735b/28271c3119d34205b0bae555c43af6ff
[2022-11-02 20:57:06,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:57:06,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:57:06,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:57:06,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:57:06,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:57:06,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ae2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06, skipping insertion in model container
[2022-11-02 20:57:06,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:57:06,144 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:57:06,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174]
[2022-11-02 20:57:06,420 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:57:06,427 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:57:06,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174]
[2022-11-02 20:57:06,476 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:57:06,491 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:57:06,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06 WrapperNode
[2022-11-02 20:57:06,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:57:06,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:57:06,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:57:06,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:57:06,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,557 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 758
[2022-11-02 20:57:06,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:57:06,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:57:06,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:57:06,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:57:06,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,620 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:57:06,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:57:06,645 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:57:06,645 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:57:06,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (1/1) ...
[2022-11-02 20:57:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:57:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:57:06,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:57:06,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:57:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:57:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-02 20:57:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 20:57:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-02 20:57:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2022-11-02 20:57:06,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2022-11-02 20:57:06,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2022-11-02 20:57:06,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2022-11-02 20:57:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2022-11-02 20:57:06,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2022-11-02 20:57:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:57:06,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-02 20:57:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-02 20:57:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-11-02 20:57:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:57:06,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:57:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-02 20:57:06,737 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-11-02 20:57:06,954 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:57:06,965 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:57:08,122 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:57:09,031 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:57:09,031 INFO L300 CfgBuilder]: Removed 6 assume(true) statements.
[2022-11-02 20:57:09,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09 BoogieIcfgContainer
[2022-11-02 20:57:09,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:57:09,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:57:09,044 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:57:09,048 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:57:09,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:06" (1/3) ...
[2022-11-02 20:57:09,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ad94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:09, skipping insertion in model container
[2022-11-02 20:57:09,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:06" (2/3) ...
[2022-11-02 20:57:09,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ad94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:09, skipping insertion in model container
[2022-11-02 20:57:09,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09" (3/3) ...
[2022-11-02 20:57:09,051 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c
[2022-11-02 20:57:09,064 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-11-02 20:57:09,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:57:09,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 128 error locations.
[2022-11-02 20:57:09,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-02 20:57:09,340 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2022-11-02 20:57:09,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 509 places, 526 transitions, 1076 flow
[2022-11-02 20:57:09,688 INFO L130 PetriNetUnfolder]: 27/523 cut-off events.
[2022-11-02 20:57:09,688 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-11-02 20:57:09,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 523 events. 27/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1026 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 433. Up to 6 conditions per place.
[2022-11-02 20:57:09,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 509 places, 526 transitions, 1076 flow
[2022-11-02 20:57:09,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 503 transitions, 1024 flow
[2022-11-02 20:57:09,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:57:09,742 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;@4ac95e0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:57:09,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 231 error locations.
[2022-11-02 20:57:09,752 INFO L130 PetriNetUnfolder]: 0/36 cut-off events.
[2022-11-02 20:57:09,752 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:57:09,752 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:09,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:09,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -28051272, now seen corresponding path program 1 times
[2022-11-02 20:57:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:09,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087744562]
[2022-11-02 20:57:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:10,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087744562]
[2022-11-02 20:57:10,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087744562] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:10,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:10,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417057419]
[2022-11-02 20:57:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:10,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:10,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:10,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:10,117 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:10,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 503 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:10,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:10,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:10,363 INFO L130 PetriNetUnfolder]: 30/414 cut-off events.
[2022-11-02 20:57:10,364 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES.
[2022-11-02 20:57:10,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 414 events. 30/414 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 381 event pairs, 0 based on Foata normal form. 18/373 useless extension candidates. Maximal degree in co-relation 373. Up to 36 conditions per place.
[2022-11-02 20:57:10,370 INFO L137 encePairwiseOnDemand]: 419/526 looper letters, 19 selfloop transitions, 2 changer transitions 6/398 dead transitions.
[2022-11-02 20:57:10,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 398 transitions, 856 flow
[2022-11-02 20:57:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions.
[2022-11-02 20:57:10,391 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8346007604562737
[2022-11-02 20:57:10,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1317 transitions.
[2022-11-02 20:57:10,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1317 transitions.
[2022-11-02 20:57:10,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:10,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1317 transitions.
[2022-11-02 20:57:10,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.0) internal successors, (1317), 3 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,421 INFO L175 Difference]: Start difference. First operand has 487 places, 503 transitions, 1024 flow. Second operand 3 states and 1317 transitions.
[2022-11-02 20:57:10,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 398 transitions, 856 flow
[2022-11-02 20:57:10,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 398 transitions, 844 flow, removed 0 selfloop flow, removed 6 redundant places.
[2022-11-02 20:57:10,438 INFO L231 Difference]: Finished difference. Result has 390 places, 392 transitions, 794 flow
[2022-11-02 20:57:10,441 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=390, PETRI_TRANSITIONS=392}
[2022-11-02 20:57:10,445 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -97 predicate places.
[2022-11-02 20:57:10,445 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 392 transitions, 794 flow
[2022-11-02 20:57:10,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,447 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:10,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:10,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:57:10,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 201706705, now seen corresponding path program 1 times
[2022-11-02 20:57:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090285623]
[2022-11-02 20:57:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:10,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090285623]
[2022-11-02 20:57:10,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090285623] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:10,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:10,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131547352]
[2022-11-02 20:57:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:10,528 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:10,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 392 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:10,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:10,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:10,712 INFO L130 PetriNetUnfolder]: 30/407 cut-off events.
[2022-11-02 20:57:10,712 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-11-02 20:57:10,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 407 events. 30/407 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 365 event pairs, 0 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 409. Up to 37 conditions per place.
[2022-11-02 20:57:10,716 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/391 dead transitions.
[2022-11-02 20:57:10,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 391 transitions, 836 flow
[2022-11-02 20:57:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:10,721 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:10,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:10,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:10,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:10,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:10,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,731 INFO L175 Difference]: Start difference. First operand has 390 places, 392 transitions, 794 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:10,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 391 transitions, 836 flow
[2022-11-02 20:57:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 391 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:10,741 INFO L231 Difference]: Finished difference. Result has 383 places, 391 transitions, 792 flow
[2022-11-02 20:57:10,742 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=383, PETRI_TRANSITIONS=391}
[2022-11-02 20:57:10,744 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -104 predicate places.
[2022-11-02 20:57:10,744 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 391 transitions, 792 flow
[2022-11-02 20:57:10,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,745 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:10,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:10,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:57:10,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:10,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1340319877, now seen corresponding path program 1 times
[2022-11-02 20:57:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:10,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495693032]
[2022-11-02 20:57:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:10,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495693032]
[2022-11-02 20:57:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495693032] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:10,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287942544]
[2022-11-02 20:57:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:10,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:10,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:10,878 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:10,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 391 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:10,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:10,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:11,045 INFO L130 PetriNetUnfolder]: 30/406 cut-off events.
[2022-11-02 20:57:11,047 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-11-02 20:57:11,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 406 events. 30/406 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 370 event pairs, 0 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 401. Up to 37 conditions per place.
[2022-11-02 20:57:11,051 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/390 dead transitions.
[2022-11-02 20:57:11,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 390 transitions, 834 flow
[2022-11-02 20:57:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:11,057 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:11,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:11,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:11,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:11,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:11,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,067 INFO L175 Difference]: Start difference. First operand has 383 places, 391 transitions, 792 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 390 transitions, 834 flow
[2022-11-02 20:57:11,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:11,076 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 790 flow
[2022-11-02 20:57:11,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=382, PETRI_TRANSITIONS=390}
[2022-11-02 20:57:11,080 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places.
[2022-11-02 20:57:11,080 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 790 flow
[2022-11-02 20:57:11,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,081 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:11,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:57:11,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -249834534, now seen corresponding path program 1 times
[2022-11-02 20:57:11,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:11,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311600323]
[2022-11-02 20:57:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:11,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311600323]
[2022-11-02 20:57:11,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311600323] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:11,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:11,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152706530]
[2022-11-02 20:57:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:11,189 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:11,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:11,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:11,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:11,404 INFO L130 PetriNetUnfolder]: 56/531 cut-off events.
[2022-11-02 20:57:11,404 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES.
[2022-11-02 20:57:11,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 531 events. 56/531 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 947 event pairs, 0 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 545. Up to 38 conditions per place.
[2022-11-02 20:57:11,410 INFO L137 encePairwiseOnDemand]: 522/526 looper letters, 28 selfloop transitions, 3 changer transitions 0/402 dead transitions.
[2022-11-02 20:57:11,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 402 transitions, 881 flow
[2022-11-02 20:57:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions.
[2022-11-02 20:57:11,415 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7807351077313055
[2022-11-02 20:57:11,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1232 transitions.
[2022-11-02 20:57:11,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1232 transitions.
[2022-11-02 20:57:11,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:11,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1232 transitions.
[2022-11-02 20:57:11,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.6666666666667) internal successors, (1232), 3 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,430 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 790 flow. Second operand 3 states and 1232 transitions.
[2022-11-02 20:57:11,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 402 transitions, 881 flow
[2022-11-02 20:57:11,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 402 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:11,441 INFO L231 Difference]: Finished difference. Result has 382 places, 391 transitions, 801 flow
[2022-11-02 20:57:11,443 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=382, PETRI_TRANSITIONS=391}
[2022-11-02 20:57:11,445 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places.
[2022-11-02 20:57:11,445 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 391 transitions, 801 flow
[2022-11-02 20:57:11,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,446 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:11,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:57:11,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1717239114, now seen corresponding path program 1 times
[2022-11-02 20:57:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:11,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796736445]
[2022-11-02 20:57:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796736445]
[2022-11-02 20:57:11,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796736445] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:11,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641889984]
[2022-11-02 20:57:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:11,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:11,496 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:11,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 391 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:11,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:11,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:11,678 INFO L130 PetriNetUnfolder]: 56/524 cut-off events.
[2022-11-02 20:57:11,678 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2022-11-02 20:57:11,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 524 events. 56/524 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 911 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 376. Up to 63 conditions per place.
[2022-11-02 20:57:11,684 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 19 selfloop transitions, 2 changer transitions 0/390 dead transitions.
[2022-11-02 20:57:11,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 390 transitions, 841 flow
[2022-11-02 20:57:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:11,688 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:11,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:11,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:11,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:11,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:11,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,697 INFO L175 Difference]: Start difference. First operand has 382 places, 391 transitions, 801 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:11,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 390 transitions, 841 flow
[2022-11-02 20:57:11,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:11,706 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 800 flow
[2022-11-02 20:57:11,707 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=382, PETRI_TRANSITIONS=390}
[2022-11-02 20:57:11,710 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places.
[2022-11-02 20:57:11,711 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 800 flow
[2022-11-02 20:57:11,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,712 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:11,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:11,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:57:11,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -912562332, now seen corresponding path program 1 times
[2022-11-02 20:57:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:11,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438086605]
[2022-11-02 20:57:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:11,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:11,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438086605]
[2022-11-02 20:57:11,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438086605] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:11,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:11,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132373063]
[2022-11-02 20:57:11,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:11,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:11,762 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:11,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:11,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:11,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:11,929 INFO L130 PetriNetUnfolder]: 56/523 cut-off events.
[2022-11-02 20:57:11,930 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES.
[2022-11-02 20:57:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 523 events. 56/523 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 917 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 542. Up to 61 conditions per place.
[2022-11-02 20:57:11,935 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 19 selfloop transitions, 1 changer transitions 0/389 dead transitions.
[2022-11-02 20:57:11,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 389 transitions, 838 flow
[2022-11-02 20:57:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions.
[2022-11-02 20:57:11,939 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926
[2022-11-02 20:57:11,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:11,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:11,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:11,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:11,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,948 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 800 flow. Second operand 3 states and 1219 transitions.
[2022-11-02 20:57:11,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 389 transitions, 838 flow
[2022-11-02 20:57:11,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 389 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:11,956 INFO L231 Difference]: Finished difference. Result has 381 places, 389 transitions, 796 flow
[2022-11-02 20:57:11,957 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=389}
[2022-11-02 20:57:11,958 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places.
[2022-11-02 20:57:11,958 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 389 transitions, 796 flow
[2022-11-02 20:57:11,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:11,960 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:11,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:11,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:57:11,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1403488935, now seen corresponding path program 1 times
[2022-11-02 20:57:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:11,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980507234]
[2022-11-02 20:57:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:11,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980507234]
[2022-11-02 20:57:12,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980507234] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:12,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893891907]
[2022-11-02 20:57:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:12,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:12,020 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:12,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:12,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:12,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:12,179 INFO L130 PetriNetUnfolder]: 56/522 cut-off events.
[2022-11-02 20:57:12,179 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES.
[2022-11-02 20:57:12,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 522 events. 56/522 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 908 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 542. Up to 63 conditions per place.
[2022-11-02 20:57:12,185 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 19 selfloop transitions, 2 changer transitions 0/388 dead transitions.
[2022-11-02 20:57:12,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 388 transitions, 836 flow
[2022-11-02 20:57:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:12,189 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:12,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:12,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:12,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:12,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:12,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,198 INFO L175 Difference]: Start difference. First operand has 381 places, 389 transitions, 796 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:12,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 388 transitions, 836 flow
[2022-11-02 20:57:12,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 388 transitions, 835 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:12,208 INFO L231 Difference]: Finished difference. Result has 381 places, 388 transitions, 797 flow
[2022-11-02 20:57:12,208 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=381, PETRI_TRANSITIONS=388}
[2022-11-02 20:57:12,209 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places.
[2022-11-02 20:57:12,209 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 388 transitions, 797 flow
[2022-11-02 20:57:12,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,210 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:12,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:12,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:57:12,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 322034131, now seen corresponding path program 1 times
[2022-11-02 20:57:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:12,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637290122]
[2022-11-02 20:57:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637290122]
[2022-11-02 20:57:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637290122] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:12,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:57:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174050289]
[2022-11-02 20:57:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:57:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:57:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:57:12,830 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 526
[2022-11-02 20:57:12,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 388 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:12,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:12,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 526
[2022-11-02 20:57:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:13,247 INFO L130 PetriNetUnfolder]: 224/687 cut-off events.
[2022-11-02 20:57:13,248 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES.
[2022-11-02 20:57:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 687 events. 224/687 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1158 event pairs, 8 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 981. Up to 297 conditions per place.
[2022-11-02 20:57:13,257 INFO L137 encePairwiseOnDemand]: 508/526 looper letters, 67 selfloop transitions, 15 changer transitions 0/385 dead transitions.
[2022-11-02 20:57:13,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 955 flow
[2022-11-02 20:57:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:57:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-11-02 20:57:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2105 transitions.
[2022-11-02 20:57:13,263 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6669835234474017
[2022-11-02 20:57:13,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2105 transitions.
[2022-11-02 20:57:13,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2105 transitions.
[2022-11-02 20:57:13,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:13,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2105 transitions.
[2022-11-02 20:57:13,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,282 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,282 INFO L175 Difference]: Start difference. First operand has 381 places, 388 transitions, 797 flow. Second operand 6 states and 2105 transitions.
[2022-11-02 20:57:13,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 955 flow
[2022-11-02 20:57:13,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 385 transitions, 951 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:13,290 INFO L231 Difference]: Finished difference. Result has 381 places, 385 transitions, 817 flow
[2022-11-02 20:57:13,291 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=817, PETRI_PLACES=381, PETRI_TRANSITIONS=385}
[2022-11-02 20:57:13,292 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places.
[2022-11-02 20:57:13,292 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 385 transitions, 817 flow
[2022-11-02 20:57:13,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,294 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:13,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:13,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:57:13,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1722357620, now seen corresponding path program 1 times
[2022-11-02 20:57:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:13,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735701944]
[2022-11-02 20:57:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735701944]
[2022-11-02 20:57:13,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735701944] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:13,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:13,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938200108]
[2022-11-02 20:57:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:13,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:13,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:13,339 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:13,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 385 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:13,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:13,498 INFO L130 PetriNetUnfolder]: 56/518 cut-off events.
[2022-11-02 20:57:13,499 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES.
[2022-11-02 20:57:13,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 518 events. 56/518 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 890 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 574. Up to 66 conditions per place.
[2022-11-02 20:57:13,504 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 22 selfloop transitions, 2 changer transitions 0/384 dead transitions.
[2022-11-02 20:57:13,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 384 transitions, 863 flow
[2022-11-02 20:57:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:13,508 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:13,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:13,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:13,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:13,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:13,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,517 INFO L175 Difference]: Start difference. First operand has 381 places, 385 transitions, 817 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:13,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 384 transitions, 863 flow
[2022-11-02 20:57:13,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 384 transitions, 833 flow, removed 0 selfloop flow, removed 5 redundant places.
[2022-11-02 20:57:13,526 INFO L231 Difference]: Finished difference. Result has 377 places, 384 transitions, 789 flow
[2022-11-02 20:57:13,526 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=377, PETRI_TRANSITIONS=384}
[2022-11-02 20:57:13,527 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places.
[2022-11-02 20:57:13,527 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 384 transitions, 789 flow
[2022-11-02 20:57:13,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,528 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:13,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:13,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:57:13,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 951579929, now seen corresponding path program 1 times
[2022-11-02 20:57:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:13,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143718309]
[2022-11-02 20:57:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143718309]
[2022-11-02 20:57:13,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143718309] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:13,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:13,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316238832]
[2022-11-02 20:57:13,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:13,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:13,584 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:13,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 384 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:13,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:13,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:13,819 INFO L130 PetriNetUnfolder]: 88/653 cut-off events.
[2022-11-02 20:57:13,819 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES.
[2022-11-02 20:57:13,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 653 events. 88/653 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1553 event pairs, 2 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 713. Up to 55 conditions per place.
[2022-11-02 20:57:13,828 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 31 selfloop transitions, 2 changer transitions 0/396 dead transitions.
[2022-11-02 20:57:13,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 396 transitions, 890 flow
[2022-11-02 20:57:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions.
[2022-11-02 20:57:13,833 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.779467680608365
[2022-11-02 20:57:13,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:13,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:13,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:13,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:13,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,842 INFO L175 Difference]: Start difference. First operand has 377 places, 384 transitions, 789 flow. Second operand 3 states and 1230 transitions.
[2022-11-02 20:57:13,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 396 transitions, 890 flow
[2022-11-02 20:57:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 396 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:13,852 INFO L231 Difference]: Finished difference. Result has 377 places, 384 transitions, 793 flow
[2022-11-02 20:57:13,853 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=377, PETRI_TRANSITIONS=384}
[2022-11-02 20:57:13,855 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places.
[2022-11-02 20:57:13,855 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 384 transitions, 793 flow
[2022-11-02 20:57:13,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,856 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:13,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:13,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-11-02 20:57:13,857 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2016954237, now seen corresponding path program 1 times
[2022-11-02 20:57:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:13,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79729723]
[2022-11-02 20:57:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:13,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79729723]
[2022-11-02 20:57:13,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79729723] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:13,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:13,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731678168]
[2022-11-02 20:57:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:13,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:13,912 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:13,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 384 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:13,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:13,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:13,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:14,102 INFO L130 PetriNetUnfolder]: 84/620 cut-off events.
[2022-11-02 20:57:14,102 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES.
[2022-11-02 20:57:14,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 620 events. 84/620 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1380 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 697. Up to 97 conditions per place.
[2022-11-02 20:57:14,109 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/383 dead transitions.
[2022-11-02 20:57:14,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 383 transitions, 835 flow
[2022-11-02 20:57:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:14,113 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:14,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:14,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:14,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:14,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:14,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,121 INFO L175 Difference]: Start difference. First operand has 377 places, 384 transitions, 793 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:14,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 383 transitions, 835 flow
[2022-11-02 20:57:14,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:14,129 INFO L231 Difference]: Finished difference. Result has 377 places, 383 transitions, 793 flow
[2022-11-02 20:57:14,130 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=377, PETRI_TRANSITIONS=383}
[2022-11-02 20:57:14,131 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places.
[2022-11-02 20:57:14,131 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 383 transitions, 793 flow
[2022-11-02 20:57:14,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,131 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:14,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-02 20:57:14,132 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1650701851, now seen corresponding path program 1 times
[2022-11-02 20:57:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:14,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878373340]
[2022-11-02 20:57:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:14,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878373340]
[2022-11-02 20:57:14,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878373340] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:14,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:14,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758627124]
[2022-11-02 20:57:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:14,204 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:14,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 383 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:14,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:14,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:14,389 INFO L130 PetriNetUnfolder]: 84/619 cut-off events.
[2022-11-02 20:57:14,389 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES.
[2022-11-02 20:57:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 619 events. 84/619 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1363 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 695. Up to 100 conditions per place.
[2022-11-02 20:57:14,397 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 23 selfloop transitions, 2 changer transitions 0/382 dead transitions.
[2022-11-02 20:57:14,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 841 flow
[2022-11-02 20:57:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:14,401 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:14,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:14,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:14,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:14,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,409 INFO L175 Difference]: Start difference. First operand has 377 places, 383 transitions, 793 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:14,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 841 flow
[2022-11-02 20:57:14,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:14,417 INFO L231 Difference]: Finished difference. Result has 376 places, 382 transitions, 791 flow
[2022-11-02 20:57:14,418 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=376, PETRI_TRANSITIONS=382}
[2022-11-02 20:57:14,420 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -111 predicate places.
[2022-11-02 20:57:14,420 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 382 transitions, 791 flow
[2022-11-02 20:57:14,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,421 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:14,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-02 20:57:14,422 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2067801765, now seen corresponding path program 1 times
[2022-11-02 20:57:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:14,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613423745]
[2022-11-02 20:57:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:14,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613423745]
[2022-11-02 20:57:14,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613423745] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:14,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:14,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815629051]
[2022-11-02 20:57:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:14,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:14,472 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:14,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 382 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:14,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:14,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:14,646 INFO L130 PetriNetUnfolder]: 84/618 cut-off events.
[2022-11-02 20:57:14,647 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES.
[2022-11-02 20:57:14,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 618 events. 84/618 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1369 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 691. Up to 95 conditions per place.
[2022-11-02 20:57:14,654 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 20 selfloop transitions, 1 changer transitions 0/381 dead transitions.
[2022-11-02 20:57:14,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 381 transitions, 831 flow
[2022-11-02 20:57:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions.
[2022-11-02 20:57:14,659 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926
[2022-11-02 20:57:14,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:14,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:14,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:14,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:14,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,667 INFO L175 Difference]: Start difference. First operand has 376 places, 382 transitions, 791 flow. Second operand 3 states and 1219 transitions.
[2022-11-02 20:57:14,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 381 transitions, 831 flow
[2022-11-02 20:57:14,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:14,677 INFO L231 Difference]: Finished difference. Result has 375 places, 381 transitions, 787 flow
[2022-11-02 20:57:14,678 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=375, PETRI_TRANSITIONS=381}
[2022-11-02 20:57:14,679 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -112 predicate places.
[2022-11-02 20:57:14,679 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 381 transitions, 787 flow
[2022-11-02 20:57:14,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,680 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:14,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-02 20:57:14,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1042232666, now seen corresponding path program 1 times
[2022-11-02 20:57:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368734345]
[2022-11-02 20:57:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368734345]
[2022-11-02 20:57:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368734345] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:14,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578739029]
[2022-11-02 20:57:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:14,761 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:14,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 381 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:14,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:14,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:14,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:14,997 INFO L130 PetriNetUnfolder]: 84/617 cut-off events.
[2022-11-02 20:57:14,997 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES.
[2022-11-02 20:57:15,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 617 events. 84/617 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1364 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 689. Up to 97 conditions per place.
[2022-11-02 20:57:15,005 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/380 dead transitions.
[2022-11-02 20:57:15,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 380 transitions, 829 flow
[2022-11-02 20:57:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:15,010 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:15,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:15,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:15,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:15,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:15,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,019 INFO L175 Difference]: Start difference. First operand has 375 places, 381 transitions, 787 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:15,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 380 transitions, 829 flow
[2022-11-02 20:57:15,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:15,029 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 788 flow
[2022-11-02 20:57:15,029 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=375, PETRI_TRANSITIONS=380}
[2022-11-02 20:57:15,030 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -112 predicate places.
[2022-11-02 20:57:15,030 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 788 flow
[2022-11-02 20:57:15,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,031 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:15,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:15,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-02 20:57:15,032 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -357183376, now seen corresponding path program 1 times
[2022-11-02 20:57:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:15,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089166404]
[2022-11-02 20:57:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:15,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089166404]
[2022-11-02 20:57:15,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089166404] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:15,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:15,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951613772]
[2022-11-02 20:57:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:15,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:15,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:15,106 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:15,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:15,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:15,300 INFO L130 PetriNetUnfolder]: 84/616 cut-off events.
[2022-11-02 20:57:15,300 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES.
[2022-11-02 20:57:15,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 616 events. 84/616 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1377 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 693. Up to 100 conditions per place.
[2022-11-02 20:57:15,308 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 23 selfloop transitions, 2 changer transitions 0/379 dead transitions.
[2022-11-02 20:57:15,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 836 flow
[2022-11-02 20:57:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:15,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:15,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:15,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:15,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:15,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:15,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,320 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 788 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:15,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 836 flow
[2022-11-02 20:57:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:15,328 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 786 flow
[2022-11-02 20:57:15,329 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=379}
[2022-11-02 20:57:15,330 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places.
[2022-11-02 20:57:15,330 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 786 flow
[2022-11-02 20:57:15,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,331 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:15,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-02 20:57:15,331 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 101816433, now seen corresponding path program 1 times
[2022-11-02 20:57:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:15,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882761881]
[2022-11-02 20:57:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:15,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-02 20:57:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882761881]
[2022-11-02 20:57:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882761881] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:15,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968299514]
[2022-11-02 20:57:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:15,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:15,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:15,391 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:15,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:15,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:15,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:15,684 INFO L130 PetriNetUnfolder]: 158/901 cut-off events.
[2022-11-02 20:57:15,684 INFO L131 PetriNetUnfolder]: For 77/81 co-relation queries the response was YES.
[2022-11-02 20:57:15,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 901 events. 158/901 cut-off events. For 77/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3132 event pairs, 7 based on Foata normal form. 4/774 useless extension candidates. Maximal degree in co-relation 1083. Up to 95 conditions per place.
[2022-11-02 20:57:15,707 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 34 selfloop transitions, 2 changer transitions 0/393 dead transitions.
[2022-11-02 20:57:15,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 393 transitions, 902 flow
[2022-11-02 20:57:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions.
[2022-11-02 20:57:15,711 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7801013941698353
[2022-11-02 20:57:15,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:15,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:15,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:15,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:15,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,720 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 786 flow. Second operand 3 states and 1231 transitions.
[2022-11-02 20:57:15,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 393 transitions, 902 flow
[2022-11-02 20:57:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 393 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:15,728 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 790 flow
[2022-11-02 20:57:15,729 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=374, PETRI_TRANSITIONS=379}
[2022-11-02 20:57:15,729 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places.
[2022-11-02 20:57:15,731 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 790 flow
[2022-11-02 20:57:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,732 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:15,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-11-02 20:57:15,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash -34860140, now seen corresponding path program 1 times
[2022-11-02 20:57:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:15,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267810033]
[2022-11-02 20:57:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267810033]
[2022-11-02 20:57:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267810033] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:15,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6394134]
[2022-11-02 20:57:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:15,801 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:15,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:15,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:15,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:16,083 INFO L130 PetriNetUnfolder]: 156/884 cut-off events.
[2022-11-02 20:57:16,083 INFO L131 PetriNetUnfolder]: For 97/99 co-relation queries the response was YES.
[2022-11-02 20:57:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 884 events. 156/884 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3024 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1095. Up to 179 conditions per place.
[2022-11-02 20:57:16,097 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/378 dead transitions.
[2022-11-02 20:57:16,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 834 flow
[2022-11-02 20:57:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:16,101 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:16,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:16,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:16,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:16,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:16,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,109 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 790 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:16,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 834 flow
[2022-11-02 20:57:16,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 378 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:16,118 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 790 flow
[2022-11-02 20:57:16,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=374, PETRI_TRANSITIONS=378}
[2022-11-02 20:57:16,119 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places.
[2022-11-02 20:57:16,119 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 790 flow
[2022-11-02 20:57:16,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,120 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:16,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:16,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-02 20:57:16,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1302133528, now seen corresponding path program 1 times
[2022-11-02 20:57:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:16,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364024398]
[2022-11-02 20:57:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364024398]
[2022-11-02 20:57:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364024398] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:16,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:16,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814548728]
[2022-11-02 20:57:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:16,213 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526
[2022-11-02 20:57:16,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:16,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526
[2022-11-02 20:57:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:16,490 INFO L130 PetriNetUnfolder]: 156/883 cut-off events.
[2022-11-02 20:57:16,491 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2022-11-02 20:57:16,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 883 events. 156/883 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3032 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1089. Up to 182 conditions per place.
[2022-11-02 20:57:16,503 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions.
[2022-11-02 20:57:16,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 840 flow
[2022-11-02 20:57:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions.
[2022-11-02 20:57:16,507 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415
[2022-11-02 20:57:16,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:16,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:16,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:16,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions.
[2022-11-02 20:57:16,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,515 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 790 flow. Second operand 3 states and 1214 transitions.
[2022-11-02 20:57:16,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 377 transitions, 840 flow
[2022-11-02 20:57:16,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 377 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:16,522 INFO L231 Difference]: Finished difference. Result has 373 places, 377 transitions, 788 flow
[2022-11-02 20:57:16,523 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=373, PETRI_TRANSITIONS=377}
[2022-11-02 20:57:16,523 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -114 predicate places.
[2022-11-02 20:57:16,524 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 377 transitions, 788 flow
[2022-11-02 20:57:16,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,524 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:16,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:16,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-02 20:57:16,525 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash -169175455, now seen corresponding path program 1 times
[2022-11-02 20:57:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:16,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072775564]
[2022-11-02 20:57:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:16,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072775564]
[2022-11-02 20:57:16,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072775564] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:16,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:16,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318660399]
[2022-11-02 20:57:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:16,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:16,601 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:16,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 377 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:16,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:16,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:16,884 INFO L130 PetriNetUnfolder]: 156/882 cut-off events.
[2022-11-02 20:57:16,884 INFO L131 PetriNetUnfolder]: For 97/99 co-relation queries the response was YES.
[2022-11-02 20:57:16,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 882 events. 156/882 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3025 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1085. Up to 177 conditions per place.
[2022-11-02 20:57:16,895 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 21 selfloop transitions, 1 changer transitions 0/376 dead transitions.
[2022-11-02 20:57:16,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 376 transitions, 830 flow
[2022-11-02 20:57:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions.
[2022-11-02 20:57:16,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926
[2022-11-02 20:57:16,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:16,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:16,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:16,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions.
[2022-11-02 20:57:16,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,905 INFO L175 Difference]: Start difference. First operand has 373 places, 377 transitions, 788 flow. Second operand 3 states and 1219 transitions.
[2022-11-02 20:57:16,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 376 transitions, 830 flow
[2022-11-02 20:57:16,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 376 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:16,913 INFO L231 Difference]: Finished difference. Result has 372 places, 376 transitions, 784 flow
[2022-11-02 20:57:16,913 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=372, PETRI_TRANSITIONS=376}
[2022-11-02 20:57:16,914 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -115 predicate places.
[2022-11-02 20:57:16,914 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 376 transitions, 784 flow
[2022-11-02 20:57:16,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,915 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:16,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:16,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-11-02 20:57:16,915 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 525353495, now seen corresponding path program 1 times
[2022-11-02 20:57:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:16,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783863824]
[2022-11-02 20:57:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:16,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783863824]
[2022-11-02 20:57:16,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783863824] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:16,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:16,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331349185]
[2022-11-02 20:57:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:16,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:16,988 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:16,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 376 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:16,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:16,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:16,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:17,249 INFO L130 PetriNetUnfolder]: 156/881 cut-off events.
[2022-11-02 20:57:17,249 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2022-11-02 20:57:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 881 events. 156/881 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3015 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1083. Up to 179 conditions per place.
[2022-11-02 20:57:17,261 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/375 dead transitions.
[2022-11-02 20:57:17,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 375 transitions, 828 flow
[2022-11-02 20:57:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:17,265 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:17,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:17,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,272 INFO L175 Difference]: Start difference. First operand has 372 places, 376 transitions, 784 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 375 transitions, 828 flow
[2022-11-02 20:57:17,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 375 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:17,280 INFO L231 Difference]: Finished difference. Result has 372 places, 375 transitions, 785 flow
[2022-11-02 20:57:17,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=372, PETRI_TRANSITIONS=375}
[2022-11-02 20:57:17,281 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -115 predicate places.
[2022-11-02 20:57:17,281 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 375 transitions, 785 flow
[2022-11-02 20:57:17,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,282 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:17,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:17,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-11-02 20:57:17,282 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1131200766, now seen corresponding path program 1 times
[2022-11-02 20:57:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:17,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395219753]
[2022-11-02 20:57:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395219753]
[2022-11-02 20:57:17,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395219753] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:17,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:17,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942334788]
[2022-11-02 20:57:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:17,364 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:17,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 375 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:17,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:17,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:17,700 INFO L130 PetriNetUnfolder]: 156/880 cut-off events.
[2022-11-02 20:57:17,700 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2022-11-02 20:57:17,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 880 events. 156/880 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3003 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1084. Up to 179 conditions per place.
[2022-11-02 20:57:17,714 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/374 dead transitions.
[2022-11-02 20:57:17,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 374 transitions, 829 flow
[2022-11-02 20:57:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:17,719 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:17,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:17,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,729 INFO L175 Difference]: Start difference. First operand has 372 places, 375 transitions, 785 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:17,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 374 transitions, 829 flow
[2022-11-02 20:57:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 374 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:17,738 INFO L231 Difference]: Finished difference. Result has 371 places, 374 transitions, 783 flow
[2022-11-02 20:57:17,739 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=371, PETRI_TRANSITIONS=374}
[2022-11-02 20:57:17,739 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -116 predicate places.
[2022-11-02 20:57:17,739 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 374 transitions, 783 flow
[2022-11-02 20:57:17,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,740 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:17,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-11-02 20:57:17,741 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 906790737, now seen corresponding path program 1 times
[2022-11-02 20:57:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944742760]
[2022-11-02 20:57:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:17,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944742760]
[2022-11-02 20:57:17,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944742760] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:17,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:17,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923375773]
[2022-11-02 20:57:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:17,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:17,822 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:17,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 374 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:17,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:17,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:17,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:18,084 INFO L130 PetriNetUnfolder]: 156/879 cut-off events.
[2022-11-02 20:57:18,084 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2022-11-02 20:57:18,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 879 events. 156/879 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3000 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1083. Up to 179 conditions per place.
[2022-11-02 20:57:18,097 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/373 dead transitions.
[2022-11-02 20:57:18,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 373 transitions, 827 flow
[2022-11-02 20:57:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions.
[2022-11-02 20:57:18,101 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628
[2022-11-02 20:57:18,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:18,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:18,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:18,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions.
[2022-11-02 20:57:18,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,108 INFO L175 Difference]: Start difference. First operand has 371 places, 374 transitions, 783 flow. Second operand 3 states and 1220 transitions.
[2022-11-02 20:57:18,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 373 transitions, 827 flow
[2022-11-02 20:57:18,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 373 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:18,114 INFO L231 Difference]: Finished difference. Result has 370 places, 373 transitions, 781 flow
[2022-11-02 20:57:18,115 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=370, PETRI_TRANSITIONS=373}
[2022-11-02 20:57:18,116 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places.
[2022-11-02 20:57:18,116 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 373 transitions, 781 flow
[2022-11-02 20:57:18,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,117 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:18,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-11-02 20:57:18,117 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -288264029, now seen corresponding path program 1 times
[2022-11-02 20:57:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516674543]
[2022-11-02 20:57:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516674543]
[2022-11-02 20:57:18,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516674543] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:18,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:18,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602543896]
[2022-11-02 20:57:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:18,216 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 526
[2022-11-02 20:57:18,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 373 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:18,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 526
[2022-11-02 20:57:18,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:18,872 INFO L130 PetriNetUnfolder]: 605/2060 cut-off events.
[2022-11-02 20:57:18,872 INFO L131 PetriNetUnfolder]: For 304/312 co-relation queries the response was YES.
[2022-11-02 20:57:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 2060 events. 605/2060 cut-off events. For 304/312 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11851 event pairs, 88 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3058. Up to 566 conditions per place.
[2022-11-02 20:57:18,903 INFO L137 encePairwiseOnDemand]: 517/526 looper letters, 31 selfloop transitions, 7 changer transitions 0/381 dead transitions.
[2022-11-02 20:57:18,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 381 transitions, 886 flow
[2022-11-02 20:57:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions.
[2022-11-02 20:57:18,907 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7718631178707225
[2022-11-02 20:57:18,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:18,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:18,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:18,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:18,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,914 INFO L175 Difference]: Start difference. First operand has 370 places, 373 transitions, 781 flow. Second operand 3 states and 1218 transitions.
[2022-11-02 20:57:18,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 381 transitions, 886 flow
[2022-11-02 20:57:18,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 381 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 20:57:18,921 INFO L231 Difference]: Finished difference. Result has 367 places, 370 transitions, 794 flow
[2022-11-02 20:57:18,922 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=367, PETRI_TRANSITIONS=370}
[2022-11-02 20:57:18,923 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places.
[2022-11-02 20:57:18,923 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 370 transitions, 794 flow
[2022-11-02 20:57:18,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:18,924 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:18,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-11-02 20:57:18,925 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash 60757476, now seen corresponding path program 1 times
[2022-11-02 20:57:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033939813]
[2022-11-02 20:57:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:19,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:19,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033939813]
[2022-11-02 20:57:19,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033939813] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:19,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:19,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719618663]
[2022-11-02 20:57:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:19,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:19,015 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:19,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 370 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:19,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:19,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:19,792 INFO L130 PetriNetUnfolder]: 722/2161 cut-off events.
[2022-11-02 20:57:19,792 INFO L131 PetriNetUnfolder]: For 1440/1484 co-relation queries the response was YES.
[2022-11-02 20:57:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 2161 events. 722/2161 cut-off events. For 1440/1484 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12323 event pairs, 34 based on Foata normal form. 10/1882 useless extension candidates. Maximal degree in co-relation 3601. Up to 668 conditions per place.
[2022-11-02 20:57:19,820 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 32 selfloop transitions, 4 changer transitions 0/382 dead transitions.
[2022-11-02 20:57:19,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 382 transitions, 924 flow
[2022-11-02 20:57:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions.
[2022-11-02 20:57:19,824 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7801013941698353
[2022-11-02 20:57:19,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:19,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:19,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions.
[2022-11-02 20:57:19,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,835 INFO L175 Difference]: Start difference. First operand has 367 places, 370 transitions, 794 flow. Second operand 3 states and 1231 transitions.
[2022-11-02 20:57:19,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 382 transitions, 924 flow
[2022-11-02 20:57:19,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 382 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:19,842 INFO L231 Difference]: Finished difference. Result has 367 places, 369 transitions, 799 flow
[2022-11-02 20:57:19,843 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=367, PETRI_TRANSITIONS=369}
[2022-11-02 20:57:19,843 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places.
[2022-11-02 20:57:19,843 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 369 transitions, 799 flow
[2022-11-02 20:57:19,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,844 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:19,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:19,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-11-02 20:57:19,846 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash 272327479, now seen corresponding path program 1 times
[2022-11-02 20:57:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:19,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920536165]
[2022-11-02 20:57:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:19,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920536165]
[2022-11-02 20:57:19,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920536165] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:19,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:19,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322472455]
[2022-11-02 20:57:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:19,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:19,933 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:19,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 369 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:19,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:19,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:20,857 INFO L130 PetriNetUnfolder]: 802/2817 cut-off events.
[2022-11-02 20:57:20,858 INFO L131 PetriNetUnfolder]: For 1844/1916 co-relation queries the response was YES.
[2022-11-02 20:57:20,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 2817 events. 802/2817 cut-off events. For 1844/1916 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20772 event pairs, 42 based on Foata normal form. 16/2376 useless extension candidates. Maximal degree in co-relation 4647. Up to 824 conditions per place.
[2022-11-02 20:57:20,894 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 31 selfloop transitions, 4 changer transitions 0/380 dead transitions.
[2022-11-02 20:57:20,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 380 transitions, 927 flow
[2022-11-02 20:57:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions.
[2022-11-02 20:57:20,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.779467680608365
[2022-11-02 20:57:20,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:20,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:20,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:20,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions.
[2022-11-02 20:57:20,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:20,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:20,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:20,905 INFO L175 Difference]: Start difference. First operand has 367 places, 369 transitions, 799 flow. Second operand 3 states and 1230 transitions.
[2022-11-02 20:57:20,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 380 transitions, 927 flow
[2022-11-02 20:57:20,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 380 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:20,913 INFO L231 Difference]: Finished difference. Result has 367 places, 368 transitions, 807 flow
[2022-11-02 20:57:20,914 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=367, PETRI_TRANSITIONS=368}
[2022-11-02 20:57:20,914 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places.
[2022-11-02 20:57:20,915 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 368 transitions, 807 flow
[2022-11-02 20:57:20,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:20,915 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:20,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:20,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-11-02 20:57:20,916 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -565680569, now seen corresponding path program 1 times
[2022-11-02 20:57:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:20,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895964817]
[2022-11-02 20:57:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:21,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895964817]
[2022-11-02 20:57:21,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895964817] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:21,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:21,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:57:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87659078]
[2022-11-02 20:57:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:21,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:57:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:57:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:57:21,668 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526
[2022-11-02 20:57:21,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 368 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:21,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:21,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526
[2022-11-02 20:57:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:23,139 INFO L130 PetriNetUnfolder]: 1392/2833 cut-off events.
[2022-11-02 20:57:23,140 INFO L131 PetriNetUnfolder]: For 4712/4712 co-relation queries the response was YES.
[2022-11-02 20:57:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 2833 events. 1392/2833 cut-off events. For 4712/4712 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13596 event pairs, 22 based on Foata normal form. 0/2604 useless extension candidates. Maximal degree in co-relation 6743. Up to 1440 conditions per place.
[2022-11-02 20:57:23,194 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 98 selfloop transitions, 4 changer transitions 0/415 dead transitions.
[2022-11-02 20:57:23,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 415 transitions, 1277 flow
[2022-11-02 20:57:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:57:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-11-02 20:57:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2267 transitions.
[2022-11-02 20:57:23,200 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7183143219264893
[2022-11-02 20:57:23,201 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2267 transitions.
[2022-11-02 20:57:23,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2267 transitions.
[2022-11-02 20:57:23,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:23,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2267 transitions.
[2022-11-02 20:57:23,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 377.8333333333333) internal successors, (2267), 6 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:23,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:23,212 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:23,212 INFO L175 Difference]: Start difference. First operand has 367 places, 368 transitions, 807 flow. Second operand 6 states and 2267 transitions.
[2022-11-02 20:57:23,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 415 transitions, 1277 flow
[2022-11-02 20:57:23,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 415 transitions, 1261 flow, removed 0 selfloop flow, removed 1 redundant places.
[2022-11-02 20:57:23,224 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow
[2022-11-02 20:57:23,224 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367}
[2022-11-02 20:57:23,225 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places.
[2022-11-02 20:57:23,225 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow
[2022-11-02 20:57:23,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:23,226 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:23,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-11-02 20:57:23,227 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -124545616, now seen corresponding path program 1 times
[2022-11-02 20:57:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180541433]
[2022-11-02 20:57:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:23,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180541433]
[2022-11-02 20:57:23,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180541433] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:23,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:23,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:57:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296493417]
[2022-11-02 20:57:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:57:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:57:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:57:23,922 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526
[2022-11-02 20:57:23,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:23,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:23,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526
[2022-11-02 20:57:23,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:25,208 INFO L130 PetriNetUnfolder]: 1332/2672 cut-off events.
[2022-11-02 20:57:25,209 INFO L131 PetriNetUnfolder]: For 2650/2650 co-relation queries the response was YES.
[2022-11-02 20:57:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 2672 events. 1332/2672 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12464 event pairs, 103 based on Foata normal form. 0/2445 useless extension candidates. Maximal degree in co-relation 6451. Up to 896 conditions per place.
[2022-11-02 20:57:25,267 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 73 selfloop transitions, 4 changer transitions 0/390 dead transitions.
[2022-11-02 20:57:25,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 390 transitions, 1089 flow
[2022-11-02 20:57:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:57:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-11-02 20:57:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2250 transitions.
[2022-11-02 20:57:25,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7129277566539924
[2022-11-02 20:57:25,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2250 transitions.
[2022-11-02 20:57:25,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2250 transitions.
[2022-11-02 20:57:25,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:25,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2250 transitions.
[2022-11-02 20:57:25,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:25,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:25,287 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:25,287 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 6 states and 2250 transitions.
[2022-11-02 20:57:25,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 390 transitions, 1089 flow
[2022-11-02 20:57:25,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 390 transitions, 1082 flow, removed 0 selfloop flow, removed 4 redundant places.
[2022-11-02 20:57:25,298 INFO L231 Difference]: Finished difference. Result has 370 places, 366 transitions, 808 flow
[2022-11-02 20:57:25,299 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=370, PETRI_TRANSITIONS=366}
[2022-11-02 20:57:25,300 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places.
[2022-11-02 20:57:25,300 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 366 transitions, 808 flow
[2022-11-02 20:57:25,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:25,301 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:25,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:25,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2022-11-02 20:57:25,302 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1327629800, now seen corresponding path program 1 times
[2022-11-02 20:57:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:25,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138240522]
[2022-11-02 20:57:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138240522]
[2022-11-02 20:57:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138240522] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:26,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:26,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:57:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508738810]
[2022-11-02 20:57:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:26,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 20:57:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:26,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 20:57:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:57:26,103 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526
[2022-11-02 20:57:26,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 366 transitions, 808 flow. Second operand has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:26,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:26,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526
[2022-11-02 20:57:26,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:27,111 INFO L130 PetriNetUnfolder]: 1282/2557 cut-off events.
[2022-11-02 20:57:27,111 INFO L131 PetriNetUnfolder]: For 2560/2560 co-relation queries the response was YES.
[2022-11-02 20:57:27,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 2557 events. 1282/2557 cut-off events. For 2560/2560 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11644 event pairs, 202 based on Foata normal form. 0/2374 useless extension candidates. Maximal degree in co-relation 6238. Up to 1181 conditions per place.
[2022-11-02 20:57:27,155 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 60 selfloop transitions, 4 changer transitions 0/377 dead transitions.
[2022-11-02 20:57:27,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 377 transitions, 998 flow
[2022-11-02 20:57:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:57:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-11-02 20:57:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2241 transitions.
[2022-11-02 20:57:27,165 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7100760456273765
[2022-11-02 20:57:27,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2241 transitions.
[2022-11-02 20:57:27,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2241 transitions.
[2022-11-02 20:57:27,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:27,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2241 transitions.
[2022-11-02 20:57:27,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,177 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,177 INFO L175 Difference]: Start difference. First operand has 370 places, 366 transitions, 808 flow. Second operand 6 states and 2241 transitions.
[2022-11-02 20:57:27,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 377 transitions, 998 flow
[2022-11-02 20:57:27,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 377 transitions, 991 flow, removed 0 selfloop flow, removed 4 redundant places.
[2022-11-02 20:57:27,185 INFO L231 Difference]: Finished difference. Result has 370 places, 365 transitions, 807 flow
[2022-11-02 20:57:27,186 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=807, PETRI_PLACES=370, PETRI_TRANSITIONS=365}
[2022-11-02 20:57:27,190 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places.
[2022-11-02 20:57:27,191 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 365 transitions, 807 flow
[2022-11-02 20:57:27,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,191 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:57:27,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:57:27,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2022-11-02 20:57:27,192 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] ===
[2022-11-02 20:57:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:57:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1614285771, now seen corresponding path program 1 times
[2022-11-02 20:57:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:57:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174860569]
[2022-11-02 20:57:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:57:27,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:57:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:57:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:57:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:57:27,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174860569]
[2022-11-02 20:57:27,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174860569] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:57:27,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:57:27,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:57:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712499757]
[2022-11-02 20:57:27,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:57:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:57:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:57:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:57:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:57:27,284 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526
[2022-11-02 20:57:27,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 365 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:57:27,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526
[2022-11-02 20:57:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:57:27,702 INFO L130 PetriNetUnfolder]: 244/1547 cut-off events.
[2022-11-02 20:57:27,703 INFO L131 PetriNetUnfolder]: For 560/568 co-relation queries the response was YES.
[2022-11-02 20:57:27,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1547 events. 244/1547 cut-off events. For 560/568 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8836 event pairs, 42 based on Foata normal form. 64/1442 useless extension candidates. Maximal degree in co-relation 2413. Up to 346 conditions per place.
[2022-11-02 20:57:27,717 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions.
[2022-11-02 20:57:27,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 847 flow
[2022-11-02 20:57:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:57:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:57:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions.
[2022-11-02 20:57:27,721 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7718631178707225
[2022-11-02 20:57:27,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:27,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:27,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:57:27,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1218 transitions.
[2022-11-02 20:57:27,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,727 INFO L175 Difference]: Start difference. First operand has 370 places, 365 transitions, 807 flow. Second operand 3 states and 1218 transitions.
[2022-11-02 20:57:27,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 847 flow
[2022-11-02 20:57:27,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 364 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places.
[2022-11-02 20:57:27,734 INFO L231 Difference]: Finished difference. Result has 367 places, 0 transitions, 0 flow
[2022-11-02 20:57:27,734 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=367, PETRI_TRANSITIONS=0}
[2022-11-02 20:57:27,737 INFO L287 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places.
[2022-11-02 20:57:27,737 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 0 transitions, 0 flow
[2022-11-02 20:57:27,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:57:27,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (230 of 231 remaining)
[2022-11-02 20:57:27,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (229 of 231 remaining)
[2022-11-02 20:57:27,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (228 of 231 remaining)
[2022-11-02 20:57:27,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (227 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (226 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (225 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (224 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (223 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (222 of 231 remaining)
[2022-11-02 20:57:27,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (221 of 231 remaining)
[2022-11-02 20:57:27,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (220 of 231 remaining)
[2022-11-02 20:57:27,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (219 of 231 remaining)
[2022-11-02 20:57:27,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (218 of 231 remaining)
[2022-11-02 20:57:27,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (217 of 231 remaining)
[2022-11-02 20:57:27,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (216 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (215 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (214 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (213 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (212 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (211 of 231 remaining)
[2022-11-02 20:57:27,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (210 of 231 remaining)
[2022-11-02 20:57:27,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (209 of 231 remaining)
[2022-11-02 20:57:27,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (208 of 231 remaining)
[2022-11-02 20:57:27,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (207 of 231 remaining)
[2022-11-02 20:57:27,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (206 of 231 remaining)
[2022-11-02 20:57:27,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (205 of 231 remaining)
[2022-11-02 20:57:27,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (204 of 231 remaining)
[2022-11-02 20:57:27,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (203 of 231 remaining)
[2022-11-02 20:57:27,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (202 of 231 remaining)
[2022-11-02 20:57:27,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (201 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (200 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (199 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (198 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (197 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (196 of 231 remaining)
[2022-11-02 20:57:27,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (194 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (193 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (192 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (191 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (190 of 231 remaining)
[2022-11-02 20:57:27,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (189 of 231 remaining)
[2022-11-02 20:57:27,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (188 of 231 remaining)
[2022-11-02 20:57:27,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (187 of 231 remaining)
[2022-11-02 20:57:27,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (186 of 231 remaining)
[2022-11-02 20:57:27,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (185 of 231 remaining)
[2022-11-02 20:57:27,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (184 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (183 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (182 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (181 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (180 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (179 of 231 remaining)
[2022-11-02 20:57:27,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (178 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (177 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (176 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (175 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (174 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (173 of 231 remaining)
[2022-11-02 20:57:27,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (172 of 231 remaining)
[2022-11-02 20:57:27,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (171 of 231 remaining)
[2022-11-02 20:57:27,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (170 of 231 remaining)
[2022-11-02 20:57:27,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (169 of 231 remaining)
[2022-11-02 20:57:27,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (168 of 231 remaining)
[2022-11-02 20:57:27,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (167 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (166 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (165 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (164 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (163 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (162 of 231 remaining)
[2022-11-02 20:57:27,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (161 of 231 remaining)
[2022-11-02 20:57:27,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (160 of 231 remaining)
[2022-11-02 20:57:27,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 231 remaining)
[2022-11-02 20:57:27,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (158 of 231 remaining)
[2022-11-02 20:57:27,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (157 of 231 remaining)
[2022-11-02 20:57:27,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (156 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (155 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (154 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (153 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (152 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (151 of 231 remaining)
[2022-11-02 20:57:27,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (150 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (149 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (148 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (147 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (146 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (145 of 231 remaining)
[2022-11-02 20:57:27,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (144 of 231 remaining)
[2022-11-02 20:57:27,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (143 of 231 remaining)
[2022-11-02 20:57:27,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (142 of 231 remaining)
[2022-11-02 20:57:27,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (141 of 231 remaining)
[2022-11-02 20:57:27,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (140 of 231 remaining)
[2022-11-02 20:57:27,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (139 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (138 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (137 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (136 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (135 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (134 of 231 remaining)
[2022-11-02 20:57:27,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (133 of 231 remaining)
[2022-11-02 20:57:27,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (132 of 231 remaining)
[2022-11-02 20:57:27,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (131 of 231 remaining)
[2022-11-02 20:57:27,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (130 of 231 remaining)
[2022-11-02 20:57:27,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (129 of 231 remaining)
[2022-11-02 20:57:27,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (128 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (127 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (126 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (125 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (124 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (123 of 231 remaining)
[2022-11-02 20:57:27,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (122 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (121 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (120 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (119 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (118 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 231 remaining)
[2022-11-02 20:57:27,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 231 remaining)
[2022-11-02 20:57:27,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (115 of 231 remaining)
[2022-11-02 20:57:27,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (114 of 231 remaining)
[2022-11-02 20:57:27,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (113 of 231 remaining)
[2022-11-02 20:57:27,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 231 remaining)
[2022-11-02 20:57:27,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (111 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (108 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (107 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (106 of 231 remaining)
[2022-11-02 20:57:27,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (105 of 231 remaining)
[2022-11-02 20:57:27,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (104 of 231 remaining)
[2022-11-02 20:57:27,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (103 of 231 remaining)
[2022-11-02 20:57:27,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 231 remaining)
[2022-11-02 20:57:27,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 231 remaining)
[2022-11-02 20:57:27,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (99 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (98 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (97 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (96 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (95 of 231 remaining)
[2022-11-02 20:57:27,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (94 of 231 remaining)
[2022-11-02 20:57:27,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (93 of 231 remaining)
[2022-11-02 20:57:27,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (92 of 231 remaining)
[2022-11-02 20:57:27,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (91 of 231 remaining)
[2022-11-02 20:57:27,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (90 of 231 remaining)
[2022-11-02 20:57:27,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (89 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (88 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (86 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 231 remaining)
[2022-11-02 20:57:27,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (83 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (82 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (80 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (79 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (78 of 231 remaining)
[2022-11-02 20:57:27,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (77 of 231 remaining)
[2022-11-02 20:57:27,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (76 of 231 remaining)
[2022-11-02 20:57:27,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (75 of 231 remaining)
[2022-11-02 20:57:27,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (74 of 231 remaining)
[2022-11-02 20:57:27,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (73 of 231 remaining)
[2022-11-02 20:57:27,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (72 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (71 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (70 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (69 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (68 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (67 of 231 remaining)
[2022-11-02 20:57:27,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (66 of 231 remaining)
[2022-11-02 20:57:27,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (65 of 231 remaining)
[2022-11-02 20:57:27,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (64 of 231 remaining)
[2022-11-02 20:57:27,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (63 of 231 remaining)
[2022-11-02 20:57:27,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (62 of 231 remaining)
[2022-11-02 20:57:27,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (61 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (60 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (59 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (58 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (57 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (56 of 231 remaining)
[2022-11-02 20:57:27,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (55 of 231 remaining)
[2022-11-02 20:57:27,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (54 of 231 remaining)
[2022-11-02 20:57:27,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (53 of 231 remaining)
[2022-11-02 20:57:27,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (52 of 231 remaining)
[2022-11-02 20:57:27,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (51 of 231 remaining)
[2022-11-02 20:57:27,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (50 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (47 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (46 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 231 remaining)
[2022-11-02 20:57:27,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (44 of 231 remaining)
[2022-11-02 20:57:27,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 231 remaining)
[2022-11-02 20:57:27,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (42 of 231 remaining)
[2022-11-02 20:57:27,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 231 remaining)
[2022-11-02 20:57:27,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (40 of 231 remaining)
[2022-11-02 20:57:27,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (39 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (38 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (37 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (36 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (35 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (34 of 231 remaining)
[2022-11-02 20:57:27,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (33 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (32 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (31 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (30 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (29 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (28 of 231 remaining)
[2022-11-02 20:57:27,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (27 of 231 remaining)
[2022-11-02 20:57:27,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (26 of 231 remaining)
[2022-11-02 20:57:27,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (25 of 231 remaining)
[2022-11-02 20:57:27,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (24 of 231 remaining)
[2022-11-02 20:57:27,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 231 remaining)
[2022-11-02 20:57:27,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (21 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (20 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (18 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (17 of 231 remaining)
[2022-11-02 20:57:27,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (16 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (14 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (13 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (11 of 231 remaining)
[2022-11-02 20:57:27,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (9 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (8 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (7 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (6 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (5 of 231 remaining)
[2022-11-02 20:57:27,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (4 of 231 remaining)
[2022-11-02 20:57:27,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (3 of 231 remaining)
[2022-11-02 20:57:27,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (2 of 231 remaining)
[2022-11-02 20:57:27,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (1 of 231 remaining)
[2022-11-02 20:57:27,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (0 of 231 remaining)
[2022-11-02 20:57:27,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-11-02 20:57:27,783 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, 1, 1, 1]
[2022-11-02 20:57:27,792 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-02 20:57:27,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:57:27,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:57:27 BasicIcfg
[2022-11-02 20:57:27,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:57:27,804 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:57:27,804 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:57:27,804 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:57:27,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09" (3/4) ...
[2022-11-02 20:57:27,808 INFO L137 WitnessPrinter]: Generating witness for correct program
[2022-11-02 20:57:27,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1
[2022-11-02 20:57:27,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2
[2022-11-02 20:57:27,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3
[2022-11-02 20:57:27,830 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges
[2022-11-02 20:57:27,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2022-11-02 20:57:27,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2022-11-02 20:57:27,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2022-11-02 20:57:27,913 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:57:27,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:57:27,914 INFO L158 Benchmark]: Toolchain (without parser) took 21816.47ms. Allocated memory was 119.5MB in the beginning and 782.2MB in the end (delta: 662.7MB). Free memory was 86.0MB in the beginning and 420.3MB in the end (delta: -334.3MB). Peak memory consumption was 328.2MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,914 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:57:27,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.51ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 90.9MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.16ms. Allocated memory is still 119.5MB. Free memory was 90.9MB in the beginning and 86.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,915 INFO L158 Benchmark]: Boogie Preprocessor took 85.64ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 82.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,915 INFO L158 Benchmark]: RCFGBuilder took 2396.59ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 81.6MB in the beginning and 70.1MB in the end (delta: 11.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,916 INFO L158 Benchmark]: TraceAbstraction took 18759.40ms. Allocated memory was 144.7MB in the beginning and 782.2MB in the end (delta: 637.5MB). Free memory was 70.1MB in the beginning and 426.6MB in the end (delta: -356.5MB). Peak memory consumption was 281.1MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,920 INFO L158 Benchmark]: Witness Printer took 109.03ms. Allocated memory is still 782.2MB. Free memory was 426.6MB in the beginning and 420.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2022-11-02 20:57:27,923 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.23ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 393.51ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 90.9MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 65.16ms. Allocated memory is still 119.5MB. Free memory was 90.9MB in the beginning and 86.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 85.64ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 82.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 2396.59ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 81.6MB in the beginning and 70.1MB in the end (delta: 11.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 18759.40ms. Allocated memory was 144.7MB in the beginning and 782.2MB in the end (delta: 637.5MB). Free memory was 70.1MB in the beginning and 426.6MB in the end (delta: -356.5MB). Peak memory consumption was 281.1MB. Max. memory is 16.1GB.
* Witness Printer took 109.03ms. Allocated memory is still 782.2MB. Free memory was 426.6MB in the beginning and 420.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 52]: 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: 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: 55]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 57]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 59]: 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: 61]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 63]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 63]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 64]: 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: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 70]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 70]: 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: 73]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 75]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 75]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 75]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 76]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 76]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 76]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 76]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 77]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 77]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 78]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 88]: 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: 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: 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: 91]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 92]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 92]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 93]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 95]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 97]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 97]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 97]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 98]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 98]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 98]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 98]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 99]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 99]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 100]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 110]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 112]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 112]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 112]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 113]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 113]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 113]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 113]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 114]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 114]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 115]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 117]: 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: 119]: 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: 119]: 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: 120]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 120]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 120]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 120]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 120]: 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: 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: 133]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 135]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 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: 137]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 138]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 138]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 173]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 140]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 141]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 141]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 142]: 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: 143]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 173]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 145]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 146]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 146]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 147]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 148]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 148]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 173]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 150]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 151]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 157]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 158]: 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: 161]: 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, 653 locations, 231 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: 18.4s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1265 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 241 mSDtfsCounter, 1265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1024occurred in iteration=0, InterpolantAutomatonStates: 99, 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, 3.9s InterpolantComputationTime, 4275 NumberOfCodeBlocks, 4275 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4246 ConstructedInterpolants, 0 QuantifiedInterpolants, 4654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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
128 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2022-11-02 20:57:28,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636f6c69-ce2f-44ff-aba6-166e92777628/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE