./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-commit-2.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_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/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_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/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_24574b10-1102-4983-a252-a22def0c86de/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 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- 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:53,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:53,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:54,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:54,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:54,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:54,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:54,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:54,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:54,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:54,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:54,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:54,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:54,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:54,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:54,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:54,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:54,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:54,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:54,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:54,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:54,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:54,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:54,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:54,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:54,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:54,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:54,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:54,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:54,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:54,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:54,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:54,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:54,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:54,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:54,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:54,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:54,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:54,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:54,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:54,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:54,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:57:54,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:54,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:54,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:54,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:54,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:54,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:54,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:54,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:54,130 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:54,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:54,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:54,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:57:54,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:54,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:54,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:54,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:54,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:54,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:54,134 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:57:54,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:54,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:54,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:54,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:54,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:54,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:54,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:54,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:54,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:54,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:54,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:54,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:54,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:54,141 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:54,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:54,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:54,142 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_24574b10-1102-4983-a252-a22def0c86de/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_24574b10-1102-4983-a252-a22def0c86de/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 -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2022-11-02 20:57:54,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:54,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:54,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:54,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:54,452 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:54,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2022-11-02 20:57:54,553 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/data/36287e6c5/8f66392385b04a14a56420ddbbe90a84/FLAG0afb44fe2 [2022-11-02 20:57:55,111 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:55,112 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2022-11-02 20:57:55,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/data/36287e6c5/8f66392385b04a14a56420ddbbe90a84/FLAG0afb44fe2 [2022-11-02 20:57:55,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/data/36287e6c5/8f66392385b04a14a56420ddbbe90a84 [2022-11-02 20:57:55,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:55,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:55,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:55,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:55,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:55,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:55" (1/1) ... [2022-11-02 20:57:55,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b1e369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:55, skipping insertion in model container [2022-11-02 20:57:55,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:55" (1/1) ... [2022-11-02 20:57:55,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:55,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:55,924 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_24574b10-1102-4983-a252-a22def0c86de/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-11-02 20:57:55,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:55,939 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:55,995 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_24574b10-1102-4983-a252-a22def0c86de/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-11-02 20:57:56,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:56,017 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:56,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:56 WrapperNode [2022-11-02 20:57:56,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:56,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:56,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:56,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:56,028 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:56" (1/1) ... [2022-11-02 20:57:56,045 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:56" (1/1) ... [2022-11-02 20:57:56,098 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 1070 [2022-11-02 20:57:56,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:56,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:56,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:56,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:56,110 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:56" (1/1) ... [2022-11-02 20:57:56,110 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:56" (1/1) ... [2022-11-02 20:57:56,119 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:56" (1/1) ... [2022-11-02 20:57:56,119 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:56" (1/1) ... [2022-11-02 20:57:56,150 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:56" (1/1) ... [2022-11-02 20:57:56,170 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:56" (1/1) ... [2022-11-02 20:57:56,180 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:56" (1/1) ... [2022-11-02 20:57:56,183 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:56" (1/1) ... [2022-11-02 20:57:56,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:56,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:56,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:56,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:56,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:56" (1/1) ... [2022-11-02 20:57:56,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:56,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:56,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/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:56,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/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:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:57:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:57:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:57:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:57:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:57:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:57:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:57:56,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:57:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:57:56,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:57:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:57:56,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:57:56,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:57:56,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:56,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:56,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:56,295 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:56,508 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:56,510 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:58,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:59,256 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:59,256 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-02 20:57:59,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:59 BoogieIcfgContainer [2022-11-02 20:57:59,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:59,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:59,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:59,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:59,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:55" (1/3) ... [2022-11-02 20:57:59,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146d53da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:59, skipping insertion in model container [2022-11-02 20:57:59,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:56" (2/3) ... [2022-11-02 20:57:59,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146d53da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:59, skipping insertion in model container [2022-11-02 20:57:59,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:59" (3/3) ... [2022-11-02 20:57:59,274 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-11-02 20:57:59,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:57:59,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:59,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 186 error locations. [2022-11-02 20:57:59,302 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:57:59,594 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:57:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 683 places, 707 transitions, 1446 flow [2022-11-02 20:58:00,070 INFO L130 PetriNetUnfolder]: 37/703 cut-off events. [2022-11-02 20:58:00,070 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:58:00,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 703 events. 37/703 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1544 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 604. Up to 8 conditions per place. [2022-11-02 20:58:00,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 683 places, 707 transitions, 1446 flow [2022-11-02 20:58:00,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 658 places, 681 transitions, 1386 flow [2022-11-02 20:58:00,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:00,123 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;@5495ff27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:00,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 340 error locations. [2022-11-02 20:58:00,129 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-11-02 20:58:00,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:58:00,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:00,131 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:58:00,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1034260354, now seen corresponding path program 1 times [2022-11-02 20:58:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482560021] [2022-11-02 20:58:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:00,408 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:58:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:00,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482560021] [2022-11-02 20:58:00,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482560021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:00,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:00,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755199785] [2022-11-02 20:58:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:00,468 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:00,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 681 transitions, 1386 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:00,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:00,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:00,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:00,965 INFO L130 PetriNetUnfolder]: 56/562 cut-off events. [2022-11-02 20:58:00,966 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-02 20:58:00,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 562 events. 56/562 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs, 0 based on Foata normal form. 28/505 useless extension candidates. Maximal degree in co-relation 519. Up to 62 conditions per place. [2022-11-02 20:58:00,973 INFO L137 encePairwiseOnDemand]: 550/707 looper letters, 25 selfloop transitions, 2 changer transitions 8/526 dead transitions. [2022-11-02 20:58:00,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 526 transitions, 1130 flow [2022-11-02 20:58:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1748 transitions. [2022-11-02 20:58:01,002 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8241395568128241 [2022-11-02 20:58:01,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1748 transitions. [2022-11-02 20:58:01,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1748 transitions. [2022-11-02 20:58:01,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:01,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1748 transitions. [2022-11-02 20:58:01,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 582.6666666666666) internal successors, (1748), 3 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,041 INFO L175 Difference]: Start difference. First operand has 658 places, 681 transitions, 1386 flow. Second operand 3 states and 1748 transitions. [2022-11-02 20:58:01,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 526 transitions, 1130 flow [2022-11-02 20:58:01,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 526 transitions, 1114 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:58:01,073 INFO L231 Difference]: Finished difference. Result has 513 places, 518 transitions, 1048 flow [2022-11-02 20:58:01,076 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=513, PETRI_TRANSITIONS=518} [2022-11-02 20:58:01,081 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -145 predicate places. [2022-11-02 20:58:01,081 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 518 transitions, 1048 flow [2022-11-02 20:58:01,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:01,083 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] [2022-11-02 20:58:01,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:58:01,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1405454233, now seen corresponding path program 1 times [2022-11-02 20:58:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:01,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955024531] [2022-11-02 20:58:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,261 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:58:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:01,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955024531] [2022-11-02 20:58:01,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955024531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:01,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:01,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636142886] [2022-11-02 20:58:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:01,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:01,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:01,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:01,270 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:01,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 518 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:01,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:01,549 INFO L130 PetriNetUnfolder]: 56/553 cut-off events. [2022-11-02 20:58:01,550 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:58:01,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 553 events. 56/553 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 576. Up to 63 conditions per place. [2022-11-02 20:58:01,556 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 26 selfloop transitions, 2 changer transitions 0/517 dead transitions. [2022-11-02 20:58:01,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 517 transitions, 1102 flow [2022-11-02 20:58:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:01,561 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:01,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:01,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,575 INFO L175 Difference]: Start difference. First operand has 513 places, 518 transitions, 1048 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:01,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 517 transitions, 1102 flow [2022-11-02 20:58:01,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 517 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:01,587 INFO L231 Difference]: Finished difference. Result has 504 places, 517 transitions, 1046 flow [2022-11-02 20:58:01,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=504, PETRI_TRANSITIONS=517} [2022-11-02 20:58:01,589 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -154 predicate places. [2022-11-02 20:58:01,590 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 517 transitions, 1046 flow [2022-11-02 20:58:01,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:01,591 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] [2022-11-02 20:58:01,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:58:01,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1856995672, now seen corresponding path program 1 times [2022-11-02 20:58:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097596511] [2022-11-02 20:58:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,674 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:58:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097596511] [2022-11-02 20:58:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097596511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:01,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141488023] [2022-11-02 20:58:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:01,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:01,679 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:01,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 517 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:01,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:01,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:01,890 INFO L130 PetriNetUnfolder]: 56/552 cut-off events. [2022-11-02 20:58:01,890 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:58:01,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 552 events. 56/552 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 558 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 568. Up to 63 conditions per place. [2022-11-02 20:58:01,896 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 26 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2022-11-02 20:58:01,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 516 transitions, 1100 flow [2022-11-02 20:58:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:01,900 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:01,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:01,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:01,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,913 INFO L175 Difference]: Start difference. First operand has 504 places, 517 transitions, 1046 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:01,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 516 transitions, 1100 flow [2022-11-02 20:58:01,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 516 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:01,924 INFO L231 Difference]: Finished difference. Result has 503 places, 516 transitions, 1044 flow [2022-11-02 20:58:01,925 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=503, PETRI_TRANSITIONS=516} [2022-11-02 20:58:01,926 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -155 predicate places. [2022-11-02 20:58:01,926 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 516 transitions, 1044 flow [2022-11-02 20:58:01,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:01,927 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] [2022-11-02 20:58:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:58:01,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1733019707, now seen corresponding path program 1 times [2022-11-02 20:58:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372617162] [2022-11-02 20:58:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,982 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:58:01,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:01,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372617162] [2022-11-02 20:58:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372617162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:01,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:01,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241862633] [2022-11-02 20:58:01,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:01,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:01,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:01,987 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:01,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 516 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:01,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:01,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:01,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:02,296 INFO L130 PetriNetUnfolder]: 107/777 cut-off events. [2022-11-02 20:58:02,296 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-02 20:58:02,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 777 events. 107/777 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1646 event pairs, 0 based on Foata normal form. 1/649 useless extension candidates. Maximal degree in co-relation 839. Up to 70 conditions per place. [2022-11-02 20:58:02,306 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 39 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2022-11-02 20:58:02,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 534 transitions, 1173 flow [2022-11-02 20:58:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-11-02 20:58:02,311 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7633191890617633 [2022-11-02 20:58:02,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1619 transitions. [2022-11-02 20:58:02,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1619 transitions. [2022-11-02 20:58:02,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:02,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1619 transitions. [2022-11-02 20:58:02,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 539.6666666666666) internal successors, (1619), 3 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,324 INFO L175 Difference]: Start difference. First operand has 503 places, 516 transitions, 1044 flow. Second operand 3 states and 1619 transitions. [2022-11-02 20:58:02,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 534 transitions, 1173 flow [2022-11-02 20:58:02,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 534 transitions, 1169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:02,336 INFO L231 Difference]: Finished difference. Result has 503 places, 518 transitions, 1062 flow [2022-11-02 20:58:02,337 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=503, PETRI_TRANSITIONS=518} [2022-11-02 20:58:02,338 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -155 predicate places. [2022-11-02 20:58:02,338 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 518 transitions, 1062 flow [2022-11-02 20:58:02,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:02,339 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] [2022-11-02 20:58:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:58:02,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -718593774, now seen corresponding path program 1 times [2022-11-02 20:58:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:02,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853625111] [2022-11-02 20:58:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:02,433 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:58:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:02,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853625111] [2022-11-02 20:58:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853625111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:02,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:02,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019257647] [2022-11-02 20:58:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:02,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:02,441 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:02,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 518 transitions, 1062 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:02,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:02,745 INFO L130 PetriNetUnfolder]: 107/776 cut-off events. [2022-11-02 20:58:02,745 INFO L131 PetriNetUnfolder]: For 33/34 co-relation queries the response was YES. [2022-11-02 20:58:02,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 776 events. 107/776 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1655 event pairs, 3 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 531. Up to 115 conditions per place. [2022-11-02 20:58:02,754 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 26 selfloop transitions, 2 changer transitions 0/517 dead transitions. [2022-11-02 20:58:02,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 517 transitions, 1116 flow [2022-11-02 20:58:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:02,758 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:02,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:02,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:02,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:02,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:02,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,770 INFO L175 Difference]: Start difference. First operand has 503 places, 518 transitions, 1062 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 517 transitions, 1116 flow [2022-11-02 20:58:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 517 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:02,779 INFO L231 Difference]: Finished difference. Result has 503 places, 517 transitions, 1060 flow [2022-11-02 20:58:02,780 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=503, PETRI_TRANSITIONS=517} [2022-11-02 20:58:02,781 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -155 predicate places. [2022-11-02 20:58:02,781 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 517 transitions, 1060 flow [2022-11-02 20:58:02,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:02,783 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] [2022-11-02 20:58:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:58:02,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1507230856, now seen corresponding path program 1 times [2022-11-02 20:58:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:02,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011092820] [2022-11-02 20:58:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:02,827 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:58:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:02,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011092820] [2022-11-02 20:58:02,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011092820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:02,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:02,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816803822] [2022-11-02 20:58:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:02,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:02,831 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:02,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 517 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:02,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:02,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:02,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:03,093 INFO L130 PetriNetUnfolder]: 107/775 cut-off events. [2022-11-02 20:58:03,093 INFO L131 PetriNetUnfolder]: For 32/33 co-relation queries the response was YES. [2022-11-02 20:58:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 775 events. 107/775 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1655 event pairs, 3 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 854. Up to 113 conditions per place. [2022-11-02 20:58:03,103 INFO L137 encePairwiseOnDemand]: 705/707 looper letters, 26 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2022-11-02 20:58:03,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 516 transitions, 1112 flow [2022-11-02 20:58:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1600 transitions. [2022-11-02 20:58:03,107 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543611504007544 [2022-11-02 20:58:03,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1600 transitions. [2022-11-02 20:58:03,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1600 transitions. [2022-11-02 20:58:03,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:03,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1600 transitions. [2022-11-02 20:58:03,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,121 INFO L175 Difference]: Start difference. First operand has 503 places, 517 transitions, 1060 flow. Second operand 3 states and 1600 transitions. [2022-11-02 20:58:03,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 516 transitions, 1112 flow [2022-11-02 20:58:03,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 516 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:03,131 INFO L231 Difference]: Finished difference. Result has 502 places, 516 transitions, 1056 flow [2022-11-02 20:58:03,132 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=502, PETRI_TRANSITIONS=516} [2022-11-02 20:58:03,134 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -156 predicate places. [2022-11-02 20:58:03,135 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 516 transitions, 1056 flow [2022-11-02 20:58:03,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:03,136 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] [2022-11-02 20:58:03,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:58:03,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -698051609, now seen corresponding path program 1 times [2022-11-02 20:58:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:03,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228671177] [2022-11-02 20:58:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:03,259 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:58:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:03,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228671177] [2022-11-02 20:58:03,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228671177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:03,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:03,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931215494] [2022-11-02 20:58:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:03,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:03,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:03,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:03,263 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:03,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 516 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:03,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:03,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:03,566 INFO L130 PetriNetUnfolder]: 107/774 cut-off events. [2022-11-02 20:58:03,566 INFO L131 PetriNetUnfolder]: For 32/33 co-relation queries the response was YES. [2022-11-02 20:58:03,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 774 events. 107/774 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1625 event pairs, 3 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 854. Up to 115 conditions per place. [2022-11-02 20:58:03,576 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 26 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2022-11-02 20:58:03,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 515 transitions, 1110 flow [2022-11-02 20:58:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:03,582 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:03,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:03,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:03,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:03,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:03,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,610 INFO L175 Difference]: Start difference. First operand has 502 places, 516 transitions, 1056 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:03,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 515 transitions, 1110 flow [2022-11-02 20:58:03,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 515 transitions, 1109 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:03,622 INFO L231 Difference]: Finished difference. Result has 502 places, 515 transitions, 1057 flow [2022-11-02 20:58:03,623 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=502, PETRI_TRANSITIONS=515} [2022-11-02 20:58:03,624 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -156 predicate places. [2022-11-02 20:58:03,624 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 515 transitions, 1057 flow [2022-11-02 20:58:03,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:03,626 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:58:03,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:58:03,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -520522442, now seen corresponding path program 1 times [2022-11-02 20:58:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409287677] [2022-11-02 20:58:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:04,322 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:58:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:04,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409287677] [2022-11-02 20:58:04,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409287677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:04,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:04,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453180642] [2022-11-02 20:58:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:04,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:04,328 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 707 [2022-11-02 20:58:04,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 515 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 440.8333333333333) internal successors, (2645), 6 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:04,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:04,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 707 [2022-11-02 20:58:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:05,049 INFO L130 PetriNetUnfolder]: 396/1100 cut-off events. [2022-11-02 20:58:05,049 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-11-02 20:58:05,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1100 events. 396/1100 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2253 event pairs, 9 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1614. Up to 492 conditions per place. [2022-11-02 20:58:05,072 INFO L137 encePairwiseOnDemand]: 683/707 looper letters, 91 selfloop transitions, 20 changer transitions 0/511 dead transitions. [2022-11-02 20:58:05,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 511 transitions, 1271 flow [2022-11-02 20:58:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:58:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2746 transitions. [2022-11-02 20:58:05,078 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6473361621876473 [2022-11-02 20:58:05,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2746 transitions. [2022-11-02 20:58:05,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2746 transitions. [2022-11-02 20:58:05,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:05,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2746 transitions. [2022-11-02 20:58:05,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 457.6666666666667) internal successors, (2746), 6 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,095 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,095 INFO L175 Difference]: Start difference. First operand has 502 places, 515 transitions, 1057 flow. Second operand 6 states and 2746 transitions. [2022-11-02 20:58:05,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 511 transitions, 1271 flow [2022-11-02 20:58:05,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 511 transitions, 1267 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:05,106 INFO L231 Difference]: Finished difference. Result has 501 places, 511 transitions, 1085 flow [2022-11-02 20:58:05,107 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1085, PETRI_PLACES=501, PETRI_TRANSITIONS=511} [2022-11-02 20:58:05,108 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -157 predicate places. [2022-11-02 20:58:05,108 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 511 transitions, 1085 flow [2022-11-02 20:58:05,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 440.8333333333333) internal successors, (2645), 6 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:05,109 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] [2022-11-02 20:58:05,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:58:05,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1279288228, now seen corresponding path program 1 times [2022-11-02 20:58:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:05,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440042940] [2022-11-02 20:58:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,156 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:58:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440042940] [2022-11-02 20:58:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440042940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:05,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:05,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912411892] [2022-11-02 20:58:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:05,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:05,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:05,160 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:05,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 511 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:05,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:05,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:05,408 INFO L130 PetriNetUnfolder]: 107/769 cut-off events. [2022-11-02 20:58:05,408 INFO L131 PetriNetUnfolder]: For 32/33 co-relation queries the response was YES. [2022-11-02 20:58:05,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 769 events. 107/769 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1633 event pairs, 3 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 881. Up to 118 conditions per place. [2022-11-02 20:58:05,418 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 29 selfloop transitions, 2 changer transitions 0/510 dead transitions. [2022-11-02 20:58:05,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 510 transitions, 1145 flow [2022-11-02 20:58:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:05,423 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:05,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:05,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:05,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:05,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:05,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,433 INFO L175 Difference]: Start difference. First operand has 501 places, 511 transitions, 1085 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:05,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 510 transitions, 1145 flow [2022-11-02 20:58:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 510 transitions, 1105 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:58:05,443 INFO L231 Difference]: Finished difference. Result has 497 places, 510 transitions, 1047 flow [2022-11-02 20:58:05,444 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=497, PETRI_TRANSITIONS=510} [2022-11-02 20:58:05,445 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -161 predicate places. [2022-11-02 20:58:05,445 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 510 transitions, 1047 flow [2022-11-02 20:58:05,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:05,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:58:05,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1374277485, now seen corresponding path program 1 times [2022-11-02 20:58:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184421148] [2022-11-02 20:58:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,491 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:58:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184421148] [2022-11-02 20:58:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184421148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679357326] [2022-11-02 20:58:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:05,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:05,496 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:05,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 510 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:05,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:05,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:05,832 INFO L130 PetriNetUnfolder]: 161/958 cut-off events. [2022-11-02 20:58:05,832 INFO L131 PetriNetUnfolder]: For 47/48 co-relation queries the response was YES. [2022-11-02 20:58:05,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 958 events. 161/958 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2617 event pairs, 3 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1102. Up to 105 conditions per place. [2022-11-02 20:58:05,846 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 44 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2022-11-02 20:58:05,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 528 transitions, 1191 flow [2022-11-02 20:58:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1616 transitions. [2022-11-02 20:58:05,850 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2022-11-02 20:58:05,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1616 transitions. [2022-11-02 20:58:05,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1616 transitions. [2022-11-02 20:58:05,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:05,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1616 transitions. [2022-11-02 20:58:05,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 538.6666666666666) internal successors, (1616), 3 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,861 INFO L175 Difference]: Start difference. First operand has 497 places, 510 transitions, 1047 flow. Second operand 3 states and 1616 transitions. [2022-11-02 20:58:05,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 528 transitions, 1191 flow [2022-11-02 20:58:05,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 528 transitions, 1187 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:05,913 INFO L231 Difference]: Finished difference. Result has 497 places, 510 transitions, 1051 flow [2022-11-02 20:58:05,914 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=497, PETRI_TRANSITIONS=510} [2022-11-02 20:58:05,915 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -161 predicate places. [2022-11-02 20:58:05,915 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 510 transitions, 1051 flow [2022-11-02 20:58:05,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:05,917 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:58:05,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:58:05,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1707105066, now seen corresponding path program 1 times [2022-11-02 20:58:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:05,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304287379] [2022-11-02 20:58:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:05,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:05,962 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:58:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304287379] [2022-11-02 20:58:05,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304287379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:05,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146981903] [2022-11-02 20:58:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:05,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:05,966 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:05,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 510 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:05,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:05,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:05,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:06,264 INFO L130 PetriNetUnfolder]: 161/916 cut-off events. [2022-11-02 20:58:06,264 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-11-02 20:58:06,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 916 events. 161/916 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2268 event pairs, 10 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1083. Up to 171 conditions per place. [2022-11-02 20:58:06,278 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 27 selfloop transitions, 2 changer transitions 0/509 dead transitions. [2022-11-02 20:58:06,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 509 transitions, 1107 flow [2022-11-02 20:58:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:06,282 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:06,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:06,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:06,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:06,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:06,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,292 INFO L175 Difference]: Start difference. First operand has 497 places, 510 transitions, 1051 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:06,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 509 transitions, 1107 flow [2022-11-02 20:58:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 509 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:06,302 INFO L231 Difference]: Finished difference. Result has 497 places, 509 transitions, 1051 flow [2022-11-02 20:58:06,304 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=497, PETRI_TRANSITIONS=509} [2022-11-02 20:58:06,304 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -161 predicate places. [2022-11-02 20:58:06,304 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 509 transitions, 1051 flow [2022-11-02 20:58:06,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:06,306 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] [2022-11-02 20:58:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:58:06,306 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 83621888, now seen corresponding path program 1 times [2022-11-02 20:58:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:06,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610114462] [2022-11-02 20:58:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:06,354 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:58:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:06,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610114462] [2022-11-02 20:58:06,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610114462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:06,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:06,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628709741] [2022-11-02 20:58:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:06,359 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:06,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 509 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:06,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:06,677 INFO L130 PetriNetUnfolder]: 158/952 cut-off events. [2022-11-02 20:58:06,677 INFO L131 PetriNetUnfolder]: For 62/63 co-relation queries the response was YES. [2022-11-02 20:58:06,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 952 events. 158/952 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2600 event pairs, 10 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1116. Up to 174 conditions per place. [2022-11-02 20:58:06,690 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 30 selfloop transitions, 2 changer transitions 0/508 dead transitions. [2022-11-02 20:58:06,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 508 transitions, 1113 flow [2022-11-02 20:58:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:06,694 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:06,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:06,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:06,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:06,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:06,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,704 INFO L175 Difference]: Start difference. First operand has 497 places, 509 transitions, 1051 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:06,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 508 transitions, 1113 flow [2022-11-02 20:58:06,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 508 transitions, 1109 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:06,715 INFO L231 Difference]: Finished difference. Result has 496 places, 508 transitions, 1049 flow [2022-11-02 20:58:06,716 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=496, PETRI_TRANSITIONS=508} [2022-11-02 20:58:06,717 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -162 predicate places. [2022-11-02 20:58:06,717 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 508 transitions, 1049 flow [2022-11-02 20:58:06,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:06,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:06,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:58:06,718 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1130724500, now seen corresponding path program 1 times [2022-11-02 20:58:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670554374] [2022-11-02 20:58:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:06,771 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:58:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:06,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670554374] [2022-11-02 20:58:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670554374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:06,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:06,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715324489] [2022-11-02 20:58:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:06,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:06,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:06,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 508 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:06,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:06,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:06,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:07,118 INFO L130 PetriNetUnfolder]: 161/914 cut-off events. [2022-11-02 20:58:07,118 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-11-02 20:58:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 914 events. 161/914 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2267 event pairs, 10 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1075. Up to 169 conditions per place. [2022-11-02 20:58:07,133 INFO L137 encePairwiseOnDemand]: 705/707 looper letters, 27 selfloop transitions, 1 changer transitions 0/507 dead transitions. [2022-11-02 20:58:07,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 507 transitions, 1103 flow [2022-11-02 20:58:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1600 transitions. [2022-11-02 20:58:07,139 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543611504007544 [2022-11-02 20:58:07,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1600 transitions. [2022-11-02 20:58:07,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1600 transitions. [2022-11-02 20:58:07,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:07,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1600 transitions. [2022-11-02 20:58:07,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,150 INFO L175 Difference]: Start difference. First operand has 496 places, 508 transitions, 1049 flow. Second operand 3 states and 1600 transitions. [2022-11-02 20:58:07,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 507 transitions, 1103 flow [2022-11-02 20:58:07,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 507 transitions, 1099 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:07,162 INFO L231 Difference]: Finished difference. Result has 495 places, 507 transitions, 1045 flow [2022-11-02 20:58:07,163 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=495, PETRI_TRANSITIONS=507} [2022-11-02 20:58:07,164 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -163 predicate places. [2022-11-02 20:58:07,165 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 507 transitions, 1045 flow [2022-11-02 20:58:07,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:07,166 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] [2022-11-02 20:58:07,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:58:07,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2118891099, now seen corresponding path program 1 times [2022-11-02 20:58:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082524290] [2022-11-02 20:58:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:07,245 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:58:07,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:07,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082524290] [2022-11-02 20:58:07,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082524290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:07,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:07,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852165481] [2022-11-02 20:58:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:07,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:07,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:07,251 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:07,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 507 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:07,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:07,628 INFO L130 PetriNetUnfolder]: 161/913 cut-off events. [2022-11-02 20:58:07,628 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-02 20:58:07,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 913 events. 161/913 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2262 event pairs, 10 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1073. Up to 171 conditions per place. [2022-11-02 20:58:07,641 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 27 selfloop transitions, 2 changer transitions 0/506 dead transitions. [2022-11-02 20:58:07,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 506 transitions, 1101 flow [2022-11-02 20:58:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:07,646 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:07,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:07,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:07,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:07,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:07,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,655 INFO L175 Difference]: Start difference. First operand has 495 places, 507 transitions, 1045 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:07,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 506 transitions, 1101 flow [2022-11-02 20:58:07,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 506 transitions, 1100 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:07,665 INFO L231 Difference]: Finished difference. Result has 495 places, 506 transitions, 1046 flow [2022-11-02 20:58:07,666 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=495, PETRI_TRANSITIONS=506} [2022-11-02 20:58:07,667 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -163 predicate places. [2022-11-02 20:58:07,667 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 506 transitions, 1046 flow [2022-11-02 20:58:07,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:07,668 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] [2022-11-02 20:58:07,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:58:07,669 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1215301896, now seen corresponding path program 1 times [2022-11-02 20:58:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077883366] [2022-11-02 20:58:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:07,750 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:58:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:07,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077883366] [2022-11-02 20:58:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077883366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:07,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:07,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107782215] [2022-11-02 20:58:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:07,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:07,755 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:07,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 506 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:07,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:07,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:08,064 INFO L130 PetriNetUnfolder]: 158/949 cut-off events. [2022-11-02 20:58:08,064 INFO L131 PetriNetUnfolder]: For 62/63 co-relation queries the response was YES. [2022-11-02 20:58:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 949 events. 158/949 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2575 event pairs, 10 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1114. Up to 174 conditions per place. [2022-11-02 20:58:08,078 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 30 selfloop transitions, 2 changer transitions 0/505 dead transitions. [2022-11-02 20:58:08,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 505 transitions, 1108 flow [2022-11-02 20:58:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:08,083 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:08,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:08,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:08,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:08,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:08,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,094 INFO L175 Difference]: Start difference. First operand has 495 places, 506 transitions, 1046 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:08,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 505 transitions, 1108 flow [2022-11-02 20:58:08,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 505 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:08,105 INFO L231 Difference]: Finished difference. Result has 494 places, 505 transitions, 1044 flow [2022-11-02 20:58:08,107 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=494, PETRI_TRANSITIONS=505} [2022-11-02 20:58:08,107 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -164 predicate places. [2022-11-02 20:58:08,108 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 505 transitions, 1044 flow [2022-11-02 20:58:08,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:08,109 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] [2022-11-02 20:58:08,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:58:08,109 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:08,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash -159245978, now seen corresponding path program 1 times [2022-11-02 20:58:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:08,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128926240] [2022-11-02 20:58:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:08,189 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:58:08,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:08,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128926240] [2022-11-02 20:58:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128926240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:08,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:08,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683133686] [2022-11-02 20:58:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:08,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:08,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:08,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:08,198 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:08,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 505 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:08,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:08,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:08,678 INFO L130 PetriNetUnfolder]: 303/1347 cut-off events. [2022-11-02 20:58:08,678 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-11-02 20:58:08,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1347 events. 303/1347 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4893 event pairs, 16 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1705. Up to 167 conditions per place. [2022-11-02 20:58:08,704 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 48 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2022-11-02 20:58:08,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 526 transitions, 1208 flow [2022-11-02 20:58:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1618 transitions. [2022-11-02 20:58:08,708 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7628477133427628 [2022-11-02 20:58:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1618 transitions. [2022-11-02 20:58:08,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1618 transitions. [2022-11-02 20:58:08,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:08,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1618 transitions. [2022-11-02 20:58:08,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,719 INFO L175 Difference]: Start difference. First operand has 494 places, 505 transitions, 1044 flow. Second operand 3 states and 1618 transitions. [2022-11-02 20:58:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 526 transitions, 1208 flow [2022-11-02 20:58:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 526 transitions, 1204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:08,729 INFO L231 Difference]: Finished difference. Result has 494 places, 505 transitions, 1048 flow [2022-11-02 20:58:08,730 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=494, PETRI_TRANSITIONS=505} [2022-11-02 20:58:08,731 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -164 predicate places. [2022-11-02 20:58:08,731 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 505 transitions, 1048 flow [2022-11-02 20:58:08,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:08,734 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:58:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:58:08,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1359361916, now seen corresponding path program 1 times [2022-11-02 20:58:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:08,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524789756] [2022-11-02 20:58:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:08,800 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:58:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524789756] [2022-11-02 20:58:08,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524789756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:08,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:08,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221829538] [2022-11-02 20:58:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:08,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:08,805 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:08,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 505 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:08,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:08,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:09,249 INFO L130 PetriNetUnfolder]: 303/1374 cut-off events. [2022-11-02 20:58:09,249 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-11-02 20:58:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1374 events. 303/1374 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5103 event pairs, 30 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 1767. Up to 323 conditions per place. [2022-11-02 20:58:09,273 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 28 selfloop transitions, 2 changer transitions 0/504 dead transitions. [2022-11-02 20:58:09,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 504 transitions, 1106 flow [2022-11-02 20:58:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:09,277 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:09,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:09,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:09,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:09,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:09,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,287 INFO L175 Difference]: Start difference. First operand has 494 places, 505 transitions, 1048 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:09,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 504 transitions, 1106 flow [2022-11-02 20:58:09,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 504 transitions, 1104 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:09,296 INFO L231 Difference]: Finished difference. Result has 494 places, 504 transitions, 1048 flow [2022-11-02 20:58:09,298 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=494, PETRI_TRANSITIONS=504} [2022-11-02 20:58:09,298 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -164 predicate places. [2022-11-02 20:58:09,298 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 504 transitions, 1048 flow [2022-11-02 20:58:09,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:09,300 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] [2022-11-02 20:58:09,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:58:09,300 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash -121120091, now seen corresponding path program 1 times [2022-11-02 20:58:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:09,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945876587] [2022-11-02 20:58:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,363 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:58:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:09,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945876587] [2022-11-02 20:58:09,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945876587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:09,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:09,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378419784] [2022-11-02 20:58:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:09,367 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:09,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 504 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:09,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:09,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:09,853 INFO L130 PetriNetUnfolder]: 300/1430 cut-off events. [2022-11-02 20:58:09,853 INFO L131 PetriNetUnfolder]: For 142/143 co-relation queries the response was YES. [2022-11-02 20:58:09,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1430 events. 300/1430 cut-off events. For 142/143 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5754 event pairs, 30 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 1816. Up to 326 conditions per place. [2022-11-02 20:58:09,877 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 31 selfloop transitions, 2 changer transitions 0/503 dead transitions. [2022-11-02 20:58:09,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 503 transitions, 1112 flow [2022-11-02 20:58:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:09,881 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:09,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:09,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:09,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:09,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:09,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,891 INFO L175 Difference]: Start difference. First operand has 494 places, 504 transitions, 1048 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:09,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 503 transitions, 1112 flow [2022-11-02 20:58:09,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 503 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:09,900 INFO L231 Difference]: Finished difference. Result has 493 places, 503 transitions, 1046 flow [2022-11-02 20:58:09,901 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=493, PETRI_TRANSITIONS=503} [2022-11-02 20:58:09,902 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -165 predicate places. [2022-11-02 20:58:09,902 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 503 transitions, 1046 flow [2022-11-02 20:58:09,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:09,903 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] [2022-11-02 20:58:09,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:58:09,903 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1268068674, now seen corresponding path program 1 times [2022-11-02 20:58:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:09,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618829678] [2022-11-02 20:58:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,962 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:58:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:09,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618829678] [2022-11-02 20:58:09,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618829678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:09,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:09,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120991805] [2022-11-02 20:58:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:09,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:09,968 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:09,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 503 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:09,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:09,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:09,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:10,416 INFO L130 PetriNetUnfolder]: 303/1372 cut-off events. [2022-11-02 20:58:10,416 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-11-02 20:58:10,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1372 events. 303/1372 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5155 event pairs, 30 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 1755. Up to 321 conditions per place. [2022-11-02 20:58:10,437 INFO L137 encePairwiseOnDemand]: 705/707 looper letters, 28 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2022-11-02 20:58:10,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 502 transitions, 1102 flow [2022-11-02 20:58:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1600 transitions. [2022-11-02 20:58:10,442 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543611504007544 [2022-11-02 20:58:10,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1600 transitions. [2022-11-02 20:58:10,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1600 transitions. [2022-11-02 20:58:10,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:10,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1600 transitions. [2022-11-02 20:58:10,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,455 INFO L175 Difference]: Start difference. First operand has 493 places, 503 transitions, 1046 flow. Second operand 3 states and 1600 transitions. [2022-11-02 20:58:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 502 transitions, 1102 flow [2022-11-02 20:58:10,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 502 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:10,464 INFO L231 Difference]: Finished difference. Result has 492 places, 502 transitions, 1042 flow [2022-11-02 20:58:10,465 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=492, PETRI_TRANSITIONS=502} [2022-11-02 20:58:10,465 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -166 predicate places. [2022-11-02 20:58:10,466 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 502 transitions, 1042 flow [2022-11-02 20:58:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:10,467 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] [2022-11-02 20:58:10,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:58:10,467 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1224142506, now seen corresponding path program 1 times [2022-11-02 20:58:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:10,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502274149] [2022-11-02 20:58:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:10,536 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:58:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502274149] [2022-11-02 20:58:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502274149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:10,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:10,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757226400] [2022-11-02 20:58:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:10,541 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:10,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 502 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:10,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:10,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:10,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:11,053 INFO L130 PetriNetUnfolder]: 303/1371 cut-off events. [2022-11-02 20:58:11,053 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-11-02 20:58:11,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 1371 events. 303/1371 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5143 event pairs, 30 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 1753. Up to 323 conditions per place. [2022-11-02 20:58:11,076 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 28 selfloop transitions, 2 changer transitions 0/501 dead transitions. [2022-11-02 20:58:11,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 501 transitions, 1100 flow [2022-11-02 20:58:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:11,081 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:11,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:11,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:11,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:11,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:11,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,093 INFO L175 Difference]: Start difference. First operand has 492 places, 502 transitions, 1042 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:11,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 501 transitions, 1100 flow [2022-11-02 20:58:11,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 501 transitions, 1099 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:11,104 INFO L231 Difference]: Finished difference. Result has 492 places, 501 transitions, 1043 flow [2022-11-02 20:58:11,105 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=492, PETRI_TRANSITIONS=501} [2022-11-02 20:58:11,106 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -166 predicate places. [2022-11-02 20:58:11,106 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 501 transitions, 1043 flow [2022-11-02 20:58:11,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:11,108 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] [2022-11-02 20:58:11,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:58:11,108 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 69853625, now seen corresponding path program 1 times [2022-11-02 20:58:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:11,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8869185] [2022-11-02 20:58:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,226 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:58:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:11,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8869185] [2022-11-02 20:58:11,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8869185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:11,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:11,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394038800] [2022-11-02 20:58:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:11,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:11,232 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:11,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 501 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:11,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:11,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:11,743 INFO L130 PetriNetUnfolder]: 300/1427 cut-off events. [2022-11-02 20:58:11,744 INFO L131 PetriNetUnfolder]: For 142/143 co-relation queries the response was YES. [2022-11-02 20:58:11,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1427 events. 300/1427 cut-off events. For 142/143 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5737 event pairs, 30 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 1814. Up to 326 conditions per place. [2022-11-02 20:58:11,769 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 31 selfloop transitions, 2 changer transitions 0/500 dead transitions. [2022-11-02 20:58:11,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 500 transitions, 1107 flow [2022-11-02 20:58:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:11,774 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:11,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:11,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:11,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:11,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:11,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,786 INFO L175 Difference]: Start difference. First operand has 492 places, 501 transitions, 1043 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:11,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 500 transitions, 1107 flow [2022-11-02 20:58:11,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 500 transitions, 1103 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:11,796 INFO L231 Difference]: Finished difference. Result has 491 places, 500 transitions, 1041 flow [2022-11-02 20:58:11,796 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=491, PETRI_TRANSITIONS=500} [2022-11-02 20:58:11,797 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -167 predicate places. [2022-11-02 20:58:11,797 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 500 transitions, 1041 flow [2022-11-02 20:58:11,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:11,798 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] [2022-11-02 20:58:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:58:11,799 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash 969333769, now seen corresponding path program 1 times [2022-11-02 20:58:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866269541] [2022-11-02 20:58:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,867 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:58:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:11,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866269541] [2022-11-02 20:58:11,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866269541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:11,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:11,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658310194] [2022-11-02 20:58:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:11,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:11,871 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:11,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 500 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:11,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:11,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:11,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:12,617 INFO L130 PetriNetUnfolder]: 555/2173 cut-off events. [2022-11-02 20:58:12,617 INFO L131 PetriNetUnfolder]: For 263/267 co-relation queries the response was YES. [2022-11-02 20:58:12,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2173 events. 555/2173 cut-off events. For 263/267 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11156 event pairs, 30 based on Foata normal form. 4/1803 useless extension candidates. Maximal degree in co-relation 2917. Up to 299 conditions per place. [2022-11-02 20:58:12,665 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 49 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2022-11-02 20:58:12,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 521 transitions, 1210 flow [2022-11-02 20:58:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1617 transitions. [2022-11-02 20:58:12,669 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7623762376237624 [2022-11-02 20:58:12,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1617 transitions. [2022-11-02 20:58:12,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1617 transitions. [2022-11-02 20:58:12,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:12,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1617 transitions. [2022-11-02 20:58:12,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 539.0) internal successors, (1617), 3 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,678 INFO L175 Difference]: Start difference. First operand has 491 places, 500 transitions, 1041 flow. Second operand 3 states and 1617 transitions. [2022-11-02 20:58:12,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 521 transitions, 1210 flow [2022-11-02 20:58:12,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 521 transitions, 1206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:12,688 INFO L231 Difference]: Finished difference. Result has 491 places, 500 transitions, 1045 flow [2022-11-02 20:58:12,689 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=491, PETRI_TRANSITIONS=500} [2022-11-02 20:58:12,689 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -167 predicate places. [2022-11-02 20:58:12,690 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 500 transitions, 1045 flow [2022-11-02 20:58:12,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:12,691 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] [2022-11-02 20:58:12,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:58:12,691 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 161610356, now seen corresponding path program 1 times [2022-11-02 20:58:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:12,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860846314] [2022-11-02 20:58:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,771 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:58:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860846314] [2022-11-02 20:58:12,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860846314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:12,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:12,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:12,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717344701] [2022-11-02 20:58:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:12,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:12,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:12,779 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:12,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 500 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:12,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:12,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:13,489 INFO L130 PetriNetUnfolder]: 551/2176 cut-off events. [2022-11-02 20:58:13,489 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-11-02 20:58:13,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 2176 events. 551/2176 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11161 event pairs, 82 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 3003. Up to 591 conditions per place. [2022-11-02 20:58:13,538 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 29 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2022-11-02 20:58:13,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 499 transitions, 1105 flow [2022-11-02 20:58:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:13,542 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:13,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:13,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:13,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:13,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:13,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,551 INFO L175 Difference]: Start difference. First operand has 491 places, 500 transitions, 1045 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:13,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 499 transitions, 1105 flow [2022-11-02 20:58:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 499 transitions, 1103 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:13,560 INFO L231 Difference]: Finished difference. Result has 491 places, 499 transitions, 1045 flow [2022-11-02 20:58:13,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=491, PETRI_TRANSITIONS=499} [2022-11-02 20:58:13,561 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -167 predicate places. [2022-11-02 20:58:13,562 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 499 transitions, 1045 flow [2022-11-02 20:58:13,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:13,563 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] [2022-11-02 20:58:13,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:58:13,563 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -311383579, now seen corresponding path program 1 times [2022-11-02 20:58:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:13,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491877289] [2022-11-02 20:58:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:13,634 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:58:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491877289] [2022-11-02 20:58:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491877289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:13,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:13,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234757088] [2022-11-02 20:58:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:13,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:13,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:13,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:13,639 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 707 [2022-11-02 20:58:13,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 499 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:13,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 707 [2022-11-02 20:58:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:14,400 INFO L130 PetriNetUnfolder]: 551/2175 cut-off events. [2022-11-02 20:58:14,401 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-11-02 20:58:14,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 2175 events. 551/2175 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11088 event pairs, 82 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 2979. Up to 594 conditions per place. [2022-11-02 20:58:14,434 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 32 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2022-11-02 20:58:14,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 498 transitions, 1111 flow [2022-11-02 20:58:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1595 transitions. [2022-11-02 20:58:14,438 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.752003771805752 [2022-11-02 20:58:14,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1595 transitions. [2022-11-02 20:58:14,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1595 transitions. [2022-11-02 20:58:14,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:14,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1595 transitions. [2022-11-02 20:58:14,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.6666666666666) internal successors, (1595), 3 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:14,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:14,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:14,446 INFO L175 Difference]: Start difference. First operand has 491 places, 499 transitions, 1045 flow. Second operand 3 states and 1595 transitions. [2022-11-02 20:58:14,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 498 transitions, 1111 flow [2022-11-02 20:58:14,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 498 transitions, 1107 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:14,455 INFO L231 Difference]: Finished difference. Result has 490 places, 498 transitions, 1043 flow [2022-11-02 20:58:14,456 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=490, PETRI_TRANSITIONS=498} [2022-11-02 20:58:14,457 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -168 predicate places. [2022-11-02 20:58:14,457 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 498 transitions, 1043 flow [2022-11-02 20:58:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 523.3333333333334) internal successors, (1570), 3 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:14,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:14,458 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] [2022-11-02 20:58:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:58:14,460 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 364000701, now seen corresponding path program 1 times [2022-11-02 20:58:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894789264] [2022-11-02 20:58:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,530 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:58:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:14,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894789264] [2022-11-02 20:58:14,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894789264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:14,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:14,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137849822] [2022-11-02 20:58:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:14,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:14,534 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:14,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 498 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:14,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:14,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:14,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:15,266 INFO L130 PetriNetUnfolder]: 551/2174 cut-off events. [2022-11-02 20:58:15,266 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-11-02 20:58:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 2174 events. 551/2174 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11103 event pairs, 82 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 2975. Up to 589 conditions per place. [2022-11-02 20:58:15,307 INFO L137 encePairwiseOnDemand]: 705/707 looper letters, 29 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2022-11-02 20:58:15,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 497 transitions, 1101 flow [2022-11-02 20:58:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1600 transitions. [2022-11-02 20:58:15,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7543611504007544 [2022-11-02 20:58:15,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1600 transitions. [2022-11-02 20:58:15,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1600 transitions. [2022-11-02 20:58:15,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:15,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1600 transitions. [2022-11-02 20:58:15,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.3333333333334) internal successors, (1600), 3 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:15,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:15,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:15,324 INFO L175 Difference]: Start difference. First operand has 490 places, 498 transitions, 1043 flow. Second operand 3 states and 1600 transitions. [2022-11-02 20:58:15,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 497 transitions, 1101 flow [2022-11-02 20:58:15,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 497 transitions, 1097 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:15,335 INFO L231 Difference]: Finished difference. Result has 489 places, 497 transitions, 1039 flow [2022-11-02 20:58:15,336 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=489, PETRI_TRANSITIONS=497} [2022-11-02 20:58:15,336 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -169 predicate places. [2022-11-02 20:58:15,337 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 497 transitions, 1039 flow [2022-11-02 20:58:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:15,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:15,338 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] [2022-11-02 20:58:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:58:15,339 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1039423489, now seen corresponding path program 1 times [2022-11-02 20:58:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:15,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280028183] [2022-11-02 20:58:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:15,432 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:58:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280028183] [2022-11-02 20:58:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280028183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:15,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:15,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624918409] [2022-11-02 20:58:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:15,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:15,438 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:15,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 497 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:15,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:15,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:15,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:16,206 INFO L130 PetriNetUnfolder]: 551/2173 cut-off events. [2022-11-02 20:58:16,207 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-11-02 20:58:16,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 2173 events. 551/2173 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11117 event pairs, 82 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 2973. Up to 591 conditions per place. [2022-11-02 20:58:16,242 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 29 selfloop transitions, 2 changer transitions 0/496 dead transitions. [2022-11-02 20:58:16,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 496 transitions, 1099 flow [2022-11-02 20:58:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:16,246 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:16,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:16,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:16,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:16,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:16,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:16,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:16,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:16,256 INFO L175 Difference]: Start difference. First operand has 489 places, 497 transitions, 1039 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:16,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 496 transitions, 1099 flow [2022-11-02 20:58:16,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 496 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:16,264 INFO L231 Difference]: Finished difference. Result has 489 places, 496 transitions, 1040 flow [2022-11-02 20:58:16,266 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=489, PETRI_TRANSITIONS=496} [2022-11-02 20:58:16,266 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -169 predicate places. [2022-11-02 20:58:16,266 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 496 transitions, 1040 flow [2022-11-02 20:58:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:16,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:16,267 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] [2022-11-02 20:58:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:58:16,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 647721511, now seen corresponding path program 1 times [2022-11-02 20:58:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86076695] [2022-11-02 20:58:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,350 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:58:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:16,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86076695] [2022-11-02 20:58:16,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86076695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:16,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:16,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940561769] [2022-11-02 20:58:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:16,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:16,355 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:16,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 496 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:16,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:16,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:16,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:17,094 INFO L130 PetriNetUnfolder]: 548/2249 cut-off events. [2022-11-02 20:58:17,095 INFO L131 PetriNetUnfolder]: For 318/319 co-relation queries the response was YES. [2022-11-02 20:58:17,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 2249 events. 548/2249 cut-off events. For 318/319 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 12044 event pairs, 82 based on Foata normal form. 0/1844 useless extension candidates. Maximal degree in co-relation 3051. Up to 591 conditions per place. [2022-11-02 20:58:17,138 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 29 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2022-11-02 20:58:17,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 495 transitions, 1100 flow [2022-11-02 20:58:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:17,143 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:17,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:17,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,151 INFO L175 Difference]: Start difference. First operand has 489 places, 496 transitions, 1040 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:17,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 495 transitions, 1100 flow [2022-11-02 20:58:17,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 495 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:17,160 INFO L231 Difference]: Finished difference. Result has 488 places, 495 transitions, 1038 flow [2022-11-02 20:58:17,161 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=488, PETRI_TRANSITIONS=495} [2022-11-02 20:58:17,162 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -170 predicate places. [2022-11-02 20:58:17,162 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 495 transitions, 1038 flow [2022-11-02 20:58:17,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:17,163 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, 1, 1] [2022-11-02 20:58:17,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:58:17,164 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -569659295, now seen corresponding path program 1 times [2022-11-02 20:58:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:17,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565321857] [2022-11-02 20:58:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,245 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:58:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:17,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565321857] [2022-11-02 20:58:17,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565321857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:17,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:17,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924094606] [2022-11-02 20:58:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:17,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:17,250 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:17,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 495 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:17,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:17,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:17,946 INFO L130 PetriNetUnfolder]: 551/2171 cut-off events. [2022-11-02 20:58:17,946 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-11-02 20:58:17,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 2171 events. 551/2171 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11144 event pairs, 82 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 2973. Up to 591 conditions per place. [2022-11-02 20:58:17,984 INFO L137 encePairwiseOnDemand]: 704/707 looper letters, 29 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2022-11-02 20:58:17,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 494 transitions, 1098 flow [2022-11-02 20:58:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1601 transitions. [2022-11-02 20:58:17,990 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7548326261197549 [2022-11-02 20:58:17,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:17,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1601 transitions. [2022-11-02 20:58:17,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.6666666666666) internal successors, (1601), 3 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,999 INFO L175 Difference]: Start difference. First operand has 488 places, 495 transitions, 1038 flow. Second operand 3 states and 1601 transitions. [2022-11-02 20:58:17,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 494 transitions, 1098 flow [2022-11-02 20:58:18,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 494 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:18,009 INFO L231 Difference]: Finished difference. Result has 487 places, 494 transitions, 1036 flow [2022-11-02 20:58:18,010 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=487, PETRI_TRANSITIONS=494} [2022-11-02 20:58:18,010 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -171 predicate places. [2022-11-02 20:58:18,011 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 494 transitions, 1036 flow [2022-11-02 20:58:18,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:18,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:18,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:58:18,012 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 280493566, now seen corresponding path program 1 times [2022-11-02 20:58:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366392755] [2022-11-02 20:58:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:18,094 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:58:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:18,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366392755] [2022-11-02 20:58:18,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366392755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:18,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:18,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377007022] [2022-11-02 20:58:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:18,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:18,099 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 707 [2022-11-02 20:58:18,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 494 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:18,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:18,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 707 [2022-11-02 20:58:18,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:20,330 INFO L130 PetriNetUnfolder]: 2636/7019 cut-off events. [2022-11-02 20:58:20,330 INFO L131 PetriNetUnfolder]: For 1294/1310 co-relation queries the response was YES. [2022-11-02 20:58:20,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11418 conditions, 7019 events. 2636/7019 cut-off events. For 1294/1310 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 52848 event pairs, 378 based on Foata normal form. 4/5950 useless extension candidates. Maximal degree in co-relation 11343. Up to 2446 conditions per place. [2022-11-02 20:58:20,461 INFO L137 encePairwiseOnDemand]: 694/707 looper letters, 45 selfloop transitions, 10 changer transitions 0/505 dead transitions. [2022-11-02 20:58:20,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 505 transitions, 1187 flow [2022-11-02 20:58:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1591 transitions. [2022-11-02 20:58:20,467 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7501178689297501 [2022-11-02 20:58:20,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1591 transitions. [2022-11-02 20:58:20,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1591 transitions. [2022-11-02 20:58:20,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:20,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1591 transitions. [2022-11-02 20:58:20,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:20,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:20,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:20,478 INFO L175 Difference]: Start difference. First operand has 487 places, 494 transitions, 1036 flow. Second operand 3 states and 1591 transitions. [2022-11-02 20:58:20,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 505 transitions, 1187 flow [2022-11-02 20:58:20,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 505 transitions, 1183 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:58:20,490 INFO L231 Difference]: Finished difference. Result has 482 places, 489 transitions, 1054 flow [2022-11-02 20:58:20,491 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=482, PETRI_TRANSITIONS=489} [2022-11-02 20:58:20,492 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -176 predicate places. [2022-11-02 20:58:20,492 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 489 transitions, 1054 flow [2022-11-02 20:58:20,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.0) internal successors, (1542), 3 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:20,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:20,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:20,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:58:20,494 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 338753014, now seen corresponding path program 1 times [2022-11-02 20:58:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:20,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116037943] [2022-11-02 20:58:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:20,616 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:58:20,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:20,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116037943] [2022-11-02 20:58:20,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116037943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:20,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:20,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919761208] [2022-11-02 20:58:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:20,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:20,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:20,621 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:20,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 489 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:20,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:20,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:20,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:22,885 INFO L130 PetriNetUnfolder]: 2648/6061 cut-off events. [2022-11-02 20:58:22,885 INFO L131 PetriNetUnfolder]: For 4958/5062 co-relation queries the response was YES. [2022-11-02 20:58:22,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 6061 events. 2648/6061 cut-off events. For 4958/5062 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 38760 event pairs, 130 based on Foata normal form. 25/5328 useless extension candidates. Maximal degree in co-relation 11231. Up to 2268 conditions per place. [2022-11-02 20:58:22,964 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 48 selfloop transitions, 4 changer transitions 0/509 dead transitions. [2022-11-02 20:58:22,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 509 transitions, 1251 flow [2022-11-02 20:58:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1618 transitions. [2022-11-02 20:58:22,968 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7628477133427628 [2022-11-02 20:58:22,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1618 transitions. [2022-11-02 20:58:22,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1618 transitions. [2022-11-02 20:58:22,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:22,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1618 transitions. [2022-11-02 20:58:22,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 539.3333333333334) internal successors, (1618), 3 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,976 INFO L175 Difference]: Start difference. First operand has 482 places, 489 transitions, 1054 flow. Second operand 3 states and 1618 transitions. [2022-11-02 20:58:22,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 509 transitions, 1251 flow [2022-11-02 20:58:22,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 509 transitions, 1232 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:22,990 INFO L231 Difference]: Finished difference. Result has 482 places, 488 transitions, 1056 flow [2022-11-02 20:58:22,991 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=482, PETRI_TRANSITIONS=488} [2022-11-02 20:58:22,991 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -176 predicate places. [2022-11-02 20:58:22,992 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 488 transitions, 1056 flow [2022-11-02 20:58:22,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.3333333333334) internal successors, (1579), 3 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:22,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:22,993 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, 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:58:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:58:22,993 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1654970831, now seen corresponding path program 1 times [2022-11-02 20:58:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:22,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454715599] [2022-11-02 20:58:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,120 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:58:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:23,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454715599] [2022-11-02 20:58:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454715599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:23,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694902490] [2022-11-02 20:58:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:23,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:23,125 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:23,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 488 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 526.6666666666666) internal successors, (1580), 3 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:23,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:23,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:26,615 INFO L130 PetriNetUnfolder]: 3666/10954 cut-off events. [2022-11-02 20:58:26,616 INFO L131 PetriNetUnfolder]: For 5612/5730 co-relation queries the response was YES. [2022-11-02 20:58:26,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18160 conditions, 10954 events. 3666/10954 cut-off events. For 5612/5730 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 100222 event pairs, 418 based on Foata normal form. 21/8879 useless extension candidates. Maximal degree in co-relation 18084. Up to 3192 conditions per place. [2022-11-02 20:58:26,736 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 47 selfloop transitions, 4 changer transitions 0/507 dead transitions. [2022-11-02 20:58:26,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 507 transitions, 1248 flow [2022-11-02 20:58:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1617 transitions. [2022-11-02 20:58:26,741 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7623762376237624 [2022-11-02 20:58:26,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1617 transitions. [2022-11-02 20:58:26,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1617 transitions. [2022-11-02 20:58:26,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:26,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1617 transitions. [2022-11-02 20:58:26,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 539.0) internal successors, (1617), 3 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:26,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:26,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:26,750 INFO L175 Difference]: Start difference. First operand has 482 places, 488 transitions, 1056 flow. Second operand 3 states and 1617 transitions. [2022-11-02 20:58:26,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 507 transitions, 1248 flow [2022-11-02 20:58:26,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 507 transitions, 1241 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:26,764 INFO L231 Difference]: Finished difference. Result has 482 places, 487 transitions, 1064 flow [2022-11-02 20:58:26,765 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=482, PETRI_TRANSITIONS=487} [2022-11-02 20:58:26,766 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -176 predicate places. [2022-11-02 20:58:26,766 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 487 transitions, 1064 flow [2022-11-02 20:58:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 526.6666666666666) internal successors, (1580), 3 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:26,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:26,767 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, 1, 1, 1, 1, 1, 1, 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:58:26,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:58:26,767 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -860791615, now seen corresponding path program 1 times [2022-11-02 20:58:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:26,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191689733] [2022-11-02 20:58:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,860 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:58:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191689733] [2022-11-02 20:58:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191689733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:26,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489291456] [2022-11-02 20:58:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:26,865 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:26,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 487 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 527.0) internal successors, (1581), 3 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:26,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:26,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:30,661 INFO L130 PetriNetUnfolder]: 3825/12084 cut-off events. [2022-11-02 20:58:30,662 INFO L131 PetriNetUnfolder]: For 8864/9129 co-relation queries the response was YES. [2022-11-02 20:58:30,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20975 conditions, 12084 events. 3825/12084 cut-off events. For 8864/9129 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 121909 event pairs, 498 based on Foata normal form. 64/10057 useless extension candidates. Maximal degree in co-relation 20898. Up to 3888 conditions per place. [2022-11-02 20:58:30,898 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 46 selfloop transitions, 4 changer transitions 0/505 dead transitions. [2022-11-02 20:58:30,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 505 transitions, 1257 flow [2022-11-02 20:58:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1616 transitions. [2022-11-02 20:58:30,903 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2022-11-02 20:58:30,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1616 transitions. [2022-11-02 20:58:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1616 transitions. [2022-11-02 20:58:30,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:30,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1616 transitions. [2022-11-02 20:58:30,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 538.6666666666666) internal successors, (1616), 3 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:30,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:30,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:30,910 INFO L175 Difference]: Start difference. First operand has 482 places, 487 transitions, 1064 flow. Second operand 3 states and 1616 transitions. [2022-11-02 20:58:30,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 505 transitions, 1257 flow [2022-11-02 20:58:30,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 505 transitions, 1250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:30,923 INFO L231 Difference]: Finished difference. Result has 482 places, 486 transitions, 1072 flow [2022-11-02 20:58:30,924 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=482, PETRI_TRANSITIONS=486} [2022-11-02 20:58:30,925 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -176 predicate places. [2022-11-02 20:58:30,925 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 486 transitions, 1072 flow [2022-11-02 20:58:30,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 527.0) internal successors, (1581), 3 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:30,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:30,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:58:30,926 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash 571040956, now seen corresponding path program 1 times [2022-11-02 20:58:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:30,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162255764] [2022-11-02 20:58:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,852 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:58:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162255764] [2022-11-02 20:58:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162255764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:31,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849161641] [2022-11-02 20:58:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:31,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:31,858 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 707 [2022-11-02 20:58:31,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 486 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 479.1666666666667) internal successors, (2875), 6 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:31,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:31,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 707 [2022-11-02 20:58:31,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:37,679 INFO L130 PetriNetUnfolder]: 6431/10929 cut-off events. [2022-11-02 20:58:37,679 INFO L131 PetriNetUnfolder]: For 21192/21192 co-relation queries the response was YES. [2022-11-02 20:58:37,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29034 conditions, 10929 events. 6431/10929 cut-off events. For 21192/21192 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 63076 event pairs, 858 based on Foata normal form. 0/10165 useless extension candidates. Maximal degree in co-relation 28954. Up to 7168 conditions per place. [2022-11-02 20:58:37,952 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 141 selfloop transitions, 4 changer transitions 0/557 dead transitions. [2022-11-02 20:58:37,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 557 transitions, 1756 flow [2022-11-02 20:58:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:58:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2978 transitions. [2022-11-02 20:58:37,960 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.702027345591702 [2022-11-02 20:58:37,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2978 transitions. [2022-11-02 20:58:37,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2978 transitions. [2022-11-02 20:58:37,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:37,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2978 transitions. [2022-11-02 20:58:37,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 496.3333333333333) internal successors, (2978), 6 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,975 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:37,976 INFO L175 Difference]: Start difference. First operand has 482 places, 486 transitions, 1072 flow. Second operand 6 states and 2978 transitions. [2022-11-02 20:58:37,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 557 transitions, 1756 flow [2022-11-02 20:58:37,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 557 transitions, 1740 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:58:38,005 INFO L231 Difference]: Finished difference. Result has 485 places, 485 transitions, 1074 flow [2022-11-02 20:58:38,006 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=485, PETRI_TRANSITIONS=485} [2022-11-02 20:58:38,006 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -173 predicate places. [2022-11-02 20:58:38,006 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 485 transitions, 1074 flow [2022-11-02 20:58:38,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 479.1666666666667) internal successors, (2875), 6 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:38,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:38,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:58:38,008 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -802239077, now seen corresponding path program 1 times [2022-11-02 20:58:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958617095] [2022-11-02 20:58:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,086 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:58:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:39,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958617095] [2022-11-02 20:58:39,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958617095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:39,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:39,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634998940] [2022-11-02 20:58:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:39,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:39,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:39,093 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 707 [2022-11-02 20:58:39,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 485 transitions, 1074 flow. Second operand has 6 states, 6 states have (on average 480.1666666666667) internal successors, (2881), 6 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:39,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 707 [2022-11-02 20:58:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:43,550 INFO L130 PetriNetUnfolder]: 6235/10374 cut-off events. [2022-11-02 20:58:43,550 INFO L131 PetriNetUnfolder]: For 12448/12448 co-relation queries the response was YES. [2022-11-02 20:58:43,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28015 conditions, 10374 events. 6235/10374 cut-off events. For 12448/12448 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 58576 event pairs, 291 based on Foata normal form. 0/9648 useless extension candidates. Maximal degree in co-relation 27934. Up to 5632 conditions per place. [2022-11-02 20:58:43,886 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 104 selfloop transitions, 4 changer transitions 0/520 dead transitions. [2022-11-02 20:58:43,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 520 transitions, 1480 flow [2022-11-02 20:58:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:58:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2953 transitions. [2022-11-02 20:58:43,890 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6961338991041961 [2022-11-02 20:58:43,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2953 transitions. [2022-11-02 20:58:43,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2953 transitions. [2022-11-02 20:58:43,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:43,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2953 transitions. [2022-11-02 20:58:43,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 492.1666666666667) internal successors, (2953), 6 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:43,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:43,901 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:43,901 INFO L175 Difference]: Start difference. First operand has 485 places, 485 transitions, 1074 flow. Second operand 6 states and 2953 transitions. [2022-11-02 20:58:43,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 520 transitions, 1480 flow [2022-11-02 20:58:43,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 520 transitions, 1473 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:58:43,922 INFO L231 Difference]: Finished difference. Result has 485 places, 484 transitions, 1073 flow [2022-11-02 20:58:43,923 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1073, PETRI_PLACES=485, PETRI_TRANSITIONS=484} [2022-11-02 20:58:43,923 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -173 predicate places. [2022-11-02 20:58:43,923 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 484 transitions, 1073 flow [2022-11-02 20:58:43,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 480.1666666666667) internal successors, (2881), 6 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:43,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:43,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:58:43,925 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1186809364, now seen corresponding path program 1 times [2022-11-02 20:58:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:43,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734151845] [2022-11-02 20:58:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:44,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734151845] [2022-11-02 20:58:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734151845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953218535] [2022-11-02 20:58:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:44,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:44,708 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 707 [2022-11-02 20:58:44,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 484 transitions, 1073 flow. Second operand has 6 states, 6 states have (on average 481.1666666666667) internal successors, (2887), 6 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:44,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:44,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 707 [2022-11-02 20:58:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:48,746 INFO L130 PetriNetUnfolder]: 6064/10204 cut-off events. [2022-11-02 20:58:48,746 INFO L131 PetriNetUnfolder]: For 12123/12176 co-relation queries the response was YES. [2022-11-02 20:58:48,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27467 conditions, 10204 events. 6064/10204 cut-off events. For 12123/12176 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 58069 event pairs, 614 based on Foata normal form. 0/9485 useless extension candidates. Maximal degree in co-relation 27386. Up to 3584 conditions per place. [2022-11-02 20:58:49,017 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 91 selfloop transitions, 4 changer transitions 0/507 dead transitions. [2022-11-02 20:58:49,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 507 transitions, 1389 flow [2022-11-02 20:58:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:58:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2944 transitions. [2022-11-02 20:58:49,023 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.694012258368694 [2022-11-02 20:58:49,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2944 transitions. [2022-11-02 20:58:49,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2944 transitions. [2022-11-02 20:58:49,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:49,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2944 transitions. [2022-11-02 20:58:49,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 490.6666666666667) internal successors, (2944), 6 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,049 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,049 INFO L175 Difference]: Start difference. First operand has 485 places, 484 transitions, 1073 flow. Second operand 6 states and 2944 transitions. [2022-11-02 20:58:49,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 507 transitions, 1389 flow [2022-11-02 20:58:49,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 507 transitions, 1382 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:58:49,073 INFO L231 Difference]: Finished difference. Result has 485 places, 483 transitions, 1072 flow [2022-11-02 20:58:49,073 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=485, PETRI_TRANSITIONS=483} [2022-11-02 20:58:49,074 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -173 predicate places. [2022-11-02 20:58:49,074 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 483 transitions, 1072 flow [2022-11-02 20:58:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.1666666666667) internal successors, (2887), 6 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:49,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:58:49,076 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1822162996, now seen corresponding path program 1 times [2022-11-02 20:58:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:49,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668151501] [2022-11-02 20:58:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,939 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:58:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:49,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668151501] [2022-11-02 20:58:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668151501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:49,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568453413] [2022-11-02 20:58:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:49,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:49,944 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 707 [2022-11-02 20:58:49,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 483 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 482.1666666666667) internal successors, (2893), 6 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:49,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 707 [2022-11-02 20:58:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:53,676 INFO L130 PetriNetUnfolder]: 5855/9805 cut-off events. [2022-11-02 20:58:53,677 INFO L131 PetriNetUnfolder]: For 11736/11736 co-relation queries the response was YES. [2022-11-02 20:58:53,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26646 conditions, 9805 events. 5855/9805 cut-off events. For 11736/11736 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 54770 event pairs, 1006 based on Foata normal form. 0/9271 useless extension candidates. Maximal degree in co-relation 26565. Up to 5514 conditions per place. [2022-11-02 20:58:53,920 INFO L137 encePairwiseOnDemand]: 702/707 looper letters, 78 selfloop transitions, 4 changer transitions 0/494 dead transitions. [2022-11-02 20:58:53,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 494 transitions, 1298 flow [2022-11-02 20:58:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:58:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2935 transitions. [2022-11-02 20:58:53,925 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6918906176331919 [2022-11-02 20:58:53,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2935 transitions. [2022-11-02 20:58:53,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2935 transitions. [2022-11-02 20:58:53,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:53,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2935 transitions. [2022-11-02 20:58:53,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 489.1666666666667) internal successors, (2935), 6 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:53,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:53,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 707.0) internal successors, (4949), 7 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:53,936 INFO L175 Difference]: Start difference. First operand has 485 places, 483 transitions, 1072 flow. Second operand 6 states and 2935 transitions. [2022-11-02 20:58:53,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 494 transitions, 1298 flow [2022-11-02 20:58:53,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 494 transitions, 1291 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:58:53,957 INFO L231 Difference]: Finished difference. Result has 485 places, 482 transitions, 1071 flow [2022-11-02 20:58:53,958 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1071, PETRI_PLACES=485, PETRI_TRANSITIONS=482} [2022-11-02 20:58:53,958 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -173 predicate places. [2022-11-02 20:58:53,958 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 482 transitions, 1071 flow [2022-11-02 20:58:53,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 482.1666666666667) internal successors, (2893), 6 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:53,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:58:53,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:53,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:58:53,960 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 336 more)] === [2022-11-02 20:58:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 911504863, now seen corresponding path program 1 times [2022-11-02 20:58:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:53,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293990534] [2022-11-02 20:58:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,077 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:58:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:54,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293990534] [2022-11-02 20:58:54,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293990534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:54,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:54,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354704684] [2022-11-02 20:58:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:54,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:54,081 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 707 [2022-11-02 20:58:54,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 482 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 529.0) internal successors, (1587), 3 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:54,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:58:54,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 707 [2022-11-02 20:58:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:58:55,528 INFO L130 PetriNetUnfolder]: 1151/6257 cut-off events. [2022-11-02 20:58:55,528 INFO L131 PetriNetUnfolder]: For 2520/2520 co-relation queries the response was YES. [2022-11-02 20:58:55,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10190 conditions, 6257 events. 1151/6257 cut-off events. For 2520/2520 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 59381 event pairs, 210 based on Foata normal form. 256/5717 useless extension candidates. Maximal degree in co-relation 10109. Up to 1518 conditions per place. [2022-11-02 20:58:55,571 INFO L137 encePairwiseOnDemand]: 705/707 looper letters, 0 selfloop transitions, 0 changer transitions 481/481 dead transitions. [2022-11-02 20:58:55,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 481 transitions, 1127 flow [2022-11-02 20:58:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:58:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2022-11-02 20:58:55,573 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7538896746817539 [2022-11-02 20:58:55,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2022-11-02 20:58:55,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2022-11-02 20:58:55,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:58:55,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2022-11-02 20:58:55,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:55,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:55,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 707.0) internal successors, (2828), 4 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:55,576 INFO L175 Difference]: Start difference. First operand has 485 places, 482 transitions, 1071 flow. Second operand 3 states and 1599 transitions. [2022-11-02 20:58:55,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 481 transitions, 1127 flow [2022-11-02 20:58:55,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 481 transitions, 1120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:58:55,587 INFO L231 Difference]: Finished difference. Result has 482 places, 0 transitions, 0 flow [2022-11-02 20:58:55,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=707, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=482, PETRI_TRANSITIONS=0} [2022-11-02 20:58:55,588 INFO L287 CegarLoopForPetriNet]: 658 programPoint places, -176 predicate places. [2022-11-02 20:58:55,588 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 0 transitions, 0 flow [2022-11-02 20:58:55,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 529.0) internal successors, (1587), 3 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:55,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (339 of 340 remaining) [2022-11-02 20:58:55,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (338 of 340 remaining) [2022-11-02 20:58:55,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (337 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (336 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (335 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (334 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (333 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (332 of 340 remaining) [2022-11-02 20:58:55,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (331 of 340 remaining) [2022-11-02 20:58:55,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (330 of 340 remaining) [2022-11-02 20:58:55,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (329 of 340 remaining) [2022-11-02 20:58:55,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (328 of 340 remaining) [2022-11-02 20:58:55,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (327 of 340 remaining) [2022-11-02 20:58:55,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (326 of 340 remaining) [2022-11-02 20:58:55,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (325 of 340 remaining) [2022-11-02 20:58:55,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (324 of 340 remaining) [2022-11-02 20:58:55,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (323 of 340 remaining) [2022-11-02 20:58:55,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (322 of 340 remaining) [2022-11-02 20:58:55,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (321 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (320 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (319 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (318 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (317 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (316 of 340 remaining) [2022-11-02 20:58:55,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (315 of 340 remaining) [2022-11-02 20:58:55,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (314 of 340 remaining) [2022-11-02 20:58:55,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (313 of 340 remaining) [2022-11-02 20:58:55,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (312 of 340 remaining) [2022-11-02 20:58:55,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (311 of 340 remaining) [2022-11-02 20:58:55,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (310 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (309 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (308 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (307 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (306 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (305 of 340 remaining) [2022-11-02 20:58:55,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (304 of 340 remaining) [2022-11-02 20:58:55,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (303 of 340 remaining) [2022-11-02 20:58:55,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (302 of 340 remaining) [2022-11-02 20:58:55,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (301 of 340 remaining) [2022-11-02 20:58:55,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (300 of 340 remaining) [2022-11-02 20:58:55,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (299 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (298 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (297 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (296 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (295 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (294 of 340 remaining) [2022-11-02 20:58:55,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (293 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (292 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (291 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (290 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (289 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (288 of 340 remaining) [2022-11-02 20:58:55,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (287 of 340 remaining) [2022-11-02 20:58:55,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (286 of 340 remaining) [2022-11-02 20:58:55,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (285 of 340 remaining) [2022-11-02 20:58:55,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (284 of 340 remaining) [2022-11-02 20:58:55,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (283 of 340 remaining) [2022-11-02 20:58:55,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (282 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (281 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (280 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (279 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (278 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (277 of 340 remaining) [2022-11-02 20:58:55,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (276 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (275 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (274 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (273 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (272 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (271 of 340 remaining) [2022-11-02 20:58:55,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (270 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (269 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (268 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (267 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (266 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (265 of 340 remaining) [2022-11-02 20:58:55,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (264 of 340 remaining) [2022-11-02 20:58:55,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (263 of 340 remaining) [2022-11-02 20:58:55,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (262 of 340 remaining) [2022-11-02 20:58:55,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (261 of 340 remaining) [2022-11-02 20:58:55,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (260 of 340 remaining) [2022-11-02 20:58:55,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (259 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (258 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (257 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (256 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (255 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (254 of 340 remaining) [2022-11-02 20:58:55,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (253 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (252 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (251 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (250 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (249 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (248 of 340 remaining) [2022-11-02 20:58:55,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (247 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (246 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (245 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (244 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (243 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (242 of 340 remaining) [2022-11-02 20:58:55,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (241 of 340 remaining) [2022-11-02 20:58:55,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (240 of 340 remaining) [2022-11-02 20:58:55,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (239 of 340 remaining) [2022-11-02 20:58:55,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (238 of 340 remaining) [2022-11-02 20:58:55,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (237 of 340 remaining) [2022-11-02 20:58:55,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (236 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (235 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (234 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (233 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (232 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (231 of 340 remaining) [2022-11-02 20:58:55,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (230 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (229 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (228 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (227 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (226 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (225 of 340 remaining) [2022-11-02 20:58:55,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (224 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (223 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (222 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (221 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (220 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (219 of 340 remaining) [2022-11-02 20:58:55,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (218 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (217 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (216 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (215 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (214 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (213 of 340 remaining) [2022-11-02 20:58:55,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (212 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (211 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (210 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (209 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (208 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (207 of 340 remaining) [2022-11-02 20:58:55,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (206 of 340 remaining) [2022-11-02 20:58:55,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (205 of 340 remaining) [2022-11-02 20:58:55,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (204 of 340 remaining) [2022-11-02 20:58:55,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (203 of 340 remaining) [2022-11-02 20:58:55,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (202 of 340 remaining) [2022-11-02 20:58:55,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (201 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (200 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (199 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (198 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (197 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (196 of 340 remaining) [2022-11-02 20:58:55,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (195 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (194 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (193 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (192 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (191 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (190 of 340 remaining) [2022-11-02 20:58:55,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (189 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (188 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (187 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (186 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (185 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (184 of 340 remaining) [2022-11-02 20:58:55,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (183 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (182 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (181 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (180 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (179 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (178 of 340 remaining) [2022-11-02 20:58:55,620 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (177 of 340 remaining) [2022-11-02 20:58:55,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (176 of 340 remaining) [2022-11-02 20:58:55,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (175 of 340 remaining) [2022-11-02 20:58:55,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (174 of 340 remaining) [2022-11-02 20:58:55,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (173 of 340 remaining) [2022-11-02 20:58:55,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (172 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (171 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (170 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (169 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (168 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (167 of 340 remaining) [2022-11-02 20:58:55,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (166 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (165 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (164 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (163 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (162 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (161 of 340 remaining) [2022-11-02 20:58:55,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (160 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (159 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (158 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (157 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (156 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (155 of 340 remaining) [2022-11-02 20:58:55,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (154 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (153 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (152 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (151 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (150 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 340 remaining) [2022-11-02 20:58:55,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (148 of 340 remaining) [2022-11-02 20:58:55,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (147 of 340 remaining) [2022-11-02 20:58:55,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (146 of 340 remaining) [2022-11-02 20:58:55,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (145 of 340 remaining) [2022-11-02 20:58:55,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (144 of 340 remaining) [2022-11-02 20:58:55,626 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (143 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (142 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (141 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (140 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (139 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (138 of 340 remaining) [2022-11-02 20:58:55,627 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (137 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (136 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (134 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (133 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (132 of 340 remaining) [2022-11-02 20:58:55,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (131 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (130 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (129 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (128 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (127 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (126 of 340 remaining) [2022-11-02 20:58:55,629 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (125 of 340 remaining) [2022-11-02 20:58:55,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (124 of 340 remaining) [2022-11-02 20:58:55,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (123 of 340 remaining) [2022-11-02 20:58:55,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (122 of 340 remaining) [2022-11-02 20:58:55,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (121 of 340 remaining) [2022-11-02 20:58:55,630 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (120 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (119 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (118 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (117 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (116 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (115 of 340 remaining) [2022-11-02 20:58:55,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (114 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (113 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (112 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (111 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (110 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (109 of 340 remaining) [2022-11-02 20:58:55,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (108 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (107 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (106 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (105 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (104 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (103 of 340 remaining) [2022-11-02 20:58:55,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (102 of 340 remaining) [2022-11-02 20:58:55,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (101 of 340 remaining) [2022-11-02 20:58:55,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (100 of 340 remaining) [2022-11-02 20:58:55,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (99 of 340 remaining) [2022-11-02 20:58:55,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (98 of 340 remaining) [2022-11-02 20:58:55,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (97 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (96 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (95 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (94 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (93 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (92 of 340 remaining) [2022-11-02 20:58:55,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (91 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (90 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (89 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (88 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (87 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (86 of 340 remaining) [2022-11-02 20:58:55,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (85 of 340 remaining) [2022-11-02 20:58:55,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (84 of 340 remaining) [2022-11-02 20:58:55,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (83 of 340 remaining) [2022-11-02 20:58:55,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (82 of 340 remaining) [2022-11-02 20:58:55,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (81 of 340 remaining) [2022-11-02 20:58:55,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (80 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (79 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (78 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (77 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (76 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (75 of 340 remaining) [2022-11-02 20:58:55,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (72 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (71 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (70 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (69 of 340 remaining) [2022-11-02 20:58:55,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (68 of 340 remaining) [2022-11-02 20:58:55,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (67 of 340 remaining) [2022-11-02 20:58:55,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (66 of 340 remaining) [2022-11-02 20:58:55,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (65 of 340 remaining) [2022-11-02 20:58:55,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 340 remaining) [2022-11-02 20:58:55,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (63 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (62 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (61 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (60 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (59 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (58 of 340 remaining) [2022-11-02 20:58:55,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (57 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (56 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (55 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (54 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (53 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (52 of 340 remaining) [2022-11-02 20:58:55,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (51 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (50 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (49 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (46 of 340 remaining) [2022-11-02 20:58:55,643 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 340 remaining) [2022-11-02 20:58:55,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 340 remaining) [2022-11-02 20:58:55,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 340 remaining) [2022-11-02 20:58:55,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 340 remaining) [2022-11-02 20:58:55,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (41 of 340 remaining) [2022-11-02 20:58:55,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (40 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (38 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (37 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (36 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (35 of 340 remaining) [2022-11-02 20:58:55,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (34 of 340 remaining) [2022-11-02 20:58:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (33 of 340 remaining) [2022-11-02 20:58:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (32 of 340 remaining) [2022-11-02 20:58:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (31 of 340 remaining) [2022-11-02 20:58:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (30 of 340 remaining) [2022-11-02 20:58:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (29 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (28 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (27 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (26 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (25 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 340 remaining) [2022-11-02 20:58:55,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (21 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (20 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (19 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (18 of 340 remaining) [2022-11-02 20:58:55,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (17 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (16 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (15 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (14 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (13 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 340 remaining) [2022-11-02 20:58:55,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (11 of 340 remaining) [2022-11-02 20:58:55,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (10 of 340 remaining) [2022-11-02 20:58:55,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (9 of 340 remaining) [2022-11-02 20:58:55,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (8 of 340 remaining) [2022-11-02 20:58:55,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (7 of 340 remaining) [2022-11-02 20:58:55,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (6 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (5 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (4 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (3 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (2 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (1 of 340 remaining) [2022-11-02 20:58:55,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (0 of 340 remaining) [2022-11-02 20:58:55,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:58:55,652 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:55,660 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:58:55,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:58:55,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:58:55 BasicIcfg [2022-11-02 20:58:55,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:58:55,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:58:55,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:58:55,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:58:55,668 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:59" (3/4) ... [2022-11-02 20:58:55,670 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:58:55,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:58:55,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:58:55,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:58:55,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:58:55,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2022-11-02 20:58:55,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:58:55,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:58:55,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:58:55,746 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:58:55,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:58:55,747 INFO L158 Benchmark]: Toolchain (without parser) took 60284.50ms. Allocated memory was 94.4MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 61.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 747.8MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,747 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 94.4MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:55,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.57ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 63.6MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.16ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 57.1MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,748 INFO L158 Benchmark]: Boogie Preprocessor took 90.78ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 51.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,749 INFO L158 Benchmark]: RCFGBuilder took 3072.38ms. Allocated memory was 94.4MB in the beginning and 159.4MB in the end (delta: 65.0MB). Free memory was 51.4MB in the beginning and 115.2MB in the end (delta: -63.7MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,749 INFO L158 Benchmark]: TraceAbstraction took 56399.58ms. Allocated memory was 159.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 114.1MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-11-02 20:58:55,749 INFO L158 Benchmark]: Witness Printer took 79.72ms. Allocated memory is still 4.3GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:58:55,751 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.33ms. Allocated memory is still 94.4MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.57ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 63.6MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.16ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 57.1MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.78ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 51.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3072.38ms. Allocated memory was 94.4MB in the beginning and 159.4MB in the end (delta: 65.0MB). Free memory was 51.4MB in the beginning and 115.2MB in the end (delta: -63.7MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56399.58ms. Allocated memory was 159.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 114.1MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 79.72ms. Allocated memory is still 4.3GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: 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: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: 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: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 179]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 182]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 184]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 187]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 189]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 192]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 193]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 200]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 201]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 202]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 203]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 205]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: 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: 150]: 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: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: 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: 157]: 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: 157]: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 897 locations, 340 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: 56.0s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2515 IncrementalHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 347 mSDtfsCounter, 2515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1386occurred in iteration=0, InterpolantAutomatonStates: 126, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 6968 NumberOfCodeBlocks, 6968 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6931 ConstructedInterpolants, 0 QuantifiedInterpolants, 7434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 186 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:58:55,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24574b10-1102-4983-a252-a22def0c86de/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