./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/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_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/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_47b95d7a-c262-4440-a1d6-7d85d65ece18/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 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 --- 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:55:45,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:55:45,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:55:45,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:55:45,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:55:45,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:55:45,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:55:45,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:55:45,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:55:45,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:55:45,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:55:45,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:55:45,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:55:45,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:55:45,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:55:45,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:55:45,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:55:45,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:55:45,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:55:45,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:55:45,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:55:45,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:55:45,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:55:45,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:55:45,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:55:45,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:55:45,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:55:45,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:55:45,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:55:45,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:55:45,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:55:45,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:55:45,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:55:45,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:55:45,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:55:45,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:55:45,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:55:45,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:55:45,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:55:45,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:55:45,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:55:45,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:55:45,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:55:45,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:55:45,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:55:45,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:55:45,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:55:45,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:55:45,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:55:45,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:55:45,828 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:55:45,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:55:45,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:55:45,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:55:45,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:55:45,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:55:45,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:55:45,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:55:45,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:55:45,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:55:45,831 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:55:45,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:55:45,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:55:45,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:55:45,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:55:45,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:55:45,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:55:45,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:55:45,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:45,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:55:45,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:55:45,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:55:45,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:55:45,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:55:45,837 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:55:45,837 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:55:45,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:55:45,838 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_47b95d7a-c262-4440-a1d6-7d85d65ece18/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_47b95d7a-c262-4440-a1d6-7d85d65ece18/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 -> 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 [2022-11-02 20:55:46,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:55:46,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:55:46,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:55:46,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:55:46,208 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:55:46,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-11-02 20:55:46,278 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/data/9f147710f/9dca9f10e3074f0aa9428642bf4255fa/FLAGa1fa1f40a [2022-11-02 20:55:46,747 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:55:46,748 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-11-02 20:55:46,754 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/data/9f147710f/9dca9f10e3074f0aa9428642bf4255fa/FLAGa1fa1f40a [2022-11-02 20:55:47,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/data/9f147710f/9dca9f10e3074f0aa9428642bf4255fa [2022-11-02 20:55:47,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:55:47,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:55:47,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:47,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:55:47,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:55:47,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d3bedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47, skipping insertion in model container [2022-11-02 20:55:47,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:55:47,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:55:47,362 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_47b95d7a-c262-4440-a1d6-7d85d65ece18/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-11-02 20:55:47,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:47,385 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:55:47,421 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_47b95d7a-c262-4440-a1d6-7d85d65ece18/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-11-02 20:55:47,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:47,440 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:55:47,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47 WrapperNode [2022-11-02 20:55:47,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:47,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:47,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:55:47,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:55:47,450 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:55:47" (1/1) ... [2022-11-02 20:55:47,481 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:55:47" (1/1) ... [2022-11-02 20:55:47,514 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2022-11-02 20:55:47,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:47,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:55:47,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:55:47,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:55:47,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,574 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:55:47,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:55:47,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:55:47,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:55:47,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (1/1) ... [2022-11-02 20:55:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:47,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:47,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:55:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:55:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:55:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:55:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:55:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:55:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:55:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:55:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:55:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:55:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:55:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:55:47,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:55:47,705 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:55:47,893 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:55:47,895 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:55:48,676 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:55:49,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:55:49,012 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:55:49,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:49 BoogieIcfgContainer [2022-11-02 20:55:49,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:55:49,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:55:49,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:55:49,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:55:49,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:55:47" (1/3) ... [2022-11-02 20:55:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df0b7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:49, skipping insertion in model container [2022-11-02 20:55:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:47" (2/3) ... [2022-11-02 20:55:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df0b7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:49, skipping insertion in model container [2022-11-02 20:55:49,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:49" (3/3) ... [2022-11-02 20:55:49,032 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-11-02 20:55:49,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:55:49,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:55:49,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2022-11-02 20:55:49,049 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:55:49,151 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:55:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 326 transitions, 676 flow [2022-11-02 20:55:49,411 INFO L130 PetriNetUnfolder]: 15/323 cut-off events. [2022-11-02 20:55:49,411 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:55:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 323 events. 15/323 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 459 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 267. Up to 2 conditions per place. [2022-11-02 20:55:49,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 326 transitions, 676 flow [2022-11-02 20:55:49,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 303 transitions, 624 flow [2022-11-02 20:55:49,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:55:49,459 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;@7a2fb1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:55:49,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-02 20:55:49,470 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-02 20:55:49,470 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:55:49,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:49,471 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] [2022-11-02 20:55:49,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash 616618658, now seen corresponding path program 1 times [2022-11-02 20:55:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148862116] [2022-11-02 20:55:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,795 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:55:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:49,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148862116] [2022-11-02 20:55:49,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148862116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:49,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:49,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886017141] [2022-11-02 20:55:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:49,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:49,867 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 326 [2022-11-02 20:55:49,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 303 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:49,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:49,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 326 [2022-11-02 20:55:49,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:50,197 INFO L130 PetriNetUnfolder]: 88/539 cut-off events. [2022-11-02 20:55:50,197 INFO L131 PetriNetUnfolder]: For 72/91 co-relation queries the response was YES. [2022-11-02 20:55:50,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 539 events. 88/539 cut-off events. For 72/91 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2008 event pairs, 71 based on Foata normal form. 32/488 useless extension candidates. Maximal degree in co-relation 467. Up to 144 conditions per place. [2022-11-02 20:55:50,205 INFO L137 encePairwiseOnDemand]: 289/326 looper letters, 22 selfloop transitions, 2 changer transitions 4/268 dead transitions. [2022-11-02 20:55:50,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 602 flow [2022-11-02 20:55:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2022-11-02 20:55:50,232 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8732106339468303 [2022-11-02 20:55:50,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 854 transitions. [2022-11-02 20:55:50,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 854 transitions. [2022-11-02 20:55:50,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:50,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 854 transitions. [2022-11-02 20:55:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,261 INFO L175 Difference]: Start difference. First operand has 299 places, 303 transitions, 624 flow. Second operand 3 states and 854 transitions. [2022-11-02 20:55:50,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 602 flow [2022-11-02 20:55:50,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 590 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:55:50,283 INFO L231 Difference]: Finished difference. Result has 267 places, 264 transitions, 538 flow [2022-11-02 20:55:50,285 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=267, PETRI_TRANSITIONS=264} [2022-11-02 20:55:50,290 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -32 predicate places. [2022-11-02 20:55:50,290 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 264 transitions, 538 flow [2022-11-02 20:55:50,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:50,292 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] [2022-11-02 20:55:50,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:55:50,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 483481532, now seen corresponding path program 1 times [2022-11-02 20:55:50,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:50,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275613195] [2022-11-02 20:55:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,418 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:55:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275613195] [2022-11-02 20:55:50,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275613195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:50,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:50,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431292397] [2022-11-02 20:55:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:50,428 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 326 [2022-11-02 20:55:50,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 264 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:50,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 326 [2022-11-02 20:55:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:50,634 INFO L130 PetriNetUnfolder]: 88/534 cut-off events. [2022-11-02 20:55:50,634 INFO L131 PetriNetUnfolder]: For 11/30 co-relation queries the response was YES. [2022-11-02 20:55:50,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 534 events. 88/534 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2044 event pairs, 71 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 667. Up to 141 conditions per place. [2022-11-02 20:55:50,639 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 19 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2022-11-02 20:55:50,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 263 transitions, 578 flow [2022-11-02 20:55:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2022-11-02 20:55:50,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8445807770961146 [2022-11-02 20:55:50,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2022-11-02 20:55:50,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2022-11-02 20:55:50,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2022-11-02 20:55:50,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,651 INFO L175 Difference]: Start difference. First operand has 267 places, 264 transitions, 538 flow. Second operand 3 states and 826 transitions. [2022-11-02 20:55:50,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 263 transitions, 578 flow [2022-11-02 20:55:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 263 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:50,663 INFO L231 Difference]: Finished difference. Result has 262 places, 263 transitions, 536 flow [2022-11-02 20:55:50,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=262, PETRI_TRANSITIONS=263} [2022-11-02 20:55:50,665 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -37 predicate places. [2022-11-02 20:55:50,666 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 263 transitions, 536 flow [2022-11-02 20:55:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:50,667 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] [2022-11-02 20:55:50,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:55:50,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -172925758, now seen corresponding path program 1 times [2022-11-02 20:55:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478352889] [2022-11-02 20:55:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,763 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:55:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:50,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478352889] [2022-11-02 20:55:50,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478352889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:50,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:50,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790048598] [2022-11-02 20:55:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:50,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:50,769 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 326 [2022-11-02 20:55:50,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 263 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:50,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:50,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 326 [2022-11-02 20:55:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:51,076 INFO L130 PetriNetUnfolder]: 253/884 cut-off events. [2022-11-02 20:55:51,077 INFO L131 PetriNetUnfolder]: For 17/73 co-relation queries the response was YES. [2022-11-02 20:55:51,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 884 events. 253/884 cut-off events. For 17/73 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4733 event pairs, 230 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1316. Up to 411 conditions per place. [2022-11-02 20:55:51,086 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 28 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2022-11-02 20:55:51,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 262 transitions, 594 flow [2022-11-02 20:55:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:55:51,091 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8261758691206544 [2022-11-02 20:55:51,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:55:51,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:55:51,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:51,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:55:51,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,098 INFO L175 Difference]: Start difference. First operand has 262 places, 263 transitions, 536 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:55:51,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 262 transitions, 594 flow [2022-11-02 20:55:51,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 262 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:51,105 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 534 flow [2022-11-02 20:55:51,105 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2022-11-02 20:55:51,108 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -38 predicate places. [2022-11-02 20:55:51,108 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 534 flow [2022-11-02 20:55:51,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:51,110 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] [2022-11-02 20:55:51,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:55:51,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash -777092352, now seen corresponding path program 1 times [2022-11-02 20:55:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247620416] [2022-11-02 20:55:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:51,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247620416] [2022-11-02 20:55:51,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247620416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:51,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:51,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834465498] [2022-11-02 20:55:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:51,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:51,220 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 326 [2022-11-02 20:55:51,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:51,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 326 [2022-11-02 20:55:51,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:51,459 INFO L130 PetriNetUnfolder]: 188/733 cut-off events. [2022-11-02 20:55:51,459 INFO L131 PetriNetUnfolder]: For 16/60 co-relation queries the response was YES. [2022-11-02 20:55:51,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 733 events. 188/733 cut-off events. For 16/60 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3540 event pairs, 167 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 1033. Up to 300 conditions per place. [2022-11-02 20:55:51,466 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 22 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-11-02 20:55:51,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 258 transitions, 572 flow [2022-11-02 20:55:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2022-11-02 20:55:51,470 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8312883435582822 [2022-11-02 20:55:51,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2022-11-02 20:55:51,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2022-11-02 20:55:51,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:51,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2022-11-02 20:55:51,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,483 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 534 flow. Second operand 3 states and 813 transitions. [2022-11-02 20:55:51,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 258 transitions, 572 flow [2022-11-02 20:55:51,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 258 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:51,491 INFO L231 Difference]: Finished difference. Result has 257 places, 258 transitions, 524 flow [2022-11-02 20:55:51,492 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=257, PETRI_TRANSITIONS=258} [2022-11-02 20:55:51,493 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -42 predicate places. [2022-11-02 20:55:51,494 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 258 transitions, 524 flow [2022-11-02 20:55:51,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:51,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:51,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:55:51,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1485173198, now seen corresponding path program 1 times [2022-11-02 20:55:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15468947] [2022-11-02 20:55:51,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,607 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:55:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:51,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15468947] [2022-11-02 20:55:51,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15468947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:51,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:51,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256319870] [2022-11-02 20:55:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:51,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:51,614 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 326 [2022-11-02 20:55:51,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 258 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:51,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 326 [2022-11-02 20:55:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:51,788 INFO L130 PetriNetUnfolder]: 88/518 cut-off events. [2022-11-02 20:55:51,788 INFO L131 PetriNetUnfolder]: For 11/30 co-relation queries the response was YES. [2022-11-02 20:55:51,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 518 events. 88/518 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1946 event pairs, 71 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 636. Up to 141 conditions per place. [2022-11-02 20:55:51,793 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 19 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2022-11-02 20:55:51,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 257 transitions, 564 flow [2022-11-02 20:55:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2022-11-02 20:55:51,796 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8445807770961146 [2022-11-02 20:55:51,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2022-11-02 20:55:51,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2022-11-02 20:55:51,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:51,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2022-11-02 20:55:51,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,804 INFO L175 Difference]: Start difference. First operand has 257 places, 258 transitions, 524 flow. Second operand 3 states and 826 transitions. [2022-11-02 20:55:51,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 257 transitions, 564 flow [2022-11-02 20:55:51,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 257 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:51,811 INFO L231 Difference]: Finished difference. Result has 257 places, 257 transitions, 525 flow [2022-11-02 20:55:51,811 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=257, PETRI_TRANSITIONS=257} [2022-11-02 20:55:51,814 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -42 predicate places. [2022-11-02 20:55:51,815 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 257 transitions, 525 flow [2022-11-02 20:55:51,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:51,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:51,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:55:51,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1868055847, now seen corresponding path program 1 times [2022-11-02 20:55:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78981386] [2022-11-02 20:55:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,898 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:55:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:51,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78981386] [2022-11-02 20:55:51,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78981386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:51,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:51,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154828332] [2022-11-02 20:55:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:51,904 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 326 [2022-11-02 20:55:51,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 257 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:51,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:51,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 326 [2022-11-02 20:55:51,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:52,061 INFO L130 PetriNetUnfolder]: 88/517 cut-off events. [2022-11-02 20:55:52,061 INFO L131 PetriNetUnfolder]: For 11/30 co-relation queries the response was YES. [2022-11-02 20:55:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 517 events. 88/517 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1940 event pairs, 71 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 637. Up to 141 conditions per place. [2022-11-02 20:55:52,066 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 19 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2022-11-02 20:55:52,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 256 transitions, 565 flow [2022-11-02 20:55:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2022-11-02 20:55:52,069 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8445807770961146 [2022-11-02 20:55:52,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:52,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,077 INFO L175 Difference]: Start difference. First operand has 257 places, 257 transitions, 525 flow. Second operand 3 states and 826 transitions. [2022-11-02 20:55:52,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 256 transitions, 565 flow [2022-11-02 20:55:52,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 256 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:52,084 INFO L231 Difference]: Finished difference. Result has 256 places, 256 transitions, 523 flow [2022-11-02 20:55:52,084 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=256, PETRI_TRANSITIONS=256} [2022-11-02 20:55:52,085 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -43 predicate places. [2022-11-02 20:55:52,086 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 256 transitions, 523 flow [2022-11-02 20:55:52,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:52,087 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:55:52,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:55:52,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2091579367, now seen corresponding path program 1 times [2022-11-02 20:55:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:52,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127329841] [2022-11-02 20:55:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,152 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:55:52,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:52,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127329841] [2022-11-02 20:55:52,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127329841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:52,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:52,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787589934] [2022-11-02 20:55:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:52,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:52,158 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 326 [2022-11-02 20:55:52,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 256 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:52,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 326 [2022-11-02 20:55:52,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:52,339 INFO L130 PetriNetUnfolder]: 88/516 cut-off events. [2022-11-02 20:55:52,339 INFO L131 PetriNetUnfolder]: For 11/30 co-relation queries the response was YES. [2022-11-02 20:55:52,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 516 events. 88/516 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1928 event pairs, 71 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 644. Up to 149 conditions per place. [2022-11-02 20:55:52,344 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 27 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2022-11-02 20:55:52,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 255 transitions, 579 flow [2022-11-02 20:55:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2022-11-02 20:55:52,349 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8251533742331288 [2022-11-02 20:55:52,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2022-11-02 20:55:52,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2022-11-02 20:55:52,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:52,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2022-11-02 20:55:52,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,360 INFO L175 Difference]: Start difference. First operand has 256 places, 256 transitions, 523 flow. Second operand 3 states and 807 transitions. [2022-11-02 20:55:52,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 255 transitions, 579 flow [2022-11-02 20:55:52,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 255 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:52,368 INFO L231 Difference]: Finished difference. Result has 255 places, 255 transitions, 521 flow [2022-11-02 20:55:52,369 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=255, PETRI_TRANSITIONS=255} [2022-11-02 20:55:52,370 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -44 predicate places. [2022-11-02 20:55:52,370 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 255 transitions, 521 flow [2022-11-02 20:55:52,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:52,372 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] [2022-11-02 20:55:52,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:55:52,372 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1523960251, now seen corresponding path program 1 times [2022-11-02 20:55:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:52,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393498196] [2022-11-02 20:55:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,444 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:55:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:52,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393498196] [2022-11-02 20:55:52,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393498196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:52,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:52,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615847031] [2022-11-02 20:55:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:52,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:52,450 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 326 [2022-11-02 20:55:52,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 255 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:52,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 326 [2022-11-02 20:55:52,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:52,594 INFO L130 PetriNetUnfolder]: 88/515 cut-off events. [2022-11-02 20:55:52,594 INFO L131 PetriNetUnfolder]: For 11/30 co-relation queries the response was YES. [2022-11-02 20:55:52,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 515 events. 88/515 cut-off events. For 11/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1934 event pairs, 71 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 635. Up to 141 conditions per place. [2022-11-02 20:55:52,598 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 19 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2022-11-02 20:55:52,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 254 transitions, 561 flow [2022-11-02 20:55:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2022-11-02 20:55:52,602 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8445807770961146 [2022-11-02 20:55:52,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:52,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2022-11-02 20:55:52,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,609 INFO L175 Difference]: Start difference. First operand has 255 places, 255 transitions, 521 flow. Second operand 3 states and 826 transitions. [2022-11-02 20:55:52,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 254 transitions, 561 flow [2022-11-02 20:55:52,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:52,615 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 519 flow [2022-11-02 20:55:52,616 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=519, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2022-11-02 20:55:52,616 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -45 predicate places. [2022-11-02 20:55:52,617 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 519 flow [2022-11-02 20:55:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:52,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:52,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:55:52,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 60252546, now seen corresponding path program 1 times [2022-11-02 20:55:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993999650] [2022-11-02 20:55:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,178 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:55:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:53,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993999650] [2022-11-02 20:55:53,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993999650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:53,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:53,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576673476] [2022-11-02 20:55:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:53,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:53,184 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 326 [2022-11-02 20:55:53,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:53,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 326 [2022-11-02 20:55:53,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:53,656 INFO L130 PetriNetUnfolder]: 542/1276 cut-off events. [2022-11-02 20:55:53,656 INFO L131 PetriNetUnfolder]: For 3/87 co-relation queries the response was YES. [2022-11-02 20:55:53,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 1276 events. 542/1276 cut-off events. For 3/87 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6145 event pairs, 521 based on Foata normal form. 0/1129 useless extension candidates. Maximal degree in co-relation 2113. Up to 854 conditions per place. [2022-11-02 20:55:53,668 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 48 selfloop transitions, 5 changer transitions 0/253 dead transitions. [2022-11-02 20:55:53,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 253 transitions, 623 flow [2022-11-02 20:55:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1470 transitions. [2022-11-02 20:55:53,673 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7515337423312883 [2022-11-02 20:55:53,673 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1470 transitions. [2022-11-02 20:55:53,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1470 transitions. [2022-11-02 20:55:53,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:53,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1470 transitions. [2022-11-02 20:55:53,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,684 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,684 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 519 flow. Second operand 6 states and 1470 transitions. [2022-11-02 20:55:53,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 253 transitions, 623 flow [2022-11-02 20:55:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 253 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:53,691 INFO L231 Difference]: Finished difference. Result has 256 places, 253 transitions, 523 flow [2022-11-02 20:55:53,691 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=256, PETRI_TRANSITIONS=253} [2022-11-02 20:55:53,692 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -43 predicate places. [2022-11-02 20:55:53,692 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 253 transitions, 523 flow [2022-11-02 20:55:53,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:53,694 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] [2022-11-02 20:55:53,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:55:53,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -27402919, now seen corresponding path program 1 times [2022-11-02 20:55:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:53,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860642969] [2022-11-02 20:55:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,749 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:55:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:53,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860642969] [2022-11-02 20:55:53,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860642969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:53,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:53,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256042350] [2022-11-02 20:55:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:53,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:53,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:53,753 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 326 [2022-11-02 20:55:53,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 253 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:53,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 326 [2022-11-02 20:55:53,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:53,885 INFO L130 PetriNetUnfolder]: 91/572 cut-off events. [2022-11-02 20:55:53,885 INFO L131 PetriNetUnfolder]: For 11/34 co-relation queries the response was YES. [2022-11-02 20:55:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 572 events. 91/572 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2210 event pairs, 6 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 724. Up to 118 conditions per place. [2022-11-02 20:55:53,889 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 23 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2022-11-02 20:55:53,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 257 transitions, 583 flow [2022-11-02 20:55:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2022-11-02 20:55:53,893 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8496932515337423 [2022-11-02 20:55:53,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2022-11-02 20:55:53,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2022-11-02 20:55:53,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:53,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2022-11-02 20:55:53,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,900 INFO L175 Difference]: Start difference. First operand has 256 places, 253 transitions, 523 flow. Second operand 3 states and 831 transitions. [2022-11-02 20:55:53,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 257 transitions, 583 flow [2022-11-02 20:55:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 573 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:55:53,906 INFO L231 Difference]: Finished difference. Result has 251 places, 251 transitions, 513 flow [2022-11-02 20:55:53,906 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=251, PETRI_TRANSITIONS=251} [2022-11-02 20:55:53,907 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -48 predicate places. [2022-11-02 20:55:53,907 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 251 transitions, 513 flow [2022-11-02 20:55:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:53,908 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] [2022-11-02 20:55:53,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:55:53,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -564376562, now seen corresponding path program 1 times [2022-11-02 20:55:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:53,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054546210] [2022-11-02 20:55:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,953 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:55:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:53,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054546210] [2022-11-02 20:55:53,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054546210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:53,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:53,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441037142] [2022-11-02 20:55:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:53,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:53,957 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 326 [2022-11-02 20:55:53,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 251 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:53,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:53,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 326 [2022-11-02 20:55:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:54,095 INFO L130 PetriNetUnfolder]: 93/537 cut-off events. [2022-11-02 20:55:54,096 INFO L131 PetriNetUnfolder]: For 23/41 co-relation queries the response was YES. [2022-11-02 20:55:54,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 537 events. 93/537 cut-off events. For 23/41 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2048 event pairs, 10 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 664. Up to 109 conditions per place. [2022-11-02 20:55:54,100 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 21 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2022-11-02 20:55:54,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 256 transitions, 573 flow [2022-11-02 20:55:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2022-11-02 20:55:54,104 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8558282208588958 [2022-11-02 20:55:54,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:54,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,111 INFO L175 Difference]: Start difference. First operand has 251 places, 251 transitions, 513 flow. Second operand 3 states and 837 transitions. [2022-11-02 20:55:54,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 256 transitions, 573 flow [2022-11-02 20:55:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:54,119 INFO L231 Difference]: Finished difference. Result has 250 places, 250 transitions, 511 flow [2022-11-02 20:55:54,120 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=250, PETRI_TRANSITIONS=250} [2022-11-02 20:55:54,120 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:55:54,120 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 250 transitions, 511 flow [2022-11-02 20:55:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:54,122 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] [2022-11-02 20:55:54,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:55:54,122 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:54,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1506748562, now seen corresponding path program 1 times [2022-11-02 20:55:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569414490] [2022-11-02 20:55:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:54,180 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:55:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569414490] [2022-11-02 20:55:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569414490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:54,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:54,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273946595] [2022-11-02 20:55:54,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:54,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:54,184 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 326 [2022-11-02 20:55:54,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 250 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:54,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 326 [2022-11-02 20:55:54,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:54,322 INFO L130 PetriNetUnfolder]: 97/606 cut-off events. [2022-11-02 20:55:54,322 INFO L131 PetriNetUnfolder]: For 25/39 co-relation queries the response was YES. [2022-11-02 20:55:54,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 606 events. 97/606 cut-off events. For 25/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2510 event pairs, 57 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 753. Up to 143 conditions per place. [2022-11-02 20:55:54,327 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 20 selfloop transitions, 3 changer transitions 0/255 dead transitions. [2022-11-02 20:55:54,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 255 transitions, 572 flow [2022-11-02 20:55:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2022-11-02 20:55:54,331 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8558282208588958 [2022-11-02 20:55:54,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:54,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 837 transitions. [2022-11-02 20:55:54,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,338 INFO L175 Difference]: Start difference. First operand has 250 places, 250 transitions, 511 flow. Second operand 3 states and 837 transitions. [2022-11-02 20:55:54,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 255 transitions, 572 flow [2022-11-02 20:55:54,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 255 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:54,346 INFO L231 Difference]: Finished difference. Result has 250 places, 251 transitions, 522 flow [2022-11-02 20:55:54,347 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=250, PETRI_TRANSITIONS=251} [2022-11-02 20:55:54,350 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:55:54,350 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 251 transitions, 522 flow [2022-11-02 20:55:54,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:54,351 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] [2022-11-02 20:55:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:55:54,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1510652969, now seen corresponding path program 1 times [2022-11-02 20:55:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:54,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927995281] [2022-11-02 20:55:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:54,401 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:55:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:54,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927995281] [2022-11-02 20:55:54,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927995281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:54,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:54,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61273231] [2022-11-02 20:55:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:54,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:54,410 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 326 [2022-11-02 20:55:54,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 251 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:54,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 326 [2022-11-02 20:55:54,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:54,710 INFO L130 PetriNetUnfolder]: 173/888 cut-off events. [2022-11-02 20:55:54,710 INFO L131 PetriNetUnfolder]: For 57/86 co-relation queries the response was YES. [2022-11-02 20:55:54,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 888 events. 173/888 cut-off events. For 57/86 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4536 event pairs, 95 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 1233. Up to 170 conditions per place. [2022-11-02 20:55:54,717 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 34 selfloop transitions, 2 changer transitions 3/261 dead transitions. [2022-11-02 20:55:54,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 261 transitions, 633 flow [2022-11-02 20:55:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2022-11-02 20:55:54,720 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8425357873210634 [2022-11-02 20:55:54,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2022-11-02 20:55:54,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2022-11-02 20:55:54,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:54,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2022-11-02 20:55:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,729 INFO L175 Difference]: Start difference. First operand has 250 places, 251 transitions, 522 flow. Second operand 3 states and 824 transitions. [2022-11-02 20:55:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 261 transitions, 633 flow [2022-11-02 20:55:54,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 261 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:54,737 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 517 flow [2022-11-02 20:55:54,737 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2022-11-02 20:55:54,739 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -50 predicate places. [2022-11-02 20:55:54,739 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 517 flow [2022-11-02 20:55:54,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:54,740 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] [2022-11-02 20:55:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:55:54,741 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:54,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash 38586212, now seen corresponding path program 1 times [2022-11-02 20:55:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:54,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837414876] [2022-11-02 20:55:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:54,806 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:55:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837414876] [2022-11-02 20:55:54,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837414876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:54,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:54,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126287356] [2022-11-02 20:55:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:54,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:54,810 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 326 [2022-11-02 20:55:54,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:54,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:54,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 326 [2022-11-02 20:55:54,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:55,057 INFO L130 PetriNetUnfolder]: 180/989 cut-off events. [2022-11-02 20:55:55,057 INFO L131 PetriNetUnfolder]: For 102/124 co-relation queries the response was YES. [2022-11-02 20:55:55,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 989 events. 180/989 cut-off events. For 102/124 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5480 event pairs, 67 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1413. Up to 161 conditions per place. [2022-11-02 20:55:55,066 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 29 selfloop transitions, 4 changer transitions 0/258 dead transitions. [2022-11-02 20:55:55,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 258 transitions, 627 flow [2022-11-02 20:55:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2022-11-02 20:55:55,069 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8609406952965235 [2022-11-02 20:55:55,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 842 transitions. [2022-11-02 20:55:55,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 842 transitions. [2022-11-02 20:55:55,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:55,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 842 transitions. [2022-11-02 20:55:55,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,076 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 517 flow. Second operand 3 states and 842 transitions. [2022-11-02 20:55:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 258 transitions, 627 flow [2022-11-02 20:55:55,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 258 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:55,083 INFO L231 Difference]: Finished difference. Result has 248 places, 246 transitions, 539 flow [2022-11-02 20:55:55,084 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=248, PETRI_TRANSITIONS=246} [2022-11-02 20:55:55,085 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -51 predicate places. [2022-11-02 20:55:55,085 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 246 transitions, 539 flow [2022-11-02 20:55:55,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:55,086 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] [2022-11-02 20:55:55,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:55:55,086 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash -705957086, now seen corresponding path program 1 times [2022-11-02 20:55:55,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777350186] [2022-11-02 20:55:55,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:55,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:55,624 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:55:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:55,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777350186] [2022-11-02 20:55:55,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777350186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:55,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:55,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251158420] [2022-11-02 20:55:55,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:55,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:55,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:55,628 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 326 [2022-11-02 20:55:55,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 246 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:55,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 326 [2022-11-02 20:55:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:56,456 INFO L130 PetriNetUnfolder]: 1152/3400 cut-off events. [2022-11-02 20:55:56,457 INFO L131 PetriNetUnfolder]: For 1905/1927 co-relation queries the response was YES. [2022-11-02 20:55:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6426 conditions, 3400 events. 1152/3400 cut-off events. For 1905/1927 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 26371 event pairs, 339 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 6374. Up to 1574 conditions per place. [2022-11-02 20:55:56,484 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 52 selfloop transitions, 6 changer transitions 1/256 dead transitions. [2022-11-02 20:55:56,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 256 transitions, 690 flow [2022-11-02 20:55:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1520 transitions. [2022-11-02 20:55:56,534 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7770961145194274 [2022-11-02 20:55:56,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1520 transitions. [2022-11-02 20:55:56,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1520 transitions. [2022-11-02 20:55:56,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:56,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1520 transitions. [2022-11-02 20:55:56,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,545 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,545 INFO L175 Difference]: Start difference. First operand has 248 places, 246 transitions, 539 flow. Second operand 6 states and 1520 transitions. [2022-11-02 20:55:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 256 transitions, 690 flow [2022-11-02 20:55:56,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:56,555 INFO L231 Difference]: Finished difference. Result has 250 places, 244 transitions, 539 flow [2022-11-02 20:55:56,556 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=250, PETRI_TRANSITIONS=244} [2022-11-02 20:55:56,557 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:55:56,557 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 539 flow [2022-11-02 20:55:56,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:56,558 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] [2022-11-02 20:55:56,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:55:56,559 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 179155805, now seen corresponding path program 1 times [2022-11-02 20:55:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927265697] [2022-11-02 20:55:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:56,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927265697] [2022-11-02 20:55:56,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927265697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:56,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:56,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582505292] [2022-11-02 20:55:56,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:56,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:56,620 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 326 [2022-11-02 20:55:56,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:56,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 326 [2022-11-02 20:55:56,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:56,932 INFO L130 PetriNetUnfolder]: 243/1282 cut-off events. [2022-11-02 20:55:56,932 INFO L131 PetriNetUnfolder]: For 280/328 co-relation queries the response was YES. [2022-11-02 20:55:56,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2006 conditions, 1282 events. 243/1282 cut-off events. For 280/328 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7928 event pairs, 128 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1955. Up to 292 conditions per place. [2022-11-02 20:55:56,943 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 32 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2022-11-02 20:55:56,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 256 transitions, 659 flow [2022-11-02 20:55:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2022-11-02 20:55:56,946 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8588957055214724 [2022-11-02 20:55:56,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2022-11-02 20:55:56,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2022-11-02 20:55:56,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:56,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2022-11-02 20:55:56,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,952 INFO L175 Difference]: Start difference. First operand has 250 places, 244 transitions, 539 flow. Second operand 3 states and 840 transitions. [2022-11-02 20:55:56,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 256 transitions, 659 flow [2022-11-02 20:55:56,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 256 transitions, 648 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:56,958 INFO L231 Difference]: Finished difference. Result has 247 places, 244 transitions, 538 flow [2022-11-02 20:55:56,959 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=247, PETRI_TRANSITIONS=244} [2022-11-02 20:55:56,959 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -52 predicate places. [2022-11-02 20:55:56,959 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 244 transitions, 538 flow [2022-11-02 20:55:56,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:56,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:55:56,961 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1658940235, now seen corresponding path program 1 times [2022-11-02 20:55:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:56,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368969217] [2022-11-02 20:55:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,452 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:55:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:57,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368969217] [2022-11-02 20:55:57,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368969217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:57,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705125777] [2022-11-02 20:55:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:57,457 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 326 [2022-11-02 20:55:57,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 244 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:57,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:57,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 326 [2022-11-02 20:55:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:58,535 INFO L130 PetriNetUnfolder]: 1455/3243 cut-off events. [2022-11-02 20:55:58,535 INFO L131 PetriNetUnfolder]: For 1833/1929 co-relation queries the response was YES. [2022-11-02 20:55:58,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7347 conditions, 3243 events. 1455/3243 cut-off events. For 1833/1929 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 20378 event pairs, 227 based on Foata normal form. 52/3110 useless extension candidates. Maximal degree in co-relation 7293. Up to 886 conditions per place. [2022-11-02 20:55:58,561 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 96 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-02 20:55:58,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 295 transitions, 972 flow [2022-11-02 20:55:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2022-11-02 20:55:58,566 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7755623721881391 [2022-11-02 20:55:58,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1517 transitions. [2022-11-02 20:55:58,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1517 transitions. [2022-11-02 20:55:58,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:58,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1517 transitions. [2022-11-02 20:55:58,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.83333333333334) internal successors, (1517), 6 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:58,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:58,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:58,575 INFO L175 Difference]: Start difference. First operand has 247 places, 244 transitions, 538 flow. Second operand 6 states and 1517 transitions. [2022-11-02 20:55:58,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 295 transitions, 972 flow [2022-11-02 20:55:58,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 295 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:58,582 INFO L231 Difference]: Finished difference. Result has 250 places, 243 transitions, 542 flow [2022-11-02 20:55:58,583 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=250, PETRI_TRANSITIONS=243} [2022-11-02 20:55:58,584 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:55:58,584 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 243 transitions, 542 flow [2022-11-02 20:55:58,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:58,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:58,585 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:55:58,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:55:58,585 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:55:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash 783219224, now seen corresponding path program 1 times [2022-11-02 20:55:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904849989] [2022-11-02 20:55:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:59,213 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:55:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:59,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904849989] [2022-11-02 20:55:59,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904849989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:59,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:59,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455188159] [2022-11-02 20:55:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:59,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:59,219 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 326 [2022-11-02 20:55:59,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 243 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:59,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:59,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 326 [2022-11-02 20:55:59,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:00,215 INFO L130 PetriNetUnfolder]: 1306/3196 cut-off events. [2022-11-02 20:56:00,215 INFO L131 PetriNetUnfolder]: For 1795/1843 co-relation queries the response was YES. [2022-11-02 20:56:00,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 3196 events. 1306/3196 cut-off events. For 1795/1843 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 20979 event pairs, 762 based on Foata normal form. 0/2969 useless extension candidates. Maximal degree in co-relation 7065. Up to 1703 conditions per place. [2022-11-02 20:56:00,246 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 67 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-02 20:56:00,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 266 transitions, 786 flow [2022-11-02 20:56:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:56:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2022-11-02 20:56:00,251 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7689161554192229 [2022-11-02 20:56:00,251 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1504 transitions. [2022-11-02 20:56:00,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1504 transitions. [2022-11-02 20:56:00,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:00,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1504 transitions. [2022-11-02 20:56:00,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:00,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:00,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:00,261 INFO L175 Difference]: Start difference. First operand has 250 places, 243 transitions, 542 flow. Second operand 6 states and 1504 transitions. [2022-11-02 20:56:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 266 transitions, 786 flow [2022-11-02 20:56:00,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 266 transitions, 779 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:56:00,269 INFO L231 Difference]: Finished difference. Result has 250 places, 242 transitions, 541 flow [2022-11-02 20:56:00,270 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=541, PETRI_PLACES=250, PETRI_TRANSITIONS=242} [2022-11-02 20:56:00,270 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:56:00,271 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 242 transitions, 541 flow [2022-11-02 20:56:00,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:00,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:00,272 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] [2022-11-02 20:56:00,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:56:00,272 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2022-11-02 20:56:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1036968836, now seen corresponding path program 1 times [2022-11-02 20:56:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314717275] [2022-11-02 20:56:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:00,857 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:56:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314717275] [2022-11-02 20:56:00,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314717275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:00,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:00,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229764883] [2022-11-02 20:56:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:00,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:00,863 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 326 [2022-11-02 20:56:00,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 242 transitions, 541 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:00,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:00,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 326 [2022-11-02 20:56:00,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:01,604 INFO L130 PetriNetUnfolder]: 1321/3187 cut-off events. [2022-11-02 20:56:01,605 INFO L131 PetriNetUnfolder]: For 1600/1616 co-relation queries the response was YES. [2022-11-02 20:56:01,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7002 conditions, 3187 events. 1321/3187 cut-off events. For 1600/1616 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20889 event pairs, 890 based on Foata normal form. 4/3028 useless extension candidates. Maximal degree in co-relation 6948. Up to 1999 conditions per place. [2022-11-02 20:56:01,623 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 0 selfloop transitions, 0 changer transitions 249/249 dead transitions. [2022-11-02 20:56:01,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 249 transitions, 695 flow [2022-11-02 20:56:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:56:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1491 transitions. [2022-11-02 20:56:01,692 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7622699386503068 [2022-11-02 20:56:01,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1491 transitions. [2022-11-02 20:56:01,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1491 transitions. [2022-11-02 20:56:01,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:01,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1491 transitions. [2022-11-02 20:56:01,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:01,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:01,702 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:01,702 INFO L175 Difference]: Start difference. First operand has 250 places, 242 transitions, 541 flow. Second operand 6 states and 1491 transitions. [2022-11-02 20:56:01,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 249 transitions, 695 flow [2022-11-02 20:56:01,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 249 transitions, 688 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:56:01,708 INFO L231 Difference]: Finished difference. Result has 250 places, 0 transitions, 0 flow [2022-11-02 20:56:01,709 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=250, PETRI_TRANSITIONS=0} [2022-11-02 20:56:01,710 INFO L287 CegarLoopForPetriNet]: 299 programPoint places, -49 predicate places. [2022-11-02 20:56:01,711 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 0 transitions, 0 flow [2022-11-02 20:56:01,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:01,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2022-11-02 20:56:01,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2022-11-02 20:56:01,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2022-11-02 20:56:01,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2022-11-02 20:56:01,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2022-11-02 20:56:01,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2022-11-02 20:56:01,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2022-11-02 20:56:01,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2022-11-02 20:56:01,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2022-11-02 20:56:01,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2022-11-02 20:56:01,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2022-11-02 20:56:01,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2022-11-02 20:56:01,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2022-11-02 20:56:01,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2022-11-02 20:56:01,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2022-11-02 20:56:01,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2022-11-02 20:56:01,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2022-11-02 20:56:01,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2022-11-02 20:56:01,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2022-11-02 20:56:01,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2022-11-02 20:56:01,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2022-11-02 20:56:01,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2022-11-02 20:56:01,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2022-11-02 20:56:01,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2022-11-02 20:56:01,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2022-11-02 20:56:01,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2022-11-02 20:56:01,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2022-11-02 20:56:01,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2022-11-02 20:56:01,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2022-11-02 20:56:01,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2022-11-02 20:56:01,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2022-11-02 20:56:01,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2022-11-02 20:56:01,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2022-11-02 20:56:01,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2022-11-02 20:56:01,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2022-11-02 20:56:01,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2022-11-02 20:56:01,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2022-11-02 20:56:01,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2022-11-02 20:56:01,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (38 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (37 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2022-11-02 20:56:01,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2022-11-02 20:56:01,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2022-11-02 20:56:01,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2022-11-02 20:56:01,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2022-11-02 20:56:01,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 85 remaining) [2022-11-02 20:56:01,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 85 remaining) [2022-11-02 20:56:01,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 85 remaining) [2022-11-02 20:56:01,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2022-11-02 20:56:01,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2022-11-02 20:56:01,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2022-11-02 20:56:01,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2022-11-02 20:56:01,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2022-11-02 20:56:01,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2022-11-02 20:56:01,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2022-11-02 20:56:01,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2022-11-02 20:56:01,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2022-11-02 20:56:01,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2022-11-02 20:56:01,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2022-11-02 20:56:01,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2022-11-02 20:56:01,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2022-11-02 20:56:01,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2022-11-02 20:56:01,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2022-11-02 20:56:01,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2022-11-02 20:56:01,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2022-11-02 20:56:01,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2022-11-02 20:56:01,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2022-11-02 20:56:01,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2022-11-02 20:56:01,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2022-11-02 20:56:01,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2022-11-02 20:56:01,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2022-11-02 20:56:01,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2022-11-02 20:56:01,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:56:01,732 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] [2022-11-02 20:56:01,738 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:56:01,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:56:01,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:56:01 BasicIcfg [2022-11-02 20:56:01,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:56:01,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:56:01,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:56:01,748 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:56:01,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:49" (3/4) ... [2022-11-02 20:56:01,752 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:56:01,757 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:56:01,757 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:56:01,757 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:56:01,763 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-02 20:56:01,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:56:01,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:56:01,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:56:01,810 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:56:01,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:56:01,811 INFO L158 Benchmark]: Toolchain (without parser) took 14704.45ms. Allocated memory was 92.3MB in the beginning and 469.8MB in the end (delta: 377.5MB). Free memory was 67.2MB in the beginning and 352.5MB in the end (delta: -285.3MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,812 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:56:01,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.25ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 63.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.54ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 60.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,813 INFO L158 Benchmark]: Boogie Preprocessor took 73.09ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,813 INFO L158 Benchmark]: RCFGBuilder took 1420.33ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 57.8MB in the beginning and 80.2MB in the end (delta: -22.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,814 INFO L158 Benchmark]: TraceAbstraction took 12727.93ms. Allocated memory was 113.2MB in the beginning and 469.8MB in the end (delta: 356.5MB). Free memory was 79.6MB in the beginning and 357.8MB in the end (delta: -278.2MB). Peak memory consumption was 343.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,814 INFO L158 Benchmark]: Witness Printer took 63.26ms. Allocated memory is still 469.8MB. Free memory was 357.8MB in the beginning and 352.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:56:01,816 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.30ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.25ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 63.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.54ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 60.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.09ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 58.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1420.33ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 57.8MB in the beginning and 80.2MB in the end (delta: -22.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12727.93ms. Allocated memory was 113.2MB in the beginning and 469.8MB in the end (delta: 356.5MB). Free memory was 79.6MB in the beginning and 357.8MB in the end (delta: -278.2MB). Peak memory consumption was 343.1MB. Max. memory is 16.1GB. * Witness Printer took 63.26ms. Allocated memory is still 469.8MB. Free memory was 357.8MB in the beginning and 352.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: 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: 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: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: 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: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 374 locations, 85 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: 12.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132 IncrementalHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 208 mSDtfsCounter, 1132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1800 NumberOfCodeBlocks, 1800 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1781 ConstructedInterpolants, 0 QuantifiedInterpolants, 2248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:56:01,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b95d7a-c262-4440-a1d6-7d85d65ece18/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