./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/dekker-b.i --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_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/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_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/dekker-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/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_1d7656a8-57e9-4763-adc2-44095568e6a6/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 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 --- 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 19:53:58,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:53:58,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:53:58,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:53:58,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:53:58,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:53:58,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:53:58,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:53:58,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:53:58,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:53:58,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:53:58,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:53:58,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:53:58,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:53:58,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:53:58,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:53:58,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:53:58,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:53:58,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:53:58,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:53:58,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:53:58,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:53:58,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:53:58,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:53:58,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:53:58,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:53:58,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:53:58,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:53:58,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:53:58,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:53:58,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:53:58,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:53:58,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:53:58,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:53:58,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:53:58,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:53:58,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:53:58,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:53:58,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:53:58,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:53:58,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:53:58,991 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 19:53:59,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:53:59,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:53:59,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:53:59,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:53:59,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:53:59,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:53:59,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:53:59,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:53:59,021 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:53:59,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:53:59,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:53:59,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 19:53:59,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:53:59,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:53:59,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:53:59,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:53:59,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:53:59,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:53:59,023 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 19:53:59,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:53:59,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:53:59,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:53:59,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:53:59,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:53:59,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:53:59,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:53:59,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:59,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:53:59,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:53:59,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:53:59,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:53:59,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:53:59,027 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:53:59,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:53:59,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:53:59,028 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_1d7656a8-57e9-4763-adc2-44095568e6a6/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_1d7656a8-57e9-4763-adc2-44095568e6a6/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 -> 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 [2022-11-02 19:53:59,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:53:59,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:53:59,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:53:59,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:53:59,348 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:53:59,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/dekker-b.i [2022-11-02 19:53:59,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/data/5f1cd163f/78e18ed175fc4d289d7387fb376115e6/FLAG441150b28 [2022-11-02 19:54:00,075 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:54:00,076 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/sv-benchmarks/c/pthread-atomic/dekker-b.i [2022-11-02 19:54:00,090 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/data/5f1cd163f/78e18ed175fc4d289d7387fb376115e6/FLAG441150b28 [2022-11-02 19:54:00,364 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/data/5f1cd163f/78e18ed175fc4d289d7387fb376115e6 [2022-11-02 19:54:00,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:54:00,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:54:00,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:54:00,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:54:00,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:54:00,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:00" (1/1) ... [2022-11-02 19:54:00,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6c4a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:00, skipping insertion in model container [2022-11-02 19:54:00,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:00" (1/1) ... [2022-11-02 19:54:00,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:54:00,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:54:00,940 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_1d7656a8-57e9-4763-adc2-44095568e6a6/sv-benchmarks/c/pthread-atomic/dekker-b.i[30165,30178] [2022-11-02 19:54:00,948 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_1d7656a8-57e9-4763-adc2-44095568e6a6/sv-benchmarks/c/pthread-atomic/dekker-b.i[30411,30424] [2022-11-02 19:54:00,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:54:00,980 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:54:01,055 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_1d7656a8-57e9-4763-adc2-44095568e6a6/sv-benchmarks/c/pthread-atomic/dekker-b.i[30165,30178] [2022-11-02 19:54:01,058 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_1d7656a8-57e9-4763-adc2-44095568e6a6/sv-benchmarks/c/pthread-atomic/dekker-b.i[30411,30424] [2022-11-02 19:54:01,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:54:01,118 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:54:01,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01 WrapperNode [2022-11-02 19:54:01,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:54:01,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:54:01,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:54:01,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:54:01,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,206 INFO L138 Inliner]: procedures = 168, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-11-02 19:54:01,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:54:01,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:54:01,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:54:01,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:54:01,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,240 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:54:01,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:54:01,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:54:01,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:54:01,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (1/1) ... [2022-11-02 19:54:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:54:01,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:54:01,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:54:01,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:54:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 19:54:01,353 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-02 19:54:01,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-02 19:54:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 19:54:01,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:54:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:54:01,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:54:01,361 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 19:54:01,501 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:54:01,503 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:54:01,877 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:54:01,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:54:01,911 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 19:54:01,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:01 BoogieIcfgContainer [2022-11-02 19:54:01,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:54:01,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:54:01,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:54:01,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:54:01,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:54:00" (1/3) ... [2022-11-02 19:54:01,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4b504f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:01, skipping insertion in model container [2022-11-02 19:54:01,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:01" (2/3) ... [2022-11-02 19:54:01,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4b504f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:01, skipping insertion in model container [2022-11-02 19:54:01,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:01" (3/3) ... [2022-11-02 19:54:01,941 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2022-11-02 19:54:01,951 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 19:54:01,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:54:01,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-11-02 19:54:01,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 19:54:02,117 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 19:54:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 203 transitions, 422 flow [2022-11-02 19:54:02,329 INFO L130 PetriNetUnfolder]: 14/201 cut-off events. [2022-11-02 19:54:02,330 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 19:54:02,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 201 events. 14/201 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 454 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 145. Up to 3 conditions per place. [2022-11-02 19:54:02,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 203 transitions, 422 flow [2022-11-02 19:54:02,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 191 transitions, 391 flow [2022-11-02 19:54:02,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:54:02,372 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;@3a5e4cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:54:02,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-02 19:54:02,380 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-11-02 19:54:02,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 19:54:02,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:02,381 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] [2022-11-02 19:54:02,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -468392683, now seen corresponding path program 1 times [2022-11-02 19:54:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124888135] [2022-11-02 19:54:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:02,654 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 19:54:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:02,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124888135] [2022-11-02 19:54:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124888135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:02,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:02,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510604863] [2022-11-02 19:54:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:02,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:02,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:02,710 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 203 [2022-11-02 19:54:02,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 191 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:02,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:02,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 203 [2022-11-02 19:54:02,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:03,154 INFO L130 PetriNetUnfolder]: 166/1083 cut-off events. [2022-11-02 19:54:03,154 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-11-02 19:54:03,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1083 events. 166/1083 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7635 event pairs, 39 based on Foata normal form. 69/909 useless extension candidates. Maximal degree in co-relation 1169. Up to 149 conditions per place. [2022-11-02 19:54:03,176 INFO L137 encePairwiseOnDemand]: 179/203 looper letters, 30 selfloop transitions, 11 changer transitions 1/196 dead transitions. [2022-11-02 19:54:03,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 196 transitions, 489 flow [2022-11-02 19:54:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-11-02 19:54:03,213 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2022-11-02 19:54:03,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2022-11-02 19:54:03,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2022-11-02 19:54:03,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:03,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2022-11-02 19:54:03,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,245 INFO L175 Difference]: Start difference. First operand has 184 places, 191 transitions, 391 flow. Second operand 3 states and 558 transitions. [2022-11-02 19:54:03,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 196 transitions, 489 flow [2022-11-02 19:54:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 196 transitions, 481 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 19:54:03,266 INFO L231 Difference]: Finished difference. Result has 181 places, 189 transitions, 454 flow [2022-11-02 19:54:03,270 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=181, PETRI_TRANSITIONS=189} [2022-11-02 19:54:03,279 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2022-11-02 19:54:03,280 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 189 transitions, 454 flow [2022-11-02 19:54:03,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:03,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:54:03,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1905730905, now seen corresponding path program 1 times [2022-11-02 19:54:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:03,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319788392] [2022-11-02 19:54:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:03,506 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 19:54:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319788392] [2022-11-02 19:54:03,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319788392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:03,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:03,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:54:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922424222] [2022-11-02 19:54:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:03,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:54:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:54:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:54:03,512 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 203 [2022-11-02 19:54:03,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 189 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:03,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 203 [2022-11-02 19:54:03,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:03,705 INFO L130 PetriNetUnfolder]: 90/763 cut-off events. [2022-11-02 19:54:03,705 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-11-02 19:54:03,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 763 events. 90/763 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4792 event pairs, 18 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 927. Up to 71 conditions per place. [2022-11-02 19:54:03,716 INFO L137 encePairwiseOnDemand]: 192/203 looper letters, 19 selfloop transitions, 7 changer transitions 0/194 dead transitions. [2022-11-02 19:54:03,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 194 transitions, 518 flow [2022-11-02 19:54:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:54:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 19:54:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 718 transitions. [2022-11-02 19:54:03,719 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842364532019704 [2022-11-02 19:54:03,719 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 718 transitions. [2022-11-02 19:54:03,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 718 transitions. [2022-11-02 19:54:03,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:03,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 718 transitions. [2022-11-02 19:54:03,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,727 INFO L175 Difference]: Start difference. First operand has 181 places, 189 transitions, 454 flow. Second operand 4 states and 718 transitions. [2022-11-02 19:54:03,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 194 transitions, 518 flow [2022-11-02 19:54:03,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 194 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:03,741 INFO L231 Difference]: Finished difference. Result has 183 places, 191 transitions, 474 flow [2022-11-02 19:54:03,741 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=183, PETRI_TRANSITIONS=191} [2022-11-02 19:54:03,742 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, -1 predicate places. [2022-11-02 19:54:03,742 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 191 transitions, 474 flow [2022-11-02 19:54:03,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:03,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:03,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:54:03,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 719811529, now seen corresponding path program 1 times [2022-11-02 19:54:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:03,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134181809] [2022-11-02 19:54:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:03,831 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 19:54:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:03,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134181809] [2022-11-02 19:54:03,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134181809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:03,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:03,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890408206] [2022-11-02 19:54:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:03,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:03,836 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 203 [2022-11-02 19:54:03,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 191 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:03,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 203 [2022-11-02 19:54:03,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:04,080 INFO L130 PetriNetUnfolder]: 103/958 cut-off events. [2022-11-02 19:54:04,080 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-02 19:54:04,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 958 events. 103/958 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6394 event pairs, 46 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1150. Up to 136 conditions per place. [2022-11-02 19:54:04,090 INFO L137 encePairwiseOnDemand]: 198/203 looper letters, 22 selfloop transitions, 4 changer transitions 0/197 dead transitions. [2022-11-02 19:54:04,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 197 transitions, 540 flow [2022-11-02 19:54:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-11-02 19:54:04,093 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.896551724137931 [2022-11-02 19:54:04,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2022-11-02 19:54:04,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2022-11-02 19:54:04,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:04,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2022-11-02 19:54:04,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,098 INFO L175 Difference]: Start difference. First operand has 183 places, 191 transitions, 474 flow. Second operand 3 states and 546 transitions. [2022-11-02 19:54:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 197 transitions, 540 flow [2022-11-02 19:54:04,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 197 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 19:54:04,110 INFO L231 Difference]: Finished difference. Result has 186 places, 194 transitions, 502 flow [2022-11-02 19:54:04,111 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=186, PETRI_TRANSITIONS=194} [2022-11-02 19:54:04,113 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 2 predicate places. [2022-11-02 19:54:04,114 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 194 transitions, 502 flow [2022-11-02 19:54:04,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:04,115 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] [2022-11-02 19:54:04,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:54:04,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash -865887377, now seen corresponding path program 1 times [2022-11-02 19:54:04,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:04,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709998311] [2022-11-02 19:54:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:04,196 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 19:54:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709998311] [2022-11-02 19:54:04,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709998311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:04,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:04,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175420942] [2022-11-02 19:54:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:04,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:04,201 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 203 [2022-11-02 19:54:04,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 194 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:04,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 203 [2022-11-02 19:54:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:04,614 INFO L130 PetriNetUnfolder]: 226/1912 cut-off events. [2022-11-02 19:54:04,614 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-02 19:54:04,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1912 events. 226/1912 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16613 event pairs, 40 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 2502. Up to 191 conditions per place. [2022-11-02 19:54:04,638 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 26 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2022-11-02 19:54:04,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 597 flow [2022-11-02 19:54:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-11-02 19:54:04,641 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2022-11-02 19:54:04,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2022-11-02 19:54:04,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2022-11-02 19:54:04,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:04,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2022-11-02 19:54:04,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,652 INFO L175 Difference]: Start difference. First operand has 186 places, 194 transitions, 502 flow. Second operand 3 states and 558 transitions. [2022-11-02 19:54:04,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 597 flow [2022-11-02 19:54:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 208 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:04,661 INFO L231 Difference]: Finished difference. Result has 188 places, 200 transitions, 544 flow [2022-11-02 19:54:04,662 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=188, PETRI_TRANSITIONS=200} [2022-11-02 19:54:04,670 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 4 predicate places. [2022-11-02 19:54:04,670 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 200 transitions, 544 flow [2022-11-02 19:54:04,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:04,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:54:04,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1284984723, now seen corresponding path program 1 times [2022-11-02 19:54:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:04,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065342386] [2022-11-02 19:54:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:54:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065342386] [2022-11-02 19:54:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065342386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:04,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:04,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:04,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165165357] [2022-11-02 19:54:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:04,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:04,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:04,804 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 203 [2022-11-02 19:54:04,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 200 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:04,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:04,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 203 [2022-11-02 19:54:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:05,163 INFO L130 PetriNetUnfolder]: 231/1822 cut-off events. [2022-11-02 19:54:05,163 INFO L131 PetriNetUnfolder]: For 344/370 co-relation queries the response was YES. [2022-11-02 19:54:05,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1822 events. 231/1822 cut-off events. For 344/370 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15713 event pairs, 72 based on Foata normal form. 1/1502 useless extension candidates. Maximal degree in co-relation 1606. Up to 317 conditions per place. [2022-11-02 19:54:05,185 INFO L137 encePairwiseOnDemand]: 198/203 looper letters, 28 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2022-11-02 19:54:05,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 208 transitions, 643 flow [2022-11-02 19:54:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-11-02 19:54:05,188 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.896551724137931 [2022-11-02 19:54:05,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2022-11-02 19:54:05,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2022-11-02 19:54:05,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:05,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2022-11-02 19:54:05,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,193 INFO L175 Difference]: Start difference. First operand has 188 places, 200 transitions, 544 flow. Second operand 3 states and 546 transitions. [2022-11-02 19:54:05,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 208 transitions, 643 flow [2022-11-02 19:54:05,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 208 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:05,200 INFO L231 Difference]: Finished difference. Result has 190 places, 204 transitions, 578 flow [2022-11-02 19:54:05,201 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=190, PETRI_TRANSITIONS=204} [2022-11-02 19:54:05,205 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2022-11-02 19:54:05,205 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 204 transitions, 578 flow [2022-11-02 19:54:05,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:05,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:05,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:54:05,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -694775757, now seen corresponding path program 1 times [2022-11-02 19:54:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:05,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887346543] [2022-11-02 19:54:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:05,300 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 19:54:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887346543] [2022-11-02 19:54:05,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887346543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:05,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:05,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752782985] [2022-11-02 19:54:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:05,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:05,304 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 203 [2022-11-02 19:54:05,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 204 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:05,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 203 [2022-11-02 19:54:05,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:05,705 INFO L130 PetriNetUnfolder]: 322/2041 cut-off events. [2022-11-02 19:54:05,705 INFO L131 PetriNetUnfolder]: For 140/143 co-relation queries the response was YES. [2022-11-02 19:54:05,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 2041 events. 322/2041 cut-off events. For 140/143 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18139 event pairs, 115 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 2285. Up to 382 conditions per place. [2022-11-02 19:54:05,726 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 21 selfloop transitions, 5 changer transitions 0/213 dead transitions. [2022-11-02 19:54:05,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 213 transitions, 650 flow [2022-11-02 19:54:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2022-11-02 19:54:05,729 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9113300492610837 [2022-11-02 19:54:05,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2022-11-02 19:54:05,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2022-11-02 19:54:05,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:05,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2022-11-02 19:54:05,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,735 INFO L175 Difference]: Start difference. First operand has 190 places, 204 transitions, 578 flow. Second operand 3 states and 555 transitions. [2022-11-02 19:54:05,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 213 transitions, 650 flow [2022-11-02 19:54:05,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 213 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:05,743 INFO L231 Difference]: Finished difference. Result has 192 places, 208 transitions, 604 flow [2022-11-02 19:54:05,744 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=192, PETRI_TRANSITIONS=208} [2022-11-02 19:54:05,747 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 8 predicate places. [2022-11-02 19:54:05,747 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 208 transitions, 604 flow [2022-11-02 19:54:05,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:05,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:05,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:54:05,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -269862313, now seen corresponding path program 1 times [2022-11-02 19:54:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:05,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149314967] [2022-11-02 19:54:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:06,315 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 19:54:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149314967] [2022-11-02 19:54:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149314967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:06,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:06,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:54:06,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539359978] [2022-11-02 19:54:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:06,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:54:06,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:54:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:54:06,322 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 203 [2022-11-02 19:54:06,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 208 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:06,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 203 [2022-11-02 19:54:06,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:06,669 INFO L130 PetriNetUnfolder]: 172/1605 cut-off events. [2022-11-02 19:54:06,670 INFO L131 PetriNetUnfolder]: For 112/224 co-relation queries the response was YES. [2022-11-02 19:54:06,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1605 events. 172/1605 cut-off events. For 112/224 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 13649 event pairs, 22 based on Foata normal form. 72/1401 useless extension candidates. Maximal degree in co-relation 2329. Up to 129 conditions per place. [2022-11-02 19:54:06,696 INFO L137 encePairwiseOnDemand]: 198/203 looper letters, 14 selfloop transitions, 4 changer transitions 0/207 dead transitions. [2022-11-02 19:54:06,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 207 transitions, 638 flow [2022-11-02 19:54:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:54:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 19:54:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1051 transitions. [2022-11-02 19:54:06,700 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8628899835796388 [2022-11-02 19:54:06,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1051 transitions. [2022-11-02 19:54:06,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1051 transitions. [2022-11-02 19:54:06,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:06,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1051 transitions. [2022-11-02 19:54:06,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.16666666666666) internal successors, (1051), 6 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,708 INFO L175 Difference]: Start difference. First operand has 192 places, 208 transitions, 604 flow. Second operand 6 states and 1051 transitions. [2022-11-02 19:54:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 207 transitions, 638 flow [2022-11-02 19:54:06,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 207 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:06,715 INFO L231 Difference]: Finished difference. Result has 194 places, 207 transitions, 600 flow [2022-11-02 19:54:06,716 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=194, PETRI_TRANSITIONS=207} [2022-11-02 19:54:06,717 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 10 predicate places. [2022-11-02 19:54:06,718 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 207 transitions, 600 flow [2022-11-02 19:54:06,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:06,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:06,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:54:06,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -63127802, now seen corresponding path program 1 times [2022-11-02 19:54:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:06,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540730498] [2022-11-02 19:54:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:06,765 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 19:54:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:06,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540730498] [2022-11-02 19:54:06,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540730498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:06,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:06,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834736983] [2022-11-02 19:54:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:06,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:06,774 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 203 [2022-11-02 19:54:06,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 207 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:06,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 203 [2022-11-02 19:54:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:07,304 INFO L130 PetriNetUnfolder]: 369/2985 cut-off events. [2022-11-02 19:54:07,304 INFO L131 PetriNetUnfolder]: For 190/203 co-relation queries the response was YES. [2022-11-02 19:54:07,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 2985 events. 369/2985 cut-off events. For 190/203 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 30008 event pairs, 56 based on Foata normal form. 2/2452 useless extension candidates. Maximal degree in co-relation 4231. Up to 231 conditions per place. [2022-11-02 19:54:07,332 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 23 selfloop transitions, 6 changer transitions 0/216 dead transitions. [2022-11-02 19:54:07,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 216 transitions, 683 flow [2022-11-02 19:54:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2022-11-02 19:54:07,334 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2022-11-02 19:54:07,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2022-11-02 19:54:07,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2022-11-02 19:54:07,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:07,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2022-11-02 19:54:07,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,339 INFO L175 Difference]: Start difference. First operand has 194 places, 207 transitions, 600 flow. Second operand 3 states and 553 transitions. [2022-11-02 19:54:07,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 216 transitions, 683 flow [2022-11-02 19:54:07,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 216 transitions, 676 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 19:54:07,345 INFO L231 Difference]: Finished difference. Result has 194 places, 212 transitions, 643 flow [2022-11-02 19:54:07,346 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=194, PETRI_TRANSITIONS=212} [2022-11-02 19:54:07,346 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 10 predicate places. [2022-11-02 19:54:07,347 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 212 transitions, 643 flow [2022-11-02 19:54:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:07,347 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 19:54:07,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:54:07,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash -616601324, now seen corresponding path program 1 times [2022-11-02 19:54:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964256004] [2022-11-02 19:54:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:07,383 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 19:54:07,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:54:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964256004] [2022-11-02 19:54:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964256004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:07,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:07,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914276189] [2022-11-02 19:54:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:54:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:07,387 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 203 [2022-11-02 19:54:07,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 212 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 19:54:07,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 203 [2022-11-02 19:54:07,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 19:54:07,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L709-->L709-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][145], [Black: 220#true, 205#true, 247#(= |#race~flag1~0| 0), thr2Thread1of1ForFork1InUse, 145#L725-4true, Black: 228#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 151#L709-1true, 43#L702-2true, Black: 199#true, Black: 234#(= |thr1Thread1of1ForFork0_#t~nondet6| |#race~x~0|), 253#(= |#race~x~0| 0), Black: 207#(= ~turn~0 0), Black: 245#true, Black: 216#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|)]) [2022-11-02 19:54:07,639 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 19:54:07,639 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,639 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,639 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L702-1-->L702-2: Formula: (= |v_thr1Thread1of1ForFork0_#t~nondet7_3| |v_#race~turn~0_10|) InVars {thr1Thread1of1ForFork0_#t~nondet7=|v_thr1Thread1of1ForFork0_#t~nondet7_3|} OutVars{#race~turn~0=|v_#race~turn~0_10|, thr1Thread1of1ForFork0_#t~nondet7=|v_thr1Thread1of1ForFork0_#t~nondet7_3|} AuxVars[] AssignedVars[#race~turn~0][109], [Black: 220#true, 205#true, 247#(= |#race~flag1~0| 0), thr2Thread1of1ForFork1InUse, 145#L725-4true, Black: 228#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), 151#L709-1true, Black: 201#(= |#race~turn~0| 0), 43#L702-2true, Black: 234#(= |thr1Thread1of1ForFork0_#t~nondet6| |#race~x~0|), 253#(= |#race~x~0| 0), Black: 207#(= ~turn~0 0), Black: 245#true, Black: 216#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|)]) [2022-11-02 19:54:07,656 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 19:54:07,656 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,656 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,657 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L702-1-->L702-2: Formula: (= |v_thr1Thread1of1ForFork0_#t~nondet7_3| |v_#race~turn~0_10|) InVars {thr1Thread1of1ForFork0_#t~nondet7=|v_thr1Thread1of1ForFork0_#t~nondet7_3|} OutVars{#race~turn~0=|v_#race~turn~0_10|, thr1Thread1of1ForFork0_#t~nondet7=|v_thr1Thread1of1ForFork0_#t~nondet7_3|} AuxVars[] AssignedVars[#race~turn~0][109], [130#L709-2true, Black: 220#true, 205#true, 247#(= |#race~flag1~0| 0), thr2Thread1of1ForFork1InUse, 145#L725-4true, Black: 228#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), Black: 201#(= |#race~turn~0| 0), 43#L702-2true, Black: 234#(= |thr1Thread1of1ForFork0_#t~nondet6| |#race~x~0|), 253#(= |#race~x~0| 0), Black: 207#(= ~turn~0 0), Black: 245#true, Black: 216#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|)]) [2022-11-02 19:54:07,673 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 19:54:07,673 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 19:54:07,673 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 19:54:07,673 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 19:54:07,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([489] L709-2-->L709-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][148], [Black: 220#true, 205#true, 247#(= |#race~flag1~0| 0), thr2Thread1of1ForFork1InUse, 145#L725-4true, Black: 228#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), Black: 199#true, Black: 234#(= |thr1Thread1of1ForFork0_#t~nondet6| |#race~x~0|), 253#(= |#race~x~0| 0), Black: 207#(= ~turn~0 0), 28#L702true, 31#L709-4true, Black: 245#true, Black: 216#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|)]) [2022-11-02 19:54:07,674 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 19:54:07,674 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,674 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,674 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 19:54:07,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([585] L703-2-->L703-3: Formula: (= |v_thr1Thread1of1ForFork0_#t~nondet8_3| |v_#race~flag1~0_7|) InVars {thr1Thread1of1ForFork0_#t~nondet8=|v_thr1Thread1of1ForFork0_#t~nondet8_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet8=|v_thr1Thread1of1ForFork0_#t~nondet8_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][154], [Black: 220#true, 205#true, thr2Thread1of1ForFork1InUse, 145#L725-4true, Black: 228#(= |thr2Thread1of1ForFork1_#t~nondet9| |#race~flag2~0|), Black: 201#(= |#race~turn~0| 0), Black: 234#(= |thr1Thread1of1ForFork0_#t~nondet6| |#race~x~0|), 167#L708-2true, 253#(= |#race~x~0| 0), 124#L703-3true, Black: 207#(= ~turn~0 0), Black: 247#(= |#race~flag1~0| 0), Black: 216#(= |thr1Thread1of1ForFork0_#t~nondet3| |#race~flag1~0|), 245#true]) [2022-11-02 19:54:07,676 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 19:54:07,676 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 19:54:07,676 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 19:54:07,676 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 19:54:07,994 INFO L130 PetriNetUnfolder]: 463/3316 cut-off events. [2022-11-02 19:54:07,994 INFO L131 PetriNetUnfolder]: For 443/481 co-relation queries the response was YES. [2022-11-02 19:54:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 3316 events. 463/3316 cut-off events. For 443/481 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 34262 event pairs, 90 based on Foata normal form. 1/2758 useless extension candidates. Maximal degree in co-relation 4229. Up to 293 conditions per place. [2022-11-02 19:54:08,031 INFO L137 encePairwiseOnDemand]: 195/203 looper letters, 24 selfloop transitions, 7 changer transitions 0/225 dead transitions. [2022-11-02 19:54:08,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 225 transitions, 746 flow [2022-11-02 19:54:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 19:54:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2022-11-02 19:54:08,033 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9244663382594417 [2022-11-02 19:54:08,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2022-11-02 19:54:08,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2022-11-02 19:54:08,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 19:54:08,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2022-11-02 19:54:08,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,038 INFO L175 Difference]: Start difference. First operand has 194 places, 212 transitions, 643 flow. Second operand 3 states and 563 transitions. [2022-11-02 19:54:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 225 transitions, 746 flow [2022-11-02 19:54:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 225 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 19:54:08,045 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 693 flow [2022-11-02 19:54:08,046 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2022-11-02 19:54:08,047 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2022-11-02 19:54:08,047 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 693 flow [2022-11-02 19:54:08,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 19:54:08,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:08,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:54:08,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2022-11-02 19:54:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1511061770, now seen corresponding path program 1 times [2022-11-02 19:54:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:54:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036363234] [2022-11-02 19:54:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:54:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:08,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:54:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:08,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 19:54:08,120 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:54:08,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-02 19:54:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-02 19:54:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-02 19:54:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-02 19:54:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-02 19:54:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-02 19:54:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-02 19:54:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-02 19:54:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-02 19:54:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-02 19:54:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-02 19:54:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-02 19:54:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-02 19:54:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-02 19:54:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-02 19:54:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-02 19:54:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2022-11-02 19:54:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2022-11-02 19:54:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-02 19:54:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-02 19:54:08,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-02 19:54:08,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-02 19:54:08,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-02 19:54:08,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-02 19:54:08,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-02 19:54:08,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 46 remaining) [2022-11-02 19:54:08,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2022-11-02 19:54:08,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-02 19:54:08,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-02 19:54:08,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-02 19:54:08,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-02 19:54:08,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-02 19:54:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-02 19:54:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-02 19:54:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-02 19:54:08,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-02 19:54:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-02 19:54:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-02 19:54:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-02 19:54:08,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-02 19:54:08,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-02 19:54:08,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-02 19:54:08,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-02 19:54:08,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-02 19:54:08,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-02 19:54:08,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-02 19:54:08,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:54:08,142 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:08,149 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 19:54:08,149 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:54:08,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:54:08 BasicIcfg [2022-11-02 19:54:08,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:54:08,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:54:08,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:54:08,208 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:54:08,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:01" (3/4) ... [2022-11-02 19:54:08,211 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 19:54:08,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:54:08,212 INFO L158 Benchmark]: Toolchain (without parser) took 7839.82ms. Allocated memory was 115.3MB in the beginning and 197.1MB in the end (delta: 81.8MB). Free memory was 73.3MB in the beginning and 56.6MB in the end (delta: 16.7MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,213 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 115.3MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:54:08,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.31ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 81.3MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.09ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,214 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 115.3MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,217 INFO L158 Benchmark]: RCFGBuilder took 668.65ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 59.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,217 INFO L158 Benchmark]: TraceAbstraction took 6289.53ms. Allocated memory was 115.3MB in the beginning and 197.1MB in the end (delta: 81.8MB). Free memory was 58.8MB in the beginning and 56.6MB in the end (delta: 2.2MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:08,218 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 197.1MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:54:08,219 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.35ms. Allocated memory is still 115.3MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.31ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 81.3MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.09ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 115.3MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.65ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 59.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6289.53ms. Allocated memory was 115.3MB in the beginning and 197.1MB in the end (delta: 81.8MB). Free memory was 58.8MB in the beginning and 56.6MB in the end (delta: 2.2MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 197.1MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L689] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L690] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L722] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [0<=turn && turn<=1=1, flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 turn<=1 VAL [0<=turn && turn<=1=1, flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [0<=turn && turn<=1=1, flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L723] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L724] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=-1, t1={5:0}, t2={3:0}, turn=0, x=0] [L692] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L725] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L707] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, flag2 = 1=49, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, flag2 = 1=49, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [707] and C: flag2 >= 1 [693] - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 308 locations, 46 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: 6.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 127 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=9, InterpolantAutomatonStates: 31, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 382 ConstructedInterpolants, 0 QuantifiedInterpolants, 497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 19:54:08,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d7656a8-57e9-4763-adc2-44095568e6a6/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE