./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 --- 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:26,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:55:26,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:55:26,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:55:26,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:55:26,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:55:26,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:55:26,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:55:26,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:55:26,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:55:26,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:55:26,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:55:26,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:55:26,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:55:26,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:55:26,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:55:26,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:55:26,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:55:26,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:55:26,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:55:26,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:55:26,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:55:26,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:55:26,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:55:26,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:55:26,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:55:26,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:55:26,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:55:26,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:55:26,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:55:26,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:55:26,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:55:26,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:55:26,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:55:26,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:55:26,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:55:26,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:55:26,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:55:26,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:55:26,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:55:26,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:55:26,985 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:55:27,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:55:27,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:55:27,023 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:55:27,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:55:27,024 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:55:27,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:55:27,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:55:27,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:55:27,026 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:55:27,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:55:27,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:55:27,027 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:55:27,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:55:27,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:55:27,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:55:27,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:55:27,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:55:27,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:55:27,029 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:55:27,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:55:27,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:55:27,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:55:27,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:55:27,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:55:27,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:55:27,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:55:27,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:27,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:55:27,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:55:27,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:55:27,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:55:27,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:55:27,032 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:55:27,032 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:55:27,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:55:27,032 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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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 -> 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 [2022-11-02 20:55:27,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:55:27,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:55:27,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:55:27,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:55:27,327 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:55:27,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-02 20:55:27,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/data/d2ab79570/592fc002f56244fab7bacfa97295c1a7/FLAG549724c69 [2022-11-02 20:55:27,834 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:55:27,835 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-02 20:55:27,841 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/data/d2ab79570/592fc002f56244fab7bacfa97295c1a7/FLAG549724c69 [2022-11-02 20:55:28,249 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/data/d2ab79570/592fc002f56244fab7bacfa97295c1a7 [2022-11-02 20:55:28,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:55:28,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:55:28,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:28,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:55:28,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:55:28,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:28" (1/1) ... [2022-11-02 20:55:28,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f95a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:28, skipping insertion in model container [2022-11-02 20:55:28,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:28" (1/1) ... [2022-11-02 20:55:28,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:55:28,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:55:28,502 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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-02 20:55:28,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:28,516 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:55:28,561 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_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-02 20:55:28,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:28,591 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:55:28,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:28 WrapperNode [2022-11-02 20:55:28,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:28,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:28,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:55:28,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:55:28,602 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:28" (1/1) ... [2022-11-02 20:55:28,623 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:28" (1/1) ... [2022-11-02 20:55:28,662 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 256 [2022-11-02 20:55:28,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:28,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:55:28,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:55:28,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:55:28,673 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:28" (1/1) ... [2022-11-02 20:55:28,674 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:28" (1/1) ... [2022-11-02 20:55:28,677 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:28" (1/1) ... [2022-11-02 20:55:28,678 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:28" (1/1) ... [2022-11-02 20:55:28,685 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:28" (1/1) ... [2022-11-02 20:55:28,688 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:28" (1/1) ... [2022-11-02 20:55:28,690 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:28" (1/1) ... [2022-11-02 20:55:28,691 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:28" (1/1) ... [2022-11-02 20:55:28,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:55:28,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:55:28,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:55:28,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:55:28,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:28" (1/1) ... [2022-11-02 20:55:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:28,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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:28,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:55:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:55:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:55:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:55:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:55:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:55:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:55:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:55:28,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:55:28,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:55:28,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:55:28,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:55:28,789 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:28,920 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:55:28,922 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:55:29,518 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:55:29,530 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:55:29,530 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:55:29,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:29 BoogieIcfgContainer [2022-11-02 20:55:29,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:55:29,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:55:29,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:55:29,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:55:29,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:55:28" (1/3) ... [2022-11-02 20:55:29,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9737c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:29, skipping insertion in model container [2022-11-02 20:55:29,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:28" (2/3) ... [2022-11-02 20:55:29,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9737c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:29, skipping insertion in model container [2022-11-02 20:55:29,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:29" (3/3) ... [2022-11-02 20:55:29,542 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2022-11-02 20:55:29,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:55:29,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:55:29,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-02 20:55:29,561 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:55:29,713 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:55:29,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 342 transitions, 700 flow [2022-11-02 20:55:29,898 INFO L130 PetriNetUnfolder]: 22/340 cut-off events. [2022-11-02 20:55:29,899 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:55:29,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 340 events. 22/340 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 756 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2022-11-02 20:55:29,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 342 transitions, 700 flow [2022-11-02 20:55:29,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 319 transitions, 650 flow [2022-11-02 20:55:29,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:55:29,932 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;@7c1b91e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:55:29,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-02 20:55:29,938 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-02 20:55:29,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:55:29,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:29,939 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:29,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1377772969, now seen corresponding path program 1 times [2022-11-02 20:55:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:29,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245546792] [2022-11-02 20:55:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:29,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,241 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:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:30,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245546792] [2022-11-02 20:55:30,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245546792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:30,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:30,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661899137] [2022-11-02 20:55:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:30,307 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:30,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:30,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:30,564 INFO L130 PetriNetUnfolder]: 40/661 cut-off events. [2022-11-02 20:55:30,565 INFO L131 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-11-02 20:55:30,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 661 events. 40/661 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2904 event pairs, 15 based on Foata normal form. 18/581 useless extension candidates. Maximal degree in co-relation 523. Up to 49 conditions per place. [2022-11-02 20:55:30,576 INFO L137 encePairwiseOnDemand]: 333/342 looper letters, 13 selfloop transitions, 2 changer transitions 2/312 dead transitions. [2022-11-02 20:55:30,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 312 transitions, 666 flow [2022-11-02 20:55:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-11-02 20:55:30,601 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9512670565302144 [2022-11-02 20:55:30,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-11-02 20:55:30,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-11-02 20:55:30,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:30,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-11-02 20:55:30,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call 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:30,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:30,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:30,630 INFO L175 Difference]: Start difference. First operand has 306 places, 319 transitions, 650 flow. Second operand 3 states and 976 transitions. [2022-11-02 20:55:30,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 312 transitions, 666 flow [2022-11-02 20:55:30,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 312 transitions, 658 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:30,662 INFO L231 Difference]: Finished difference. Result has 303 places, 310 transitions, 628 flow [2022-11-02 20:55:30,665 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=303, PETRI_TRANSITIONS=310} [2022-11-02 20:55:30,670 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -3 predicate places. [2022-11-02 20:55:30,670 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 310 transitions, 628 flow [2022-11-02 20:55:30,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:30,672 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:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:55:30,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 547237818, now seen corresponding path program 1 times [2022-11-02 20:55:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:30,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076215373] [2022-11-02 20:55:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,775 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:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:30,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076215373] [2022-11-02 20:55:30,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076215373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:30,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:30,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253537811] [2022-11-02 20:55:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:30,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:30,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:30,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:30,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:30,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:30,958 INFO L130 PetriNetUnfolder]: 40/661 cut-off events. [2022-11-02 20:55:30,958 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-02 20:55:30,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 661 events. 40/661 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2929 event pairs, 15 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 686. Up to 49 conditions per place. [2022-11-02 20:55:30,967 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-11-02 20:55:30,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 309 transitions, 656 flow [2022-11-02 20:55:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2022-11-02 20:55:30,971 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9454191033138402 [2022-11-02 20:55:30,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2022-11-02 20:55:30,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2022-11-02 20:55:30,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:30,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2022-11-02 20:55:30,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call 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:30,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:30,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:30,978 INFO L175 Difference]: Start difference. First operand has 303 places, 310 transitions, 628 flow. Second operand 3 states and 970 transitions. [2022-11-02 20:55:30,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 309 transitions, 656 flow [2022-11-02 20:55:30,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 309 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:30,988 INFO L231 Difference]: Finished difference. Result has 300 places, 309 transitions, 626 flow [2022-11-02 20:55:30,988 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=300, PETRI_TRANSITIONS=309} [2022-11-02 20:55:30,989 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -6 predicate places. [2022-11-02 20:55:30,989 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 309 transitions, 626 flow [2022-11-02 20:55:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:30,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:30,991 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] [2022-11-02 20:55:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:55:30,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2062833498, now seen corresponding path program 1 times [2022-11-02 20:55:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9916859] [2022-11-02 20:55:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,109 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:31,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9916859] [2022-11-02 20:55:31,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9916859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842897882] [2022-11-02 20:55:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:31,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:31,116 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 342 [2022-11-02 20:55:31,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:31,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 342 [2022-11-02 20:55:31,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:31,299 INFO L130 PetriNetUnfolder]: 83/934 cut-off events. [2022-11-02 20:55:31,299 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-02 20:55:31,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 934 events. 83/934 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5471 event pairs, 27 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 974. Up to 71 conditions per place. [2022-11-02 20:55:31,309 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2022-11-02 20:55:31,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 308 transitions, 660 flow [2022-11-02 20:55:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:55:31,313 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9395711500974658 [2022-11-02 20:55:31,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:31,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:31,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,322 INFO L175 Difference]: Start difference. First operand has 300 places, 309 transitions, 626 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:55:31,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 308 transitions, 660 flow [2022-11-02 20:55:31,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 308 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:31,328 INFO L231 Difference]: Finished difference. Result has 299 places, 308 transitions, 624 flow [2022-11-02 20:55:31,329 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=299, PETRI_TRANSITIONS=308} [2022-11-02 20:55:31,331 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -7 predicate places. [2022-11-02 20:55:31,331 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 308 transitions, 624 flow [2022-11-02 20:55:31,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:31,333 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] [2022-11-02 20:55:31,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:55:31,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash -127587150, now seen corresponding path program 1 times [2022-11-02 20:55:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876734376] [2022-11-02 20:55:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,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:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876734376] [2022-11-02 20:55:31,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876734376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143491697] [2022-11-02 20:55:31,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:31,426 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 342 [2022-11-02 20:55:31,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 308 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:31,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 342 [2022-11-02 20:55:31,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:31,587 INFO L130 PetriNetUnfolder]: 89/1025 cut-off events. [2022-11-02 20:55:31,587 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:55:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 1025 events. 89/1025 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6385 event pairs, 27 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1062. Up to 71 conditions per place. [2022-11-02 20:55:31,600 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-02 20:55:31,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 307 transitions, 658 flow [2022-11-02 20:55:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:55:31,603 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9395711500974658 [2022-11-02 20:55:31,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:31,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:31,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,614 INFO L175 Difference]: Start difference. First operand has 299 places, 308 transitions, 624 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:55:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 307 transitions, 658 flow [2022-11-02 20:55:31,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 307 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:31,620 INFO L231 Difference]: Finished difference. Result has 298 places, 307 transitions, 622 flow [2022-11-02 20:55:31,621 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=298, PETRI_TRANSITIONS=307} [2022-11-02 20:55:31,622 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2022-11-02 20:55:31,622 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 307 transitions, 622 flow [2022-11-02 20:55:31,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:31,629 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] [2022-11-02 20:55:31,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:55:31,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1008483242, now seen corresponding path program 1 times [2022-11-02 20:55:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158417587] [2022-11-02 20:55:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,693 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:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158417587] [2022-11-02 20:55:31,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158417587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289209814] [2022-11-02 20:55:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:31,697 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 342 [2022-11-02 20:55:31,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:31,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 342 [2022-11-02 20:55:31,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:31,837 INFO L130 PetriNetUnfolder]: 73/824 cut-off events. [2022-11-02 20:55:31,837 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-11-02 20:55:31,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 824 events. 73/824 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4630 event pairs, 27 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 860. Up to 79 conditions per place. [2022-11-02 20:55:31,846 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-02 20:55:31,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 306 transitions, 656 flow [2022-11-02 20:55:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:55:31,849 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9395711500974658 [2022-11-02 20:55:31,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:31,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:55:31,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:31,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:31,855 INFO L175 Difference]: Start difference. First operand has 298 places, 307 transitions, 622 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:55:31,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 306 transitions, 656 flow [2022-11-02 20:55:31,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 306 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:31,861 INFO L231 Difference]: Finished difference. Result has 297 places, 306 transitions, 620 flow [2022-11-02 20:55:31,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=297, PETRI_TRANSITIONS=306} [2022-11-02 20:55:31,863 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -9 predicate places. [2022-11-02 20:55:31,863 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 306 transitions, 620 flow [2022-11-02 20:55:31,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:31,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:31,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:55:31,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1300199161, now seen corresponding path program 1 times [2022-11-02 20:55:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980681402] [2022-11-02 20:55:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,904 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:31,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980681402] [2022-11-02 20:55:31,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980681402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202192494] [2022-11-02 20:55:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:31,907 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 342 [2022-11-02 20:55:31,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:31,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:31,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 342 [2022-11-02 20:55:31,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:32,065 INFO L130 PetriNetUnfolder]: 79/989 cut-off events. [2022-11-02 20:55:32,065 INFO L131 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2022-11-02 20:55:32,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 989 events. 79/989 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6223 event pairs, 27 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1019. Up to 76 conditions per place. [2022-11-02 20:55:32,074 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 20:55:32,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 305 transitions, 654 flow [2022-11-02 20:55:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:55:32,077 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9395711500974658 [2022-11-02 20:55:32,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:55:32,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:55:32,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:32,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:55:32,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,084 INFO L175 Difference]: Start difference. First operand has 297 places, 306 transitions, 620 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:55:32,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 305 transitions, 654 flow [2022-11-02 20:55:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 305 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:32,090 INFO L231 Difference]: Finished difference. Result has 296 places, 305 transitions, 618 flow [2022-11-02 20:55:32,090 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=296, PETRI_TRANSITIONS=305} [2022-11-02 20:55:32,091 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2022-11-02 20:55:32,091 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 305 transitions, 618 flow [2022-11-02 20:55:32,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call 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:32,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:32,092 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] [2022-11-02 20:55:32,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:55:32,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1925913167, now seen corresponding path program 1 times [2022-11-02 20:55:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61550310] [2022-11-02 20:55:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,133 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:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61550310] [2022-11-02 20:55:32,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61550310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:32,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148931624] [2022-11-02 20:55:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:32,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:32,136 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:32,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:32,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:32,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:32,253 INFO L130 PetriNetUnfolder]: 64/826 cut-off events. [2022-11-02 20:55:32,254 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:55:32,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 826 events. 64/826 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4506 event pairs, 8 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 808. Up to 36 conditions per place. [2022-11-02 20:55:32,262 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 13 selfloop transitions, 3 changer transitions 0/306 dead transitions. [2022-11-02 20:55:32,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 306 transitions, 653 flow [2022-11-02 20:55:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2022-11-02 20:55:32,266 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9483430799220273 [2022-11-02 20:55:32,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:32,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call 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:32,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,285 INFO L175 Difference]: Start difference. First operand has 296 places, 305 transitions, 618 flow. Second operand 3 states and 973 transitions. [2022-11-02 20:55:32,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 306 transitions, 653 flow [2022-11-02 20:55:32,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 306 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:32,291 INFO L231 Difference]: Finished difference. Result has 294 places, 305 transitions, 629 flow [2022-11-02 20:55:32,292 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=294, PETRI_TRANSITIONS=305} [2022-11-02 20:55:32,293 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2022-11-02 20:55:32,293 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 305 transitions, 629 flow [2022-11-02 20:55:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:32,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:32,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:55:32,294 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1588148741, now seen corresponding path program 1 times [2022-11-02 20:55:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580352830] [2022-11-02 20:55:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,388 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:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580352830] [2022-11-02 20:55:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580352830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008078442] [2022-11-02 20:55:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:32,393 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:32,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 305 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:32,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:32,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:32,540 INFO L130 PetriNetUnfolder]: 72/913 cut-off events. [2022-11-02 20:55:32,541 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:55:32,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 913 events. 72/913 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5385 event pairs, 8 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 820. Up to 36 conditions per place. [2022-11-02 20:55:32,551 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 13 selfloop transitions, 3 changer transitions 0/306 dead transitions. [2022-11-02 20:55:32,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 306 transitions, 664 flow [2022-11-02 20:55:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2022-11-02 20:55:32,554 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9483430799220273 [2022-11-02 20:55:32,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:32,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2022-11-02 20:55:32,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call 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:32,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,559 INFO L175 Difference]: Start difference. First operand has 294 places, 305 transitions, 629 flow. Second operand 3 states and 973 transitions. [2022-11-02 20:55:32,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 306 transitions, 664 flow [2022-11-02 20:55:32,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 306 transitions, 664 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:32,566 INFO L231 Difference]: Finished difference. Result has 294 places, 305 transitions, 644 flow [2022-11-02 20:55:32,566 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=294, PETRI_TRANSITIONS=305} [2022-11-02 20:55:32,570 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2022-11-02 20:55:32,570 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 305 transitions, 644 flow [2022-11-02 20:55:32,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:32,571 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] [2022-11-02 20:55:32,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:55:32,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 821400025, now seen corresponding path program 1 times [2022-11-02 20:55:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145909864] [2022-11-02 20:55:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,629 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:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145909864] [2022-11-02 20:55:32,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145909864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134284755] [2022-11-02 20:55:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:32,633 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:32,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 305 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:32,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:32,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:32,795 INFO L130 PetriNetUnfolder]: 72/1091 cut-off events. [2022-11-02 20:55:32,795 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-11-02 20:55:32,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 1091 events. 72/1091 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7016 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1003. Up to 55 conditions per place. [2022-11-02 20:55:32,806 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 15 selfloop transitions, 3 changer transitions 0/308 dead transitions. [2022-11-02 20:55:32,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 308 transitions, 689 flow [2022-11-02 20:55:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2022-11-02 20:55:32,810 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9502923976608187 [2022-11-02 20:55:32,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2022-11-02 20:55:32,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2022-11-02 20:55:32,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:32,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2022-11-02 20:55:32,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call 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:32,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:32,818 INFO L175 Difference]: Start difference. First operand has 294 places, 305 transitions, 644 flow. Second operand 3 states and 975 transitions. [2022-11-02 20:55:32,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 308 transitions, 689 flow [2022-11-02 20:55:32,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 308 transitions, 689 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:32,825 INFO L231 Difference]: Finished difference. Result has 294 places, 305 transitions, 659 flow [2022-11-02 20:55:32,826 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=294, PETRI_TRANSITIONS=305} [2022-11-02 20:55:32,827 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2022-11-02 20:55:32,827 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 305 transitions, 659 flow [2022-11-02 20:55:32,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:32,830 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] [2022-11-02 20:55:32,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:55:32,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1900280775, now seen corresponding path program 1 times [2022-11-02 20:55:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206662479] [2022-11-02 20:55:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,890 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:32,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206662479] [2022-11-02 20:55:32,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206662479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929485972] [2022-11-02 20:55:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:32,896 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:32,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 305 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:32,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:32,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:32,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:33,080 INFO L130 PetriNetUnfolder]: 78/1205 cut-off events. [2022-11-02 20:55:33,081 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-11-02 20:55:33,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1205 events. 78/1205 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8157 event pairs, 6 based on Foata normal form. 1/1061 useless extension candidates. Maximal degree in co-relation 1146. Up to 47 conditions per place. [2022-11-02 20:55:33,093 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 15 selfloop transitions, 3 changer transitions 0/308 dead transitions. [2022-11-02 20:55:33,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 308 transitions, 704 flow [2022-11-02 20:55:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2022-11-02 20:55:33,096 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9502923976608187 [2022-11-02 20:55:33,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2022-11-02 20:55:33,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2022-11-02 20:55:33,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:33,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2022-11-02 20:55:33,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call 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:33,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,102 INFO L175 Difference]: Start difference. First operand has 294 places, 305 transitions, 659 flow. Second operand 3 states and 975 transitions. [2022-11-02 20:55:33,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 308 transitions, 704 flow [2022-11-02 20:55:33,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 308 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:33,108 INFO L231 Difference]: Finished difference. Result has 294 places, 305 transitions, 674 flow [2022-11-02 20:55:33,109 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=294, PETRI_TRANSITIONS=305} [2022-11-02 20:55:33,110 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2022-11-02 20:55:33,110 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 305 transitions, 674 flow [2022-11-02 20:55:33,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:33,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:33,111 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] [2022-11-02 20:55:33,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:55:33,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -242620543, now seen corresponding path program 1 times [2022-11-02 20:55:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794493696] [2022-11-02 20:55:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:33,145 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:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794493696] [2022-11-02 20:55:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794493696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:33,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:33,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642241207] [2022-11-02 20:55:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:33,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:33,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:33,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:33,149 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 342 [2022-11-02 20:55:33,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 305 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:33,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:33,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 342 [2022-11-02 20:55:33,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:33,345 INFO L130 PetriNetUnfolder]: 64/1032 cut-off events. [2022-11-02 20:55:33,345 INFO L131 PetriNetUnfolder]: For 4/8 co-relation queries the response was YES. [2022-11-02 20:55:33,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 1032 events. 64/1032 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6696 event pairs, 4 based on Foata normal form. 1/914 useless extension candidates. Maximal degree in co-relation 995. Up to 37 conditions per place. [2022-11-02 20:55:33,355 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 20:55:33,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 305 transitions, 711 flow [2022-11-02 20:55:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2022-11-02 20:55:33,358 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.942495126705653 [2022-11-02 20:55:33,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2022-11-02 20:55:33,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2022-11-02 20:55:33,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:33,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2022-11-02 20:55:33,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call 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:33,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,364 INFO L175 Difference]: Start difference. First operand has 294 places, 305 transitions, 674 flow. Second operand 3 states and 967 transitions. [2022-11-02 20:55:33,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 305 transitions, 711 flow [2022-11-02 20:55:33,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 305 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:33,371 INFO L231 Difference]: Finished difference. Result has 295 places, 304 transitions, 676 flow [2022-11-02 20:55:33,371 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=295, PETRI_TRANSITIONS=304} [2022-11-02 20:55:33,372 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -11 predicate places. [2022-11-02 20:55:33,372 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 304 transitions, 676 flow [2022-11-02 20:55:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:33,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:33,389 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] [2022-11-02 20:55:33,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:55:33,389 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -698525273, now seen corresponding path program 1 times [2022-11-02 20:55:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368473191] [2022-11-02 20:55:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:33,434 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:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:33,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368473191] [2022-11-02 20:55:33,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368473191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:33,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463376251] [2022-11-02 20:55:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:33,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 342 [2022-11-02 20:55:33,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 304 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:33,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:33,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 342 [2022-11-02 20:55:33,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:33,686 INFO L130 PetriNetUnfolder]: 58/1293 cut-off events. [2022-11-02 20:55:33,686 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-02 20:55:33,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1293 events. 58/1293 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8142 event pairs, 2 based on Foata normal form. 0/1166 useless extension candidates. Maximal degree in co-relation 1228. Up to 42 conditions per place. [2022-11-02 20:55:33,703 INFO L137 encePairwiseOnDemand]: 338/342 looper letters, 13 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-02 20:55:33,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 307 transitions, 715 flow [2022-11-02 20:55:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2022-11-02 20:55:33,706 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551656920077972 [2022-11-02 20:55:33,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2022-11-02 20:55:33,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2022-11-02 20:55:33,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:33,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2022-11-02 20:55:33,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call 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:33,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:33,711 INFO L175 Difference]: Start difference. First operand has 295 places, 304 transitions, 676 flow. Second operand 3 states and 980 transitions. [2022-11-02 20:55:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 307 transitions, 715 flow [2022-11-02 20:55:33,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 307 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:33,719 INFO L231 Difference]: Finished difference. Result has 294 places, 304 transitions, 682 flow [2022-11-02 20:55:33,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=294, PETRI_TRANSITIONS=304} [2022-11-02 20:55:33,721 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2022-11-02 20:55:33,721 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 304 transitions, 682 flow [2022-11-02 20:55:33,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:33,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:33,722 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] [2022-11-02 20:55:33,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:55:33,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1593994999, now seen corresponding path program 1 times [2022-11-02 20:55:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:33,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351182589] [2022-11-02 20:55:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,182 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:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351182589] [2022-11-02 20:55:34,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351182589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246506985] [2022-11-02 20:55:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:34,187 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 342 [2022-11-02 20:55:34,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 304 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 313.8333333333333) internal successors, (1883), 6 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call 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:34,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:34,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 342 [2022-11-02 20:55:34,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:34,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][259], [Black: 364#true, 361#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 354#true, 380#(= |#race~filename_1~0| 0), 366#(= |#race~filename_2~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), Black: 359#true, 142#L69-7true, Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,405 INFO L383 tUnfolder$Statistics]: this new event has 165 ancestors and is cut-off event [2022-11-02 20:55:34,405 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:55:34,405 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:55:34,405 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:55:34,413 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([955] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][259], [Black: 364#true, 361#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 354#true, 380#(= |#race~filename_1~0| 0), 366#(= |#race~filename_2~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), Black: 359#true, 142#L69-7true, Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,413 INFO L383 tUnfolder$Statistics]: this new event has 165 ancestors and is not cut-off event [2022-11-02 20:55:34,413 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is not cut-off event [2022-11-02 20:55:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-11-02 20:55:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-02 20:55:34,414 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-11-02 20:55:34,419 INFO L130 PetriNetUnfolder]: 47/1099 cut-off events. [2022-11-02 20:55:34,420 INFO L131 PetriNetUnfolder]: For 5/52 co-relation queries the response was YES. [2022-11-02 20:55:34,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 1099 events. 47/1099 cut-off events. For 5/52 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6385 event pairs, 0 based on Foata normal form. 20/1007 useless extension candidates. Maximal degree in co-relation 1028. Up to 32 conditions per place. [2022-11-02 20:55:34,433 INFO L137 encePairwiseOnDemand]: 337/342 looper letters, 15 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2022-11-02 20:55:34,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 303 transitions, 718 flow [2022-11-02 20:55:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1892 transitions. [2022-11-02 20:55:34,438 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2022-11-02 20:55:34,438 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1892 transitions. [2022-11-02 20:55:34,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1892 transitions. [2022-11-02 20:55:34,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:34,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1892 transitions. [2022-11-02 20:55:34,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 315.3333333333333) internal successors, (1892), 6 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call 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:34,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 342.0) internal successors, (2394), 7 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call 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:34,447 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 342.0) internal successors, (2394), 7 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call 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:34,447 INFO L175 Difference]: Start difference. First operand has 294 places, 304 transitions, 682 flow. Second operand 6 states and 1892 transitions. [2022-11-02 20:55:34,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 303 transitions, 718 flow [2022-11-02 20:55:34,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 303 transitions, 718 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:34,455 INFO L231 Difference]: Finished difference. Result has 298 places, 303 transitions, 688 flow [2022-11-02 20:55:34,456 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=298, PETRI_TRANSITIONS=303} [2022-11-02 20:55:34,457 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2022-11-02 20:55:34,457 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 303 transitions, 688 flow [2022-11-02 20:55:34,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 313.8333333333333) internal successors, (1883), 6 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call 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:34,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:34,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:34,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:55:34,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1267861846, now seen corresponding path program 1 times [2022-11-02 20:55:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:34,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415182383] [2022-11-02 20:55:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,501 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:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415182383] [2022-11-02 20:55:34,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415182383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113326580] [2022-11-02 20:55:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:34,504 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 342 [2022-11-02 20:55:34,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 303 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:34,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:34,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 342 [2022-11-02 20:55:34,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:34,732 INFO L130 PetriNetUnfolder]: 59/1340 cut-off events. [2022-11-02 20:55:34,733 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-02 20:55:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1340 events. 59/1340 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8577 event pairs, 4 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1351. Up to 43 conditions per place. [2022-11-02 20:55:34,746 INFO L137 encePairwiseOnDemand]: 338/342 looper letters, 13 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-02 20:55:34,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 306 transitions, 727 flow [2022-11-02 20:55:34,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2022-11-02 20:55:34,749 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9551656920077972 [2022-11-02 20:55:34,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2022-11-02 20:55:34,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2022-11-02 20:55:34,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:34,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2022-11-02 20:55:34,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call 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:34,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:34,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:34,755 INFO L175 Difference]: Start difference. First operand has 298 places, 303 transitions, 688 flow. Second operand 3 states and 980 transitions. [2022-11-02 20:55:34,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 306 transitions, 727 flow [2022-11-02 20:55:34,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 306 transitions, 720 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:34,761 INFO L231 Difference]: Finished difference. Result has 295 places, 303 transitions, 691 flow [2022-11-02 20:55:34,761 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=295, PETRI_TRANSITIONS=303} [2022-11-02 20:55:34,762 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -11 predicate places. [2022-11-02 20:55:34,762 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 303 transitions, 691 flow [2022-11-02 20:55:34,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:34,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:34,763 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] [2022-11-02 20:55:34,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:55:34,763 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 424253994, now seen corresponding path program 1 times [2022-11-02 20:55:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:34,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567865295] [2022-11-02 20:55:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,798 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:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567865295] [2022-11-02 20:55:34,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567865295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:34,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847003581] [2022-11-02 20:55:34,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:34,801 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 342 [2022-11-02 20:55:34,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 303 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call 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:34,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:34,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 342 [2022-11-02 20:55:34,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:34,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][197], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 232#L50-47true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,959 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-02 20:55:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,959 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:55:34,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [205#L50-48true, 397#(= |thread2Thread1of1ForFork0_#t~nondet16#1| |#race~result_7~0|), 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,961 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-02 20:55:34,961 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:55:34,961 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:55:34,961 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:55:34,963 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [397#(= |thread2Thread1of1ForFork0_#t~nondet16#1| |#race~result_7~0|), 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, 115#L50-49true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,963 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:55:34,963 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:55:34,963 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,963 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,969 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][197], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 232#L50-47true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,970 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-02 20:55:34,970 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,970 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-02 20:55:34,970 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,970 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:55:34,970 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([887] L50-46-->L50-47: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet16#1=|v_thread2Thread1of1ForFork0_#t~nondet16#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet16#1][153], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 232#L50-47true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,970 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-02 20:55:34,971 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,971 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:55:34,971 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:55:34,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][197], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), 108#L52true, Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,979 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-02 20:55:34,979 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,980 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:55:34,980 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:55:34,983 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([887] L50-46-->L50-47: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet16#1=|v_thread2Thread1of1ForFork0_#t~nondet16#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet16#1][153], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 232#L50-47true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,983 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is not cut-off event [2022-11-02 20:55:34,984 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-02 20:55:34,984 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is not cut-off event [2022-11-02 20:55:34,984 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-02 20:55:34,984 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is not cut-off event [2022-11-02 20:55:34,984 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [397#(= |thread2Thread1of1ForFork0_#t~nondet16#1| |#race~result_7~0|), 205#L50-48true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,984 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-02 20:55:34,985 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:55:34,985 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:55:34,985 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-11-02 20:55:34,985 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:55:34,986 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [397#(= |thread2Thread1of1ForFork0_#t~nondet16#1| |#race~result_7~0|), 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), Black: 359#true, Black: 364#true, 115#L50-49true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,986 INFO L383 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-11-02 20:55:34,986 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:55:34,986 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-02 20:55:34,987 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,987 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,994 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([954] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][197], [395#true, 361#(= |#race~isNull_3~0| 0), 2#L68-7true, Black: 354#true, Black: 390#true, 366#(= |#race~filename_2~0| 0), 108#L52true, Black: 359#true, Black: 364#true, Black: 369#true, 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:34,994 INFO L383 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,994 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:55:34,994 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:55:34,995 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:55:34,995 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-02 20:55:35,006 INFO L130 PetriNetUnfolder]: 84/1194 cut-off events. [2022-11-02 20:55:35,006 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-02 20:55:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1194 events. 84/1194 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7412 event pairs, 7 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 1384. Up to 103 conditions per place. [2022-11-02 20:55:35,017 INFO L137 encePairwiseOnDemand]: 339/342 looper letters, 15 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-02 20:55:35,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 303 transitions, 726 flow [2022-11-02 20:55:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-11-02 20:55:35,020 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9415204678362573 [2022-11-02 20:55:35,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-11-02 20:55:35,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-11-02 20:55:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:35,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-11-02 20:55:35,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call 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:35,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:35,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:35,025 INFO L175 Difference]: Start difference. First operand has 295 places, 303 transitions, 691 flow. Second operand 3 states and 966 transitions. [2022-11-02 20:55:35,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 303 transitions, 726 flow [2022-11-02 20:55:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 303 transitions, 726 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:35,031 INFO L231 Difference]: Finished difference. Result has 296 places, 302 transitions, 693 flow [2022-11-02 20:55:35,032 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=296, PETRI_TRANSITIONS=302} [2022-11-02 20:55:35,032 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2022-11-02 20:55:35,032 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 302 transitions, 693 flow [2022-11-02 20:55:35,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call 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:35,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:35,033 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] [2022-11-02 20:55:35,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:55:35,033 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 412013268, now seen corresponding path program 1 times [2022-11-02 20:55:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571575536] [2022-11-02 20:55:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,608 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:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:35,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571575536] [2022-11-02 20:55:35,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571575536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:35,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:35,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001533509] [2022-11-02 20:55:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:35,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:35,616 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 342 [2022-11-02 20:55:35,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 302 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 314.8333333333333) internal successors, (1889), 6 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call 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:35,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:35,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 342 [2022-11-02 20:55:35,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:35,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][257], [395#true, 361#(= |#race~isNull_3~0| 0), Black: 354#true, 366#(= |#race~filename_2~0| 0), Black: 390#true, Black: 359#true, Black: 364#true, Black: 369#true, 404#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), 142#L69-7true, Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:35,825 INFO L383 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2022-11-02 20:55:35,825 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:55:35,825 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:55:35,825 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:55:35,832 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([955] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][257], [395#true, 361#(= |#race~isNull_3~0| 0), Black: 354#true, 366#(= |#race~filename_2~0| 0), Black: 390#true, Black: 359#true, Black: 364#true, Black: 369#true, 404#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 380#(= |#race~filename_1~0| 0), 371#(= |#race~filename_5~0| 0), 356#(= |#race~isNull_0~0| 0), 392#(= |#race~filename_4~0| 0), Black: 378#true, 142#L69-7true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:35,833 INFO L383 tUnfolder$Statistics]: this new event has 165 ancestors and is not cut-off event [2022-11-02 20:55:35,833 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is not cut-off event [2022-11-02 20:55:35,833 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-02 20:55:35,833 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-11-02 20:55:35,833 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-11-02 20:55:35,839 INFO L130 PetriNetUnfolder]: 48/1116 cut-off events. [2022-11-02 20:55:35,839 INFO L131 PetriNetUnfolder]: For 5/50 co-relation queries the response was YES. [2022-11-02 20:55:35,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1116 events. 48/1116 cut-off events. For 5/50 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6516 event pairs, 0 based on Foata normal form. 8/1040 useless extension candidates. Maximal degree in co-relation 1213. Up to 24 conditions per place. [2022-11-02 20:55:35,851 INFO L137 encePairwiseOnDemand]: 337/342 looper letters, 14 selfloop transitions, 4 changer transitions 0/301 dead transitions. [2022-11-02 20:55:35,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 301 transitions, 727 flow [2022-11-02 20:55:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1891 transitions. [2022-11-02 20:55:35,856 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9215399610136452 [2022-11-02 20:55:35,857 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1891 transitions. [2022-11-02 20:55:35,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1891 transitions. [2022-11-02 20:55:35,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:35,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1891 transitions. [2022-11-02 20:55:35,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 315.1666666666667) internal successors, (1891), 6 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call 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:35,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 342.0) internal successors, (2394), 7 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call 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:35,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 342.0) internal successors, (2394), 7 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call 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:35,867 INFO L175 Difference]: Start difference. First operand has 296 places, 302 transitions, 693 flow. Second operand 6 states and 1891 transitions. [2022-11-02 20:55:35,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 301 transitions, 727 flow [2022-11-02 20:55:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 301 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:35,874 INFO L231 Difference]: Finished difference. Result has 298 places, 301 transitions, 695 flow [2022-11-02 20:55:35,874 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=695, PETRI_PLACES=298, PETRI_TRANSITIONS=301} [2022-11-02 20:55:35,876 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2022-11-02 20:55:35,876 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 301 transitions, 695 flow [2022-11-02 20:55:35,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.8333333333333) internal successors, (1889), 6 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call 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:35,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:35,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:55:35,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1829029377, now seen corresponding path program 1 times [2022-11-02 20:55:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795727586] [2022-11-02 20:55:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,956 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:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:35,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795727586] [2022-11-02 20:55:35,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795727586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:35,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:35,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165701560] [2022-11-02 20:55:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:35,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:35,961 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 342 [2022-11-02 20:55:35,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 301 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:35,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:35,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 342 [2022-11-02 20:55:35,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:36,247 INFO L130 PetriNetUnfolder]: 85/1652 cut-off events. [2022-11-02 20:55:36,248 INFO L131 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2022-11-02 20:55:36,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1652 events. 85/1652 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11430 event pairs, 11 based on Foata normal form. 1/1517 useless extension candidates. Maximal degree in co-relation 1694. Up to 44 conditions per place. [2022-11-02 20:55:36,260 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 15 selfloop transitions, 3 changer transitions 0/307 dead transitions. [2022-11-02 20:55:36,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 307 transitions, 746 flow [2022-11-02 20:55:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2022-11-02 20:55:36,263 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9619883040935673 [2022-11-02 20:55:36,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:36,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call 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:36,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:36,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:36,269 INFO L175 Difference]: Start difference. First operand has 298 places, 301 transitions, 695 flow. Second operand 3 states and 987 transitions. [2022-11-02 20:55:36,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 307 transitions, 746 flow [2022-11-02 20:55:36,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 307 transitions, 739 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:36,276 INFO L231 Difference]: Finished difference. Result has 298 places, 304 transitions, 718 flow [2022-11-02 20:55:36,276 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=298, PETRI_TRANSITIONS=304} [2022-11-02 20:55:36,277 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2022-11-02 20:55:36,277 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 304 transitions, 718 flow [2022-11-02 20:55:36,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:36,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:36,278 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] [2022-11-02 20:55:36,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:55:36,278 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -155541050, now seen corresponding path program 1 times [2022-11-02 20:55:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:36,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173563204] [2022-11-02 20:55:36,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:36,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173563204] [2022-11-02 20:55:36,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173563204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:36,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:36,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956982988] [2022-11-02 20:55:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:36,363 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 342 [2022-11-02 20:55:36,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 304 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:36,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:36,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 342 [2022-11-02 20:55:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:36,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][266], [369#true, 408#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 378#true, 361#(= |#race~isNull_3~0| 0), Black: 354#true, Black: 359#true, 364#true, 390#true, 414#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 404#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 356#(= |#race~isNull_0~0| 0), Black: 406#true, 142#L69-7true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0))]) [2022-11-02 20:55:36,675 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is not cut-off event [2022-11-02 20:55:36,675 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is not cut-off event [2022-11-02 20:55:36,675 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is not cut-off event [2022-11-02 20:55:36,675 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is not cut-off event [2022-11-02 20:55:36,737 INFO L130 PetriNetUnfolder]: 87/2277 cut-off events. [2022-11-02 20:55:36,737 INFO L131 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2022-11-02 20:55:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 2277 events. 87/2277 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18657 event pairs, 11 based on Foata normal form. 0/2134 useless extension candidates. Maximal degree in co-relation 2373. Up to 54 conditions per place. [2022-11-02 20:55:36,753 INFO L137 encePairwiseOnDemand]: 334/342 looper letters, 13 selfloop transitions, 5 changer transitions 0/310 dead transitions. [2022-11-02 20:55:36,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 310 transitions, 769 flow [2022-11-02 20:55:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2022-11-02 20:55:36,756 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9619883040935673 [2022-11-02 20:55:36,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:36,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2022-11-02 20:55:36,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call 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:36,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:36,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:36,762 INFO L175 Difference]: Start difference. First operand has 298 places, 304 transitions, 718 flow. Second operand 3 states and 987 transitions. [2022-11-02 20:55:36,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 310 transitions, 769 flow [2022-11-02 20:55:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 310 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:36,769 INFO L231 Difference]: Finished difference. Result has 301 places, 307 transitions, 753 flow [2022-11-02 20:55:36,770 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=301, PETRI_TRANSITIONS=307} [2022-11-02 20:55:36,771 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -5 predicate places. [2022-11-02 20:55:36,771 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 307 transitions, 753 flow [2022-11-02 20:55:36,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:36,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:36,772 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] [2022-11-02 20:55:36,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:55:36,772 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2047016838, now seen corresponding path program 1 times [2022-11-02 20:55:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492082879] [2022-11-02 20:55:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,835 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:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:36,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492082879] [2022-11-02 20:55:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492082879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684954812] [2022-11-02 20:55:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:36,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:36,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:36,840 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:36,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 307 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call 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:36,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:36,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:37,226 INFO L130 PetriNetUnfolder]: 86/2201 cut-off events. [2022-11-02 20:55:37,226 INFO L131 PetriNetUnfolder]: For 41/48 co-relation queries the response was YES. [2022-11-02 20:55:37,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 2201 events. 86/2201 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18184 event pairs, 16 based on Foata normal form. 0/2079 useless extension candidates. Maximal degree in co-relation 2382. Up to 74 conditions per place. [2022-11-02 20:55:37,246 INFO L137 encePairwiseOnDemand]: 338/342 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2022-11-02 20:55:37,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 304 transitions, 771 flow [2022-11-02 20:55:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2022-11-02 20:55:37,249 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2022-11-02 20:55:37,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 969 transitions. [2022-11-02 20:55:37,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 969 transitions. [2022-11-02 20:55:37,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:37,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 969 transitions. [2022-11-02 20:55:37,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call 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:37,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:37,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:37,256 INFO L175 Difference]: Start difference. First operand has 301 places, 307 transitions, 753 flow. Second operand 3 states and 969 transitions. [2022-11-02 20:55:37,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 304 transitions, 771 flow [2022-11-02 20:55:37,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 304 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:37,262 INFO L231 Difference]: Finished difference. Result has 298 places, 304 transitions, 739 flow [2022-11-02 20:55:37,263 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=298, PETRI_TRANSITIONS=304} [2022-11-02 20:55:37,263 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2022-11-02 20:55:37,263 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 304 transitions, 739 flow [2022-11-02 20:55:37,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call 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:37,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:37,264 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] [2022-11-02 20:55:37,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:55:37,265 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1453977896, now seen corresponding path program 1 times [2022-11-02 20:55:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:37,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672031270] [2022-11-02 20:55:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,325 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:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:37,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672031270] [2022-11-02 20:55:37,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672031270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:37,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:37,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748118742] [2022-11-02 20:55:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:37,329 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 342 [2022-11-02 20:55:37,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 304 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:37,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:37,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 342 [2022-11-02 20:55:37,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:37,648 INFO L130 PetriNetUnfolder]: 69/1907 cut-off events. [2022-11-02 20:55:37,649 INFO L131 PetriNetUnfolder]: For 42/51 co-relation queries the response was YES. [2022-11-02 20:55:37,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 1907 events. 69/1907 cut-off events. For 42/51 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14341 event pairs, 9 based on Foata normal form. 0/1796 useless extension candidates. Maximal degree in co-relation 1976. Up to 43 conditions per place. [2022-11-02 20:55:37,662 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 18 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2022-11-02 20:55:37,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 310 transitions, 802 flow [2022-11-02 20:55:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2022-11-02 20:55:37,666 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9619883040935673 [2022-11-02 20:55:37,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2022-11-02 20:55:37,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2022-11-02 20:55:37,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:37,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2022-11-02 20:55:37,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call 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:37,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:37,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:37,671 INFO L175 Difference]: Start difference. First operand has 298 places, 304 transitions, 739 flow. Second operand 3 states and 987 transitions. [2022-11-02 20:55:37,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 310 transitions, 802 flow [2022-11-02 20:55:37,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 310 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:37,678 INFO L231 Difference]: Finished difference. Result has 301 places, 307 transitions, 774 flow [2022-11-02 20:55:37,678 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=301, PETRI_TRANSITIONS=307} [2022-11-02 20:55:37,679 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -5 predicate places. [2022-11-02 20:55:37,679 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 307 transitions, 774 flow [2022-11-02 20:55:37,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call 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:37,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:37,680 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] [2022-11-02 20:55:37,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:55:37,680 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:55:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 313538361, now seen corresponding path program 1 times [2022-11-02 20:55:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125532140] [2022-11-02 20:55:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,748 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:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:37,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125532140] [2022-11-02 20:55:37,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125532140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:37,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:37,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545838010] [2022-11-02 20:55:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:37,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:37,753 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2022-11-02 20:55:37,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 307 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call 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:37,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:37,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2022-11-02 20:55:37,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:38,044 INFO L130 PetriNetUnfolder]: 89/1912 cut-off events. [2022-11-02 20:55:38,045 INFO L131 PetriNetUnfolder]: For 67/86 co-relation queries the response was YES. [2022-11-02 20:55:38,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1912 events. 89/1912 cut-off events. For 67/86 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 14197 event pairs, 17 based on Foata normal form. 7/1822 useless extension candidates. Maximal degree in co-relation 2230. Up to 135 conditions per place. [2022-11-02 20:55:38,059 INFO L137 encePairwiseOnDemand]: 336/342 looper letters, 0 selfloop transitions, 0 changer transitions 306/306 dead transitions. [2022-11-02 20:55:38,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 306 transitions, 798 flow [2022-11-02 20:55:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2022-11-02 20:55:38,062 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9454191033138402 [2022-11-02 20:55:38,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2022-11-02 20:55:38,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2022-11-02 20:55:38,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:38,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2022-11-02 20:55:38,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call 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:38,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:38,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 342.0) internal successors, (1368), 4 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call 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:38,068 INFO L175 Difference]: Start difference. First operand has 301 places, 307 transitions, 774 flow. Second operand 3 states and 970 transitions. [2022-11-02 20:55:38,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 306 transitions, 798 flow [2022-11-02 20:55:38,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 306 transitions, 789 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:38,074 INFO L231 Difference]: Finished difference. Result has 299 places, 0 transitions, 0 flow [2022-11-02 20:55:38,075 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=299, PETRI_TRANSITIONS=0} [2022-11-02 20:55:38,077 INFO L287 CegarLoopForPetriNet]: 306 programPoint places, -7 predicate places. [2022-11-02 20:55:38,077 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 0 transitions, 0 flow [2022-11-02 20:55:38,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call 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:38,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (51 of 52 remaining) [2022-11-02 20:55:38,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2022-11-02 20:55:38,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2022-11-02 20:55:38,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2022-11-02 20:55:38,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2022-11-02 20:55:38,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2022-11-02 20:55:38,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2022-11-02 20:55:38,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2022-11-02 20:55:38,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2022-11-02 20:55:38,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2022-11-02 20:55:38,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2022-11-02 20:55:38,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2022-11-02 20:55:38,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2022-11-02 20:55:38,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2022-11-02 20:55:38,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2022-11-02 20:55:38,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2022-11-02 20:55:38,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2022-11-02 20:55:38,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2022-11-02 20:55:38,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2022-11-02 20:55:38,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2022-11-02 20:55:38,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2022-11-02 20:55:38,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2022-11-02 20:55:38,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2022-11-02 20:55:38,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2022-11-02 20:55:38,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2022-11-02 20:55:38,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2022-11-02 20:55:38,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2022-11-02 20:55:38,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2022-11-02 20:55:38,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2022-11-02 20:55:38,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2022-11-02 20:55:38,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2022-11-02 20:55:38,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2022-11-02 20:55:38,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:55:38,090 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:38,098 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:55:38,098 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:55:38,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:55:38 BasicIcfg [2022-11-02 20:55:38,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:55:38,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:55:38,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:55:38,107 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:55:38,107 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:29" (3/4) ... [2022-11-02 20:55:38,110 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:55:38,117 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:55:38,117 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:55:38,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-02 20:55:38,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:55:38,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:55:38,125 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:55:38,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:55:38,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:55:38,182 INFO L158 Benchmark]: Toolchain (without parser) took 9928.48ms. Allocated memory was 88.1MB in the beginning and 287.3MB in the end (delta: 199.2MB). Free memory was 55.3MB in the beginning and 249.7MB in the end (delta: -194.4MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,182 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:38,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.82ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 55.1MB in the beginning and 91.0MB in the end (delta: -35.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.97ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,183 INFO L158 Benchmark]: Boogie Preprocessor took 31.63ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 86.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,183 INFO L158 Benchmark]: RCFGBuilder took 838.18ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 63.5MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,184 INFO L158 Benchmark]: TraceAbstraction took 8570.33ms. Allocated memory was 117.4MB in the beginning and 287.3MB in the end (delta: 169.9MB). Free memory was 62.8MB in the beginning and 252.8MB in the end (delta: -190.0MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,184 INFO L158 Benchmark]: Witness Printer took 74.24ms. Allocated memory is still 287.3MB. Free memory was 252.8MB in the beginning and 249.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:38,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.82ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 55.1MB in the beginning and 91.0MB in the end (delta: -35.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.97ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.63ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 86.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 838.18ms. Allocated memory is still 117.4MB. Free memory was 86.8MB in the beginning and 63.5MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8570.33ms. Allocated memory was 117.4MB in the beginning and 287.3MB in the end (delta: 169.9MB). Free memory was 62.8MB in the beginning and 252.8MB in the end (delta: -190.0MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * Witness Printer took 74.24ms. Allocated memory is still 287.3MB. Free memory was 252.8MB in the beginning and 249.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 487 locations, 52 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: 8.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 190 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=20, InterpolantAutomatonStates: 69, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1719 NumberOfCodeBlocks, 1719 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1698 ConstructedInterpolants, 0 QuantifiedInterpolants, 2020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:55:38,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de87af20-5c3f-48d2-bacc-9d52d09e4a5e/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