./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b 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_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN --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 c4525591fa85ffc9750f318a48c09fdd29dc0d26cd65c6303a681f57303fc1a4 --- 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-6b4ec56 [2022-11-20 12:49:32,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:49:32,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:49:32,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:49:32,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:49:32,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:49:32,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:49:32,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:49:32,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:49:32,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:49:32,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:49:32,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:49:32,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:49:32,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:49:32,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:49:32,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:49:32,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:49:32,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:49:32,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:49:32,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:49:32,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:49:32,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:49:32,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:49:32,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:49:32,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:49:32,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:49:32,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:49:32,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:49:32,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:49:32,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:49:32,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:49:32,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:49:32,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:49:32,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:49:32,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:49:32,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:49:32,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:49:32,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:49:32,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:49:32,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:49:32,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:49:32,876 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 12:49:32,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:49:32,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:49:32,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:49:32,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:49:32,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:49:32,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:49:32,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:49:32,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:49:32,916 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:49:32,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:49:32,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:49:32,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:49:32,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:49:32,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:49:32,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:49:32,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:49:32,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:49:32,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:49:32,919 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 12:49:32,919 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:49:32,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:49:32,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:49:32,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:49:32,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:49:32,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:49:32,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:49:32,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:49:32,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:49:32,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:49:32,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:49:32,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:49:32,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:49:32,922 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:49:32,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:49:32,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:49:32,923 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_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/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_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN 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 -> c4525591fa85ffc9750f318a48c09fdd29dc0d26cd65c6303a681f57303fc1a4 [2022-11-20 12:49:33,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:49:33,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:49:33,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:49:33,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:49:33,261 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:49:33,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread/fib_unsafe-12-racy.i [2022-11-20 12:49:36,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:49:36,653 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:49:36,653 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i [2022-11-20 12:49:36,665 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/data/67c5a502d/a69530762e474568ac45905afe45305c/FLAGe8023dc76 [2022-11-20 12:49:36,680 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/data/67c5a502d/a69530762e474568ac45905afe45305c [2022-11-20 12:49:36,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:49:36,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:49:36,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:49:36,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:49:36,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:49:36,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:36" (1/1) ... [2022-11-20 12:49:36,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e42e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:36, skipping insertion in model container [2022-11-20 12:49:36,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:36" (1/1) ... [2022-11-20 12:49:36,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:49:36,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:49:37,227 WARN L237 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_08d680e4-43f7-439e-846c-904f5c153f0b/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i[30813,30826] [2022-11-20 12:49:37,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:49:37,251 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:49:37,289 WARN L237 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_08d680e4-43f7-439e-846c-904f5c153f0b/sv-benchmarks/c/pthread/fib_unsafe-12-racy.i[30813,30826] [2022-11-20 12:49:37,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:49:37,317 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:49:37,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37 WrapperNode [2022-11-20 12:49:37,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:49:37,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:49:37,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:49:37,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:49:37,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,371 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-20 12:49:37,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:49:37,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:49:37,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:49:37,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:49:37,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:49:37,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:49:37,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:49:37,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:49:37,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (1/1) ... [2022-11-20 12:49:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:49:37,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:37,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:49:37,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:49:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 12:49:37,532 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 12:49:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 12:49:37,532 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 12:49:37,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:49:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:49:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:49:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:49:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:49:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:49:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:49:37,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:49:37,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:49:37,535 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:49:37,740 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:49:37,742 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:49:38,012 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:49:38,070 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:49:38,070 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 12:49:38,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:38 BoogieIcfgContainer [2022-11-20 12:49:38,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:49:38,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:49:38,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:49:38,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:49:38,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:49:36" (1/3) ... [2022-11-20 12:49:38,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4281edf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:38, skipping insertion in model container [2022-11-20 12:49:38,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:37" (2/3) ... [2022-11-20 12:49:38,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4281edf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:38, skipping insertion in model container [2022-11-20 12:49:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:38" (3/3) ... [2022-11-20 12:49:38,082 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12-racy.i [2022-11-20 12:49:38,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:49:38,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:49:38,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-20 12:49:38,108 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:49:38,263 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:49:38,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-20 12:49:38,401 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-20 12:49:38,401 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:38,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 366 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-11-20 12:49:38,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 396 flow [2022-11-20 12:49:38,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 388 flow [2022-11-20 12:49:38,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:49:38,434 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;@47433886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:49:38,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-20 12:49:38,443 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-20 12:49:38,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:38,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:38,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:38,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377174, now seen corresponding path program 1 times [2022-11-20 12:49:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:38,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391571545] [2022-11-20 12:49:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:38,660 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-20 12:49:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:38,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391571545] [2022-11-20 12:49:38,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391571545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:38,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:38,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:49:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161070716] [2022-11-20 12:49:38,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:49:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:49:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:49:38,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 193 [2022-11-20 12:49:38,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 191 transitions, 388 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:38,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:38,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 193 [2022-11-20 12:49:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:38,865 INFO L130 PetriNetUnfolder]: 9/295 cut-off events. [2022-11-20 12:49:38,873 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:49:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 295 events. 9/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 939 event pairs, 2 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 274. Up to 11 conditions per place. [2022-11-20 12:49:38,879 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2022-11-20 12:49:38,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 374 flow [2022-11-20 12:49:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:49:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 12:49:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-11-20 12:49:38,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9481865284974094 [2022-11-20 12:49:38,903 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-11-20 12:49:38,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-11-20 12:49:38,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:38,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-11-20 12:49:38,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:38,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:38,926 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:38,928 INFO L175 Difference]: Start difference. First operand has 190 places, 191 transitions, 388 flow. Second operand 2 states and 366 transitions. [2022-11-20 12:49:38,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 374 flow [2022-11-20 12:49:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:38,941 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 360 flow [2022-11-20 12:49:38,943 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2022-11-20 12:49:38,949 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -10 predicate places. [2022-11-20 12:49:38,950 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 360 flow [2022-11-20 12:49:38,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:38,951 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:38,951 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:38,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:49:38,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash -929261081, now seen corresponding path program 1 times [2022-11-20 12:49:38,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503320934] [2022-11-20 12:49:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,141 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-20 12:49:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:39,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503320934] [2022-11-20 12:49:39,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503320934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:39,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078719062] [2022-11-20 12:49:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:39,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:39,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-20 12:49:39,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:39,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-20 12:49:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:39,285 INFO L130 PetriNetUnfolder]: 48/393 cut-off events. [2022-11-20 12:49:39,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:39,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 393 events. 48/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1813 event pairs, 14 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 511. Up to 77 conditions per place. [2022-11-20 12:49:39,297 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-11-20 12:49:39,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 406 flow [2022-11-20 12:49:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-20 12:49:39,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2022-11-20 12:49:39,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-20 12:49:39,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-20 12:49:39,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:39,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-20 12:49:39,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,309 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 360 flow. Second operand 3 states and 502 transitions. [2022-11-20 12:49:39,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 406 flow [2022-11-20 12:49:39,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 179 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:49:39,314 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 362 flow [2022-11-20 12:49:39,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2022-11-20 12:49:39,316 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -9 predicate places. [2022-11-20 12:49:39,316 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 362 flow [2022-11-20 12:49:39,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:39,317 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:49:39,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837375, now seen corresponding path program 1 times [2022-11-20 12:49:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:39,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460521195] [2022-11-20 12:49:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,402 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-20 12:49:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:39,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460521195] [2022-11-20 12:49:39,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460521195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:39,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675998009] [2022-11-20 12:49:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:39,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-20 12:49:39,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:39,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-20 12:49:39,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:39,480 INFO L130 PetriNetUnfolder]: 34/261 cut-off events. [2022-11-20 12:49:39,480 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:49:39,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 261 events. 34/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 975 event pairs, 11 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 354. Up to 34 conditions per place. [2022-11-20 12:49:39,485 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2022-11-20 12:49:39,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 398 flow [2022-11-20 12:49:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-20 12:49:39,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-20 12:49:39,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-20 12:49:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-20 12:49:39,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:39,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-20 12:49:39,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,497 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 362 flow. Second operand 3 states and 505 transitions. [2022-11-20 12:49:39,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 398 flow [2022-11-20 12:49:39,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 177 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:39,502 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 358 flow [2022-11-20 12:49:39,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-11-20 12:49:39,504 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-20 12:49:39,504 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 358 flow [2022-11-20 12:49:39,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:39,505 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:39,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:49:39,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -418600324, now seen corresponding path program 1 times [2022-11-20 12:49:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:39,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251049127] [2022-11-20 12:49:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,619 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-20 12:49:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251049127] [2022-11-20 12:49:39,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251049127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:39,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:39,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794962971] [2022-11-20 12:49:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:39,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-20 12:49:39,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:39,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-20 12:49:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:39,738 INFO L130 PetriNetUnfolder]: 22/303 cut-off events. [2022-11-20 12:49:39,738 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:39,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 303 events. 22/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1161 event pairs, 13 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2022-11-20 12:49:39,743 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-20 12:49:39,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 398 flow [2022-11-20 12:49:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-11-20 12:49:39,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8652849740932642 [2022-11-20 12:49:39,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-11-20 12:49:39,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-11-20 12:49:39,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:39,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-11-20 12:49:39,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,752 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 358 flow. Second operand 3 states and 501 transitions. [2022-11-20 12:49:39,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 398 flow [2022-11-20 12:49:39,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 175 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:39,756 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2022-11-20 12:49:39,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-11-20 12:49:39,759 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -12 predicate places. [2022-11-20 12:49:39,765 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2022-11-20 12:49:39,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:39,766 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:39,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:49:39,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2063316520, now seen corresponding path program 1 times [2022-11-20 12:49:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:39,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548320928] [2022-11-20 12:49:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,880 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-20 12:49:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:39,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548320928] [2022-11-20 12:49:39,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548320928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:39,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:39,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764373641] [2022-11-20 12:49:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:39,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-20 12:49:39,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:39,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-20 12:49:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:39,986 INFO L130 PetriNetUnfolder]: 18/295 cut-off events. [2022-11-20 12:49:39,986 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:49:39,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 295 events. 18/295 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1099 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 342. Up to 23 conditions per place. [2022-11-20 12:49:39,991 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-20 12:49:39,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 386 flow [2022-11-20 12:49:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-20 12:49:39,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-20 12:49:39,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-20 12:49:39,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-20 12:49:39,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:39,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-20 12:49:39,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:39,999 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 504 transitions. [2022-11-20 12:49:39,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 386 flow [2022-11-20 12:49:40,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,004 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2022-11-20 12:49:40,004 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2022-11-20 12:49:40,008 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -14 predicate places. [2022-11-20 12:49:40,008 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2022-11-20 12:49:40,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,009 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,009 INFO L209 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-20 12:49:40,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:49:40,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 940500773, now seen corresponding path program 1 times [2022-11-20 12:49:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393236312] [2022-11-20 12:49:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,121 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-20 12:49:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393236312] [2022-11-20 12:49:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393236312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708285623] [2022-11-20 12:49:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-20 12:49:40,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-20 12:49:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:40,243 INFO L130 PetriNetUnfolder]: 69/506 cut-off events. [2022-11-20 12:49:40,243 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:40,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 506 events. 69/506 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2804 event pairs, 50 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 638. Up to 107 conditions per place. [2022-11-20 12:49:40,250 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-20 12:49:40,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 398 flow [2022-11-20 12:49:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-20 12:49:40,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8635578583765112 [2022-11-20 12:49:40,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-20 12:49:40,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-20 12:49:40,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:40,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-20 12:49:40,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-20 12:49:40,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,257 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 500 transitions. [2022-11-20 12:49:40,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 398 flow [2022-11-20 12:49:40,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 173 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,261 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2022-11-20 12:49:40,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=171} [2022-11-20 12:49:40,264 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -15 predicate places. [2022-11-20 12:49:40,265 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2022-11-20 12:49:40,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,266 INFO L209 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-20 12:49:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:49:40,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 193157200, now seen corresponding path program 1 times [2022-11-20 12:49:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620123283] [2022-11-20 12:49:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,330 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-20 12:49:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620123283] [2022-11-20 12:49:40,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620123283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554358074] [2022-11-20 12:49:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,334 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-20 12:49:40,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-20 12:49:40,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:40,410 INFO L130 PetriNetUnfolder]: 26/228 cut-off events. [2022-11-20 12:49:40,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:40,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 228 events. 26/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 802 event pairs, 16 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 312. Up to 49 conditions per place. [2022-11-20 12:49:40,414 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-20 12:49:40,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 390 flow [2022-11-20 12:49:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-11-20 12:49:40,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2022-11-20 12:49:40,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-11-20 12:49:40,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-11-20 12:49:40,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:40,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-11-20 12:49:40,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,421 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 499 transitions. [2022-11-20 12:49:40,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 390 flow [2022-11-20 12:49:40,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,424 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2022-11-20 12:49:40,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2022-11-20 12:49:40,425 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -16 predicate places. [2022-11-20 12:49:40,426 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2022-11-20 12:49:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,426 INFO L209 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-20 12:49:40,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:49:40,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1907786638, now seen corresponding path program 1 times [2022-11-20 12:49:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656970174] [2022-11-20 12:49:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,470 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-20 12:49:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656970174] [2022-11-20 12:49:40,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656970174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097443866] [2022-11-20 12:49:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,478 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-20 12:49:40,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-20 12:49:40,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:40,583 INFO L130 PetriNetUnfolder]: 49/471 cut-off events. [2022-11-20 12:49:40,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:40,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 471 events. 49/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2379 event pairs, 22 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 561. Up to 51 conditions per place. [2022-11-20 12:49:40,589 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-11-20 12:49:40,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2022-11-20 12:49:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-20 12:49:40,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-20 12:49:40,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-20 12:49:40,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-20 12:49:40,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:40,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-20 12:49:40,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,595 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 505 transitions. [2022-11-20 12:49:40,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2022-11-20 12:49:40,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,599 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2022-11-20 12:49:40,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2022-11-20 12:49:40,602 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-20 12:49:40,602 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2022-11-20 12:49:40,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,603 INFO L209 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] [2022-11-20 12:49:40,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:49:40,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 430848325, now seen corresponding path program 1 times [2022-11-20 12:49:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441082805] [2022-11-20 12:49:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,655 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-20 12:49:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441082805] [2022-11-20 12:49:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441082805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396683343] [2022-11-20 12:49:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-20 12:49:40,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-20 12:49:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:40,743 INFO L130 PetriNetUnfolder]: 49/491 cut-off events. [2022-11-20 12:49:40,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:40,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 491 events. 49/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2325 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 581. Up to 41 conditions per place. [2022-11-20 12:49:40,749 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 3 changer transitions 0/168 dead transitions. [2022-11-20 12:49:40,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 374 flow [2022-11-20 12:49:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-20 12:49:40,751 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-20 12:49:40,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:40,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,755 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 512 transitions. [2022-11-20 12:49:40,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 374 flow [2022-11-20 12:49:40,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,759 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 342 flow [2022-11-20 12:49:40,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-11-20 12:49:40,760 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-20 12:49:40,760 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 342 flow [2022-11-20 12:49:40,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,761 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:40,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:49:40,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1728395284, now seen corresponding path program 1 times [2022-11-20 12:49:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360587571] [2022-11-20 12:49:40,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,833 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-20 12:49:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360587571] [2022-11-20 12:49:40,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360587571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504093777] [2022-11-20 12:49:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-20 12:49:40,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-20 12:49:40,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:40,917 INFO L130 PetriNetUnfolder]: 47/481 cut-off events. [2022-11-20 12:49:40,917 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:40,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 481 events. 47/481 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1916 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 573. Up to 41 conditions per place. [2022-11-20 12:49:40,922 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-11-20 12:49:40,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 372 flow [2022-11-20 12:49:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-20 12:49:40,925 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-20 12:49:40,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:40,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-20 12:49:40,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,929 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 342 flow. Second operand 3 states and 512 transitions. [2022-11-20 12:49:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 372 flow [2022-11-20 12:49:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:40,932 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2022-11-20 12:49:40,933 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-20 12:49:40,933 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-20 12:49:40,933 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2022-11-20 12:49:40,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,934 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:40,934 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:40,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:49:40,935 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash -215926811, now seen corresponding path program 1 times [2022-11-20 12:49:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:40,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304428374] [2022-11-20 12:49:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,969 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-20 12:49:40,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:40,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304428374] [2022-11-20 12:49:40,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304428374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:40,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:40,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:40,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20108524] [2022-11-20 12:49:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:40,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-20 12:49:40,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:40,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:40,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-20 12:49:40,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,044 INFO L130 PetriNetUnfolder]: 18/278 cut-off events. [2022-11-20 12:49:41,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:41,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 278 events. 18/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 970 event pairs, 9 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 327. Up to 34 conditions per place. [2022-11-20 12:49:41,048 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-20 12:49:41,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 370 flow [2022-11-20 12:49:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-20 12:49:41,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8601036269430051 [2022-11-20 12:49:41,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-20 12:49:41,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-20 12:49:41,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-20 12:49:41,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,054 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 498 transitions. [2022-11-20 12:49:41,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 370 flow [2022-11-20 12:49:41,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:41,057 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 334 flow [2022-11-20 12:49:41,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-20 12:49:41,058 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-20 12:49:41,058 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 334 flow [2022-11-20 12:49:41,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,059 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:49:41,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1939820954, now seen corresponding path program 1 times [2022-11-20 12:49:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257320731] [2022-11-20 12:49:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257320731] [2022-11-20 12:49:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257320731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144065411] [2022-11-20 12:49:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-20 12:49:41,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-20 12:49:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,174 INFO L130 PetriNetUnfolder]: 45/451 cut-off events. [2022-11-20 12:49:41,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:41,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 451 events. 45/451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2261 event pairs, 26 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 535. Up to 59 conditions per place. [2022-11-20 12:49:41,179 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-20 12:49:41,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 368 flow [2022-11-20 12:49:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-20 12:49:41,181 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-20 12:49:41,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-20 12:49:41,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-20 12:49:41,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-20 12:49:41,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,185 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 334 flow. Second operand 3 states and 512 transitions. [2022-11-20 12:49:41,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 368 flow [2022-11-20 12:49:41,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:41,189 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2022-11-20 12:49:41,190 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2022-11-20 12:49:41,190 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-20 12:49:41,190 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2022-11-20 12:49:41,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:49:41,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1602304185, now seen corresponding path program 1 times [2022-11-20 12:49:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589059721] [2022-11-20 12:49:41,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,247 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-20 12:49:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589059721] [2022-11-20 12:49:41,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589059721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:49:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397768578] [2022-11-20 12:49:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-20 12:49:41,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-20 12:49:41,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,352 INFO L130 PetriNetUnfolder]: 41/577 cut-off events. [2022-11-20 12:49:41,352 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:41,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 577 events. 41/577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2593 event pairs, 14 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 670. Up to 37 conditions per place. [2022-11-20 12:49:41,358 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2022-11-20 12:49:41,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 167 transitions, 376 flow [2022-11-20 12:49:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-11-20 12:49:41,361 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9015544041450777 [2022-11-20 12:49:41,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-11-20 12:49:41,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-11-20 12:49:41,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-11-20 12:49:41,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,365 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 522 transitions. [2022-11-20 12:49:41,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 167 transitions, 376 flow [2022-11-20 12:49:41,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:41,369 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 340 flow [2022-11-20 12:49:41,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-20 12:49:41,371 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-20 12:49:41,371 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 340 flow [2022-11-20 12:49:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:49:41,372 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -596713196, now seen corresponding path program 1 times [2022-11-20 12:49:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550020411] [2022-11-20 12:49:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,447 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-20 12:49:41,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550020411] [2022-11-20 12:49:41,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550020411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:41,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709259684] [2022-11-20 12:49:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-20 12:49:41,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-20 12:49:41,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,556 INFO L130 PetriNetUnfolder]: 73/603 cut-off events. [2022-11-20 12:49:41,556 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 12:49:41,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 603 events. 73/603 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2986 event pairs, 46 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 756. Up to 99 conditions per place. [2022-11-20 12:49:41,562 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-20 12:49:41,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-20 12:49:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-20 12:49:41,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-20 12:49:41,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,588 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 340 flow. Second operand 3 states and 504 transitions. [2022-11-20 12:49:41,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-20 12:49:41,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:49:41,592 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2022-11-20 12:49:41,592 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-20 12:49:41,592 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-20 12:49:41,593 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2022-11-20 12:49:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,593 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,593 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:49:41,594 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 187265853, now seen corresponding path program 1 times [2022-11-20 12:49:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673118431] [2022-11-20 12:49:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,628 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-20 12:49:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673118431] [2022-11-20 12:49:41,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673118431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519041602] [2022-11-20 12:49:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-20 12:49:41,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-20 12:49:41,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,723 INFO L130 PetriNetUnfolder]: 61/583 cut-off events. [2022-11-20 12:49:41,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 583 events. 61/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2565 event pairs, 18 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 708. Up to 51 conditions per place. [2022-11-20 12:49:41,729 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-20 12:49:41,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2022-11-20 12:49:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-20 12:49:41,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946459412780656 [2022-11-20 12:49:41,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-20 12:49:41,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-20 12:49:41,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-20 12:49:41,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,735 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 518 transitions. [2022-11-20 12:49:41,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2022-11-20 12:49:41,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:41,738 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 344 flow [2022-11-20 12:49:41,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-20 12:49:41,739 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-20 12:49:41,739 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 344 flow [2022-11-20 12:49:41,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:49:41,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1490312150, now seen corresponding path program 1 times [2022-11-20 12:49:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470302883] [2022-11-20 12:49:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,776 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-20 12:49:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470302883] [2022-11-20 12:49:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470302883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298787113] [2022-11-20 12:49:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,779 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-20 12:49:41,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-20 12:49:41,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:41,892 INFO L130 PetriNetUnfolder]: 81/595 cut-off events. [2022-11-20 12:49:41,892 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 12:49:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 595 events. 81/595 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2997 event pairs, 54 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 780. Up to 115 conditions per place. [2022-11-20 12:49:41,898 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-11-20 12:49:41,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 380 flow [2022-11-20 12:49:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-20 12:49:41,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-20 12:49:41,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:41,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-20 12:49:41,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,906 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 344 flow. Second operand 3 states and 504 transitions. [2022-11-20 12:49:41,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 380 flow [2022-11-20 12:49:41,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 163 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:49:41,910 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 344 flow [2022-11-20 12:49:41,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2022-11-20 12:49:41,912 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-20 12:49:41,913 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 344 flow [2022-11-20 12:49:41,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,913 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:41,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:41,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:49:41,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -91697017, now seen corresponding path program 1 times [2022-11-20 12:49:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681749752] [2022-11-20 12:49:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:41,974 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-20 12:49:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:41,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681749752] [2022-11-20 12:49:41,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681749752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:41,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:41,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:49:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073463901] [2022-11-20 12:49:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:41,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:41,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-20 12:49:41,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:41,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:41,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-20 12:49:41,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:42,102 INFO L130 PetriNetUnfolder]: 73/583 cut-off events. [2022-11-20 12:49:42,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 583 events. 73/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2779 event pairs, 54 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 764. Up to 115 conditions per place. [2022-11-20 12:49:42,108 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2022-11-20 12:49:42,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 384 flow [2022-11-20 12:49:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-20 12:49:42,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2022-11-20 12:49:42,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-20 12:49:42,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-20 12:49:42,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:42,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-20 12:49:42,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,116 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 344 flow. Second operand 3 states and 497 transitions. [2022-11-20 12:49:42,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 384 flow [2022-11-20 12:49:42,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:42,121 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 342 flow [2022-11-20 12:49:42,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-11-20 12:49:42,123 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-20 12:49:42,124 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 342 flow [2022-11-20 12:49:42,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,124 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:42,125 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:42,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:49:42,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1186677298, now seen corresponding path program 1 times [2022-11-20 12:49:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:42,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767773195] [2022-11-20 12:49:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:42,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:42,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767773195] [2022-11-20 12:49:42,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767773195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:42,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702458088] [2022-11-20 12:49:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:42,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:42,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:42,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:49:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:42,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:49:42,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:49:42,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:49:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702458088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:42,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:49:42,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-20 12:49:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016756491] [2022-11-20 12:49:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:42,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:49:42,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-20 12:49:42,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:42,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-20 12:49:42,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:42,592 INFO L130 PetriNetUnfolder]: 36/496 cut-off events. [2022-11-20 12:49:42,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:49:42,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 496 events. 36/496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1865 event pairs, 1 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 574. Up to 31 conditions per place. [2022-11-20 12:49:42,598 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-11-20 12:49:42,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-20 12:49:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-20 12:49:42,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9101899827288429 [2022-11-20 12:49:42,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-20 12:49:42,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-20 12:49:42,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:42,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-20 12:49:42,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,604 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 342 flow. Second operand 3 states and 527 transitions. [2022-11-20 12:49:42,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-20 12:49:42,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:42,609 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 372 flow [2022-11-20 12:49:42,609 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-20 12:49:42,610 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-20 12:49:42,610 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 372 flow [2022-11-20 12:49:42,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:42,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:42,611 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:42,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:49:42,817 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -359410964, now seen corresponding path program 1 times [2022-11-20 12:49:42,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:42,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378286481] [2022-11-20 12:49:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:42,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378286481] [2022-11-20 12:49:42,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378286481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:42,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241508341] [2022-11-20 12:49:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:42,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:42,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:42,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:49:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:43,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:49:43,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:49:43,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:49:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241508341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:49:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-20 12:49:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956082577] [2022-11-20 12:49:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:43,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:49:43,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-20 12:49:43,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:43,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:43,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-20 12:49:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:43,221 INFO L130 PetriNetUnfolder]: 78/616 cut-off events. [2022-11-20 12:49:43,222 INFO L131 PetriNetUnfolder]: For 138/151 co-relation queries the response was YES. [2022-11-20 12:49:43,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 616 events. 78/616 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2825 event pairs, 0 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 880. Up to 59 conditions per place. [2022-11-20 12:49:43,229 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-20 12:49:43,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 436 flow [2022-11-20 12:49:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:49:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-11-20 12:49:43,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9119170984455959 [2022-11-20 12:49:43,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-11-20 12:49:43,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-11-20 12:49:43,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:43,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-11-20 12:49:43,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-20 12:49:43,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:43,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:43,235 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 372 flow. Second operand 3 states and 528 transitions. [2022-11-20 12:49:43,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 436 flow [2022-11-20 12:49:43,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:43,241 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 422 flow [2022-11-20 12:49:43,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2022-11-20 12:49:43,242 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-20 12:49:43,242 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 422 flow [2022-11-20 12:49:43,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:43,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:43,243 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:43,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:43,454 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -598637021, now seen corresponding path program 1 times [2022-11-20 12:49:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255568917] [2022-11-20 12:49:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255568917] [2022-11-20 12:49:43,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255568917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642140298] [2022-11-20 12:49:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:43,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:43,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:49:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:49:43,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:43,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642140298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:49:43,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:49:43,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:49:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823506664] [2022-11-20 12:49:43,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:49:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:49:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:49:43,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-20 12:49:43,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:43,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:43,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-20 12:49:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:44,266 INFO L130 PetriNetUnfolder]: 232/1316 cut-off events. [2022-11-20 12:49:44,266 INFO L131 PetriNetUnfolder]: For 997/1025 co-relation queries the response was YES. [2022-11-20 12:49:44,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1316 events. 232/1316 cut-off events. For 997/1025 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6533 event pairs, 13 based on Foata normal form. 16/1275 useless extension candidates. Maximal degree in co-relation 2312. Up to 133 conditions per place. [2022-11-20 12:49:44,285 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 62 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-20 12:49:44,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 220 transitions, 876 flow [2022-11-20 12:49:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:49:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:49:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2022-11-20 12:49:44,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2022-11-20 12:49:44,289 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2022-11-20 12:49:44,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2022-11-20 12:49:44,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:44,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2022-11-20 12:49:44,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.33333333333334) internal successors, (1533), 9 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:44,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:44,314 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:44,314 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 422 flow. Second operand 9 states and 1533 transitions. [2022-11-20 12:49:44,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 220 transitions, 876 flow [2022-11-20 12:49:44,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 220 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:49:44,320 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 460 flow [2022-11-20 12:49:44,321 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2022-11-20 12:49:44,321 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-20 12:49:44,322 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 460 flow [2022-11-20 12:49:44,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:44,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:44,324 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:44,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 12:49:44,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:44,529 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 327415809, now seen corresponding path program 2 times [2022-11-20 12:49:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:44,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146179596] [2022-11-20 12:49:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:44,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146179596] [2022-11-20 12:49:44,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146179596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:44,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284921554] [2022-11-20 12:49:44,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:49:44,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:44,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:44,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:49:44,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:49:44,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:49:44,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:49:44,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:45,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284921554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:49:45,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:49:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:49:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227657536] [2022-11-20 12:49:45,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:45,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:49:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:49:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:49:45,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-20 12:49:45,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 460 flow. Second operand has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:45,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:45,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-20 12:49:45,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:46,070 INFO L130 PetriNetUnfolder]: 392/2176 cut-off events. [2022-11-20 12:49:46,071 INFO L131 PetriNetUnfolder]: For 1508/1536 co-relation queries the response was YES. [2022-11-20 12:49:46,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 2176 events. 392/2176 cut-off events. For 1508/1536 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10625 event pairs, 13 based on Foata normal form. 26/2143 useless extension candidates. Maximal degree in co-relation 3882. Up to 213 conditions per place. [2022-11-20 12:49:46,098 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 138 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2022-11-20 12:49:46,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1558 flow [2022-11-20 12:49:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:49:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:49:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3567 transitions. [2022-11-20 12:49:46,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8800888230940045 [2022-11-20 12:49:46,106 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3567 transitions. [2022-11-20 12:49:46,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3567 transitions. [2022-11-20 12:49:46,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:46,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3567 transitions. [2022-11-20 12:49:46,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 169.85714285714286) internal successors, (3567), 21 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:46,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:46,124 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:46,124 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 460 flow. Second operand 21 states and 3567 transitions. [2022-11-20 12:49:46,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 308 transitions, 1558 flow [2022-11-20 12:49:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 308 transitions, 1544 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-20 12:49:46,132 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 584 flow [2022-11-20 12:49:46,132 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=584, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2022-11-20 12:49:46,133 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2022-11-20 12:49:46,133 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 584 flow [2022-11-20 12:49:46,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:46,134 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:46,135 INFO L209 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:46,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:46,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:46,340 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1096529341, now seen corresponding path program 3 times [2022-11-20 12:49:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:46,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903317654] [2022-11-20 12:49:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903317654] [2022-11-20 12:49:47,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903317654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:47,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530203614] [2022-11-20 12:49:47,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:49:47,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:47,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:47,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:47,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:49:47,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 12:49:47,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:49:47,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:49:47,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:48,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530203614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:49:48,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:49:48,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-20 12:49:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386027897] [2022-11-20 12:49:48,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:48,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 12:49:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 12:49:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 12:49:48,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-20 12:49:48,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 584 flow. Second operand has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:48,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:48,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-20 12:49:48,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:49:50,398 INFO L130 PetriNetUnfolder]: 712/3896 cut-off events. [2022-11-20 12:49:50,398 INFO L131 PetriNetUnfolder]: For 4546/4574 co-relation queries the response was YES. [2022-11-20 12:49:50,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 3896 events. 712/3896 cut-off events. For 4546/4574 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 18635 event pairs, 13 based on Foata normal form. 46/3883 useless extension candidates. Maximal degree in co-relation 7428. Up to 373 conditions per place. [2022-11-20 12:49:50,452 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 290 selfloop transitions, 45 changer transitions 0/484 dead transitions. [2022-11-20 12:49:50,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 484 transitions, 3090 flow [2022-11-20 12:49:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 12:49:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-20 12:49:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7635 transitions. [2022-11-20 12:49:50,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2022-11-20 12:49:50,469 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7635 transitions. [2022-11-20 12:49:50,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7635 transitions. [2022-11-20 12:49:50,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:49:50,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7635 transitions. [2022-11-20 12:49:50,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 169.66666666666666) internal successors, (7635), 45 states have internal predecessors, (7635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:50,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:50,514 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:50,515 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 584 flow. Second operand 45 states and 7635 transitions. [2022-11-20 12:49:50,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 484 transitions, 3090 flow [2022-11-20 12:49:50,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 484 transitions, 3050 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-20 12:49:50,531 INFO L231 Difference]: Finished difference. Result has 250 places, 214 transitions, 862 flow [2022-11-20 12:49:50,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=862, PETRI_PLACES=250, PETRI_TRANSITIONS=214} [2022-11-20 12:49:50,532 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 60 predicate places. [2022-11-20 12:49:50,532 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 214 transitions, 862 flow [2022-11-20 12:49:50,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 168.08823529411765) internal successors, (5715), 34 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:50,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:49:50,535 INFO L209 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:49:50,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:50,740 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:49:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1622679613, now seen corresponding path program 4 times [2022-11-20 12:49:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725488268] [2022-11-20 12:49:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:52,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725488268] [2022-11-20 12:49:52,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725488268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:52,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153001167] [2022-11-20 12:49:52,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:49:52,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:52,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:52,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:52,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:49:53,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:49:53,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:49:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 12:49:53,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:53,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:55,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153001167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:49:55,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:49:55,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 55 [2022-11-20 12:49:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914992466] [2022-11-20 12:49:55,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:55,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-20 12:49:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:55,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-20 12:49:55,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2022-11-20 12:49:55,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-20 12:49:55,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 214 transitions, 862 flow. Second operand has 55 states, 55 states have (on average 168.0909090909091) internal successors, (9245), 55 states have internal predecessors, (9245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:49:55,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:49:55,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-20 12:49:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:50:00,464 INFO L130 PetriNetUnfolder]: 1152/6261 cut-off events. [2022-11-20 12:50:00,464 INFO L131 PetriNetUnfolder]: For 14195/14223 co-relation queries the response was YES. [2022-11-20 12:50:00,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12663 conditions, 6261 events. 1152/6261 cut-off events. For 14195/14223 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 29713 event pairs, 13 based on Foata normal form. 61/6263 useless extension candidates. Maximal degree in co-relation 12639. Up to 593 conditions per place. [2022-11-20 12:50:00,550 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 499 selfloop transitions, 78 changer transitions 0/726 dead transitions. [2022-11-20 12:50:00,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 726 transitions, 5330 flow [2022-11-20 12:50:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-20 12:50:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-11-20 12:50:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 13226 transitions. [2022-11-20 12:50:00,575 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.878570479606749 [2022-11-20 12:50:00,575 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 13226 transitions. [2022-11-20 12:50:00,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 13226 transitions. [2022-11-20 12:50:00,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:50:00,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 13226 transitions. [2022-11-20 12:50:00,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 169.56410256410257) internal successors, (13226), 78 states have internal predecessors, (13226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:00,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 193.0) internal successors, (15247), 79 states have internal predecessors, (15247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:00,644 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 193.0) internal successors, (15247), 79 states have internal predecessors, (15247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:00,644 INFO L175 Difference]: Start difference. First operand has 250 places, 214 transitions, 862 flow. Second operand 78 states and 13226 transitions. [2022-11-20 12:50:00,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 726 transitions, 5330 flow [2022-11-20 12:50:00,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 726 transitions, 5252 flow, removed 21 selfloop flow, removed 18 redundant places. [2022-11-20 12:50:00,676 INFO L231 Difference]: Finished difference. Result has 321 places, 248 transitions, 1316 flow [2022-11-20 12:50:00,676 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1316, PETRI_PLACES=321, PETRI_TRANSITIONS=248} [2022-11-20 12:50:00,677 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 131 predicate places. [2022-11-20 12:50:00,677 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 248 transitions, 1316 flow [2022-11-20 12:50:00,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 168.0909090909091) internal successors, (9245), 55 states have internal predecessors, (9245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:50:00,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:50:00,681 INFO L209 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:50:00,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:50:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:00,900 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-20 12:50:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 338261754, now seen corresponding path program 5 times [2022-11-20 12:50:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:50:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168888249] [2022-11-20 12:50:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:50:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:50:01,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:50:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:50:01,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:50:01,979 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:50:01,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-20 12:50:01,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-20 12:50:01,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-20 12:50:01,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-20 12:50:01,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-20 12:50:01,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-20 12:50:01,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-20 12:50:01,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-20 12:50:01,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-20 12:50:01,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-20 12:50:01,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-20 12:50:01,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-20 12:50:01,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-20 12:50:01,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-20 12:50:01,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-20 12:50:01,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-20 12:50:01,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-20 12:50:01,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-20 12:50:01,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-20 12:50:01,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-20 12:50:01,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-20 12:50:01,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-20 12:50:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-20 12:50:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-20 12:50:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-20 12:50:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-20 12:50:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-20 12:50:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-20 12:50:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-20 12:50:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-20 12:50:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-20 12:50:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-20 12:50:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-20 12:50:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-20 12:50:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-20 12:50:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-20 12:50:01,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:50:01,991 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:02,000 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:50:02,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:50:02,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:50:02 BasicIcfg [2022-11-20 12:50:02,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:50:02,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:50:02,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:50:02,463 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:50:02,463 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:38" (3/4) ... [2022-11-20 12:50:02,466 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:50:02,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:50:02,467 INFO L158 Benchmark]: Toolchain (without parser) took 25778.20ms. Allocated memory was 161.5MB in the beginning and 696.3MB in the end (delta: 534.8MB). Free memory was 119.5MB in the beginning and 318.0MB in the end (delta: -198.5MB). Peak memory consumption was 336.2MB. Max. memory is 16.1GB. [2022-11-20 12:50:02,467 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:50:02,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.72ms. Allocated memory is still 161.5MB. Free memory was 119.5MB in the beginning and 116.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:50:02,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:50:02,468 INFO L158 Benchmark]: Boogie Preprocessor took 64.41ms. Allocated memory is still 161.5MB. Free memory was 113.8MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:50:02,468 INFO L158 Benchmark]: RCFGBuilder took 635.57ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 90.3MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:50:02,468 INFO L158 Benchmark]: TraceAbstraction took 24386.43ms. Allocated memory was 161.5MB in the beginning and 696.3MB in the end (delta: 534.8MB). Free memory was 89.8MB in the beginning and 319.1MB in the end (delta: -229.3MB). Peak memory consumption was 412.9MB. Max. memory is 16.1GB. [2022-11-20 12:50:02,469 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 696.3MB. Free memory was 319.1MB in the beginning and 318.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:50:02,470 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.24ms. Allocated memory is still 115.3MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.72ms. Allocated memory is still 161.5MB. Free memory was 119.5MB in the beginning and 116.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.41ms. Allocated memory is still 161.5MB. Free memory was 113.8MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 635.57ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 90.3MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24386.43ms. Allocated memory was 161.5MB in the beginning and 696.3MB in the end (delta: 534.8MB). Free memory was 89.8MB in the beginning and 319.1MB in the end (delta: -229.3MB). Peak memory consumption was 412.9MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 696.3MB. Free memory was 319.1MB in the beginning and 318.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=196521, argc=196521, argv={196459:196478}, argv={196459:196478}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=196521, argc=196521, argv={196459:196478}, argv={196459:196478}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=196521, argc=196521, argv={196459:196478}, argv={196459:196478}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=196521, arg={0:0}, argc=196521, argv={196459:196478}, argv={196459:196478}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=196521, arg={0:0}, arg={0:0}, argc=196521, argv={196459:196478}, argv={196459:196478}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=46368, q=0, x=24] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=75025, q=0, x=25] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] 0 x < 26 VAL [arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] COND FALSE 0 !(x < 26) VAL [arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L711] 0 return prev; VAL [\result=121393, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=196521, arg={0:0}, arg={0:0}, arg={0:0}, argc=196521, argv={196459:196478}, argv={196459:196478}, correct=121393, cur=196418, fib()=121393, i=1, id1={5:0}, id2={3:0}, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i < correct VAL [\old(argc)=196521, arg={0:0}, arg={0:0}, arg={0:0}, argc=196521, argv={196459:196478}, argv={196459:196478}, correct=121393, cur=196418, i=1, id1={5:0}, id2={3:0}, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=2, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i < correct VAL [\old(argc)=196521, arg={0:0}, arg={0:0}, arg={0:0}, argc=196521, argv={196459:196478}, argv={196459:196478}, correct=121393, cur=196418, i=2, id1={5:0}, id2={3:0}, j=1, next=196418, p=0, prev=121393, q=0, x=26] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i < correct [725] - 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: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: 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: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - 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: 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: 725]: 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: 709]: 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: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: 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: 722]: 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: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: 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: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 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: 23.7s, OverallIterations: 24, TraceHistogramMax: 27, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1560 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1560 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 997 IncrementalHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 152 mSDtfsCounter, 997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2776 GetRequests, 2538 SyntacticMatches, 11 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=23, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 4672 NumberOfCodeBlocks, 4672 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4852 ConstructedInterpolants, 0 QuantifiedInterpolants, 10696 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2700 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 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 proved your program to be incorrect! [2022-11-20 12:50:03,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08d680e4-43f7-439e-846c-904f5c153f0b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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