./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/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_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- 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 10:32:24,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:32:24,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:32:24,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:32:24,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:32:24,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:32:24,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:32:24,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:32:24,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:32:24,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:32:24,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:32:24,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:32:24,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:32:24,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:32:24,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:32:24,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:32:24,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:32:24,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:32:24,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:32:24,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:32:24,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:32:24,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:32:24,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:32:24,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:32:24,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:32:24,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:32:24,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:32:24,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:32:24,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:32:24,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:32:24,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:32:24,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:32:24,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:32:24,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:32:24,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:32:24,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:32:24,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:32:24,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:32:24,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:32:24,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:32:24,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:32:24,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:32:24,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:32:24,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:32:24,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:32:24,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:32:24,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:32:24,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:32:24,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:32:24,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:32:24,172 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:32:24,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:32:24,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:32:24,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:32:24,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:32:24,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:32:24,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:32:24,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:32:24,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:32:24,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:32:24,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:32:24,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:32:24,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:32:24,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:32:24,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:32:24,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:32:24,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:24,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:32:24,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:32:24,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:32:24,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:32:24,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:32:24,176 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:32:24,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:32:24,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:32:24,177 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_644e7812-c99d-44fa-a5f1-695cd037b812/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_644e7812-c99d-44fa-a5f1-695cd037b812/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 ! call(reach_error())) ) 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-11-20 10:32:24,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:32:24,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:32:24,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:32:24,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:32:24,437 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:32:24,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 10:32:27,560 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:32:27,905 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:32:27,905 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 10:32:27,920 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/data/d5829c059/76d6ba2bb71d46b49e7f9267245e21a4/FLAGc6b83f394 [2022-11-20 10:32:27,943 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/data/d5829c059/76d6ba2bb71d46b49e7f9267245e21a4 [2022-11-20 10:32:27,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:32:27,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:32:27,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:27,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:32:27,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:32:27,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:27" (1/1) ... [2022-11-20 10:32:27,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6381f4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:27, skipping insertion in model container [2022-11-20 10:32:27,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:27" (1/1) ... [2022-11-20 10:32:27,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:32:28,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:32:28,195 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_644e7812-c99d-44fa-a5f1-695cd037b812/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-20 10:32:28,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:28,529 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:32:28,554 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_644e7812-c99d-44fa-a5f1-695cd037b812/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-20 10:32:28,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:28,650 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:32:28,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28 WrapperNode [2022-11-20 10:32:28,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:28,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:28,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:32:28,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:32:28,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,718 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-11-20 10:32:28,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:28,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:32:28,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:32:28,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:32:28,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:32:28,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:32:28,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:32:28,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:32:28,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (1/1) ... [2022-11-20 10:32:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:28,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:32:28,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:32:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:32:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:32:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:32:28,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:32:28,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:32:28,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:32:28,871 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 10:32:29,114 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:32:29,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:32:29,545 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:32:29,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:32:29,730 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:32:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:29 BoogieIcfgContainer [2022-11-20 10:32:29,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:32:29,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:32:29,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:32:29,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:32:29,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:32:27" (1/3) ... [2022-11-20 10:32:29,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14640ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:29, skipping insertion in model container [2022-11-20 10:32:29,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:28" (2/3) ... [2022-11-20 10:32:29,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14640ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:29, skipping insertion in model container [2022-11-20 10:32:29,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:29" (3/3) ... [2022-11-20 10:32:29,749 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 10:32:29,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:32:29,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:32:29,776 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:32:29,776 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:32:29,835 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:32:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-20 10:32:29,979 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-20 10:32:29,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:32:29,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 10:32:29,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-11-20 10:32:29,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-11-20 10:32:30,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:30,025 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;@81c1009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:30,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 10:32:30,042 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-11-20 10:32:30,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:32:30,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:30,043 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 10:32:30,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2026205843, now seen corresponding path program 1 times [2022-11-20 10:32:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129231048] [2022-11-20 10:32:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:30,779 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 10:32:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129231048] [2022-11-20 10:32:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129231048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:30,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:30,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:32:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107750379] [2022-11-20 10:32:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:30,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:32:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:32:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:32:30,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-11-20 10:32:30,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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 10:32:30,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:30,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-11-20 10:32:30,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:31,195 INFO L130 PetriNetUnfolder]: 58/486 cut-off events. [2022-11-20 10:32:31,195 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-20 10:32:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 486 events. 58/486 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2524 event pairs, 44 based on Foata normal form. 15/471 useless extension candidates. Maximal degree in co-relation 565. Up to 79 conditions per place. [2022-11-20 10:32:31,219 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-11-20 10:32:31,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-11-20 10:32:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:32:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:32:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-11-20 10:32:31,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-11-20 10:32:31,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-11-20 10:32:31,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-11-20 10:32:31,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:31,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-11-20 10:32:31,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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 10:32:31,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 10:32:31,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 10:32:31,259 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-11-20 10:32:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-11-20 10:32:31,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:32:31,272 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-11-20 10:32:31,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-11-20 10:32:31,282 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-11-20 10:32:31,282 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-11-20 10:32:31,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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 10:32:31,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:31,284 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] [2022-11-20 10:32:31,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:32:31,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 595284937, now seen corresponding path program 1 times [2022-11-20 10:32:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:31,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428633927] [2022-11-20 10:32:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:31,778 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 10:32:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:31,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428633927] [2022-11-20 10:32:31,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428633927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:31,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:31,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:32:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157467158] [2022-11-20 10:32:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:31,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:31,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:31,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-20 10:32:31,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 10:32:31,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:31,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-20 10:32:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:32,473 INFO L130 PetriNetUnfolder]: 515/1535 cut-off events. [2022-11-20 10:32:32,473 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-11-20 10:32:32,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 1535 events. 515/1535 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11256 event pairs, 129 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 2414. Up to 472 conditions per place. [2022-11-20 10:32:32,486 INFO L137 encePairwiseOnDemand]: 106/113 looper letters, 21 selfloop transitions, 3 changer transitions 51/152 dead transitions. [2022-11-20 10:32:32,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 152 transitions, 460 flow [2022-11-20 10:32:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:32:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:32:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2022-11-20 10:32:32,493 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8702064896755162 [2022-11-20 10:32:32,493 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2022-11-20 10:32:32,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2022-11-20 10:32:32,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:32,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2022-11-20 10:32:32,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 10:32:32,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 10:32:32,504 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 10:32:32,504 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 885 transitions. [2022-11-20 10:32:32,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 152 transitions, 460 flow [2022-11-20 10:32:32,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:32:32,510 INFO L231 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-11-20 10:32:32,511 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-11-20 10:32:32,512 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-11-20 10:32:32,512 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-11-20 10:32:32,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 10:32:32,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:32,514 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] [2022-11-20 10:32:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:32:32,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2078325338, now seen corresponding path program 1 times [2022-11-20 10:32:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:32,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955834340] [2022-11-20 10:32:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:33,492 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 10:32:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955834340] [2022-11-20 10:32:33,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955834340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:33,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:33,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575037790] [2022-11-20 10:32:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:33,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:33,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:33,497 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:32:33,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 10:32:33,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:33,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:32:33,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:34,918 INFO L130 PetriNetUnfolder]: 1763/3047 cut-off events. [2022-11-20 10:32:34,918 INFO L131 PetriNetUnfolder]: For 2982/3001 co-relation queries the response was YES. [2022-11-20 10:32:34,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7700 conditions, 3047 events. 1763/3047 cut-off events. For 2982/3001 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17722 event pairs, 183 based on Foata normal form. 80/3039 useless extension candidates. Maximal degree in co-relation 7635. Up to 1239 conditions per place. [2022-11-20 10:32:34,942 INFO L137 encePairwiseOnDemand]: 98/113 looper letters, 41 selfloop transitions, 14 changer transitions 83/204 dead transitions. [2022-11-20 10:32:34,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 204 transitions, 955 flow [2022-11-20 10:32:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:32:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:32:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1177 transitions. [2022-11-20 10:32:34,947 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8012253233492171 [2022-11-20 10:32:34,948 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1177 transitions. [2022-11-20 10:32:34,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1177 transitions. [2022-11-20 10:32:34,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:34,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1177 transitions. [2022-11-20 10:32:34,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.53846153846153) internal successors, (1177), 13 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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 10:32:34,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:34,959 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:34,960 INFO L175 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 13 states and 1177 transitions. [2022-11-20 10:32:34,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 204 transitions, 955 flow [2022-11-20 10:32:34,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 204 transitions, 926 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-20 10:32:34,984 INFO L231 Difference]: Finished difference. Result has 130 places, 108 transitions, 404 flow [2022-11-20 10:32:34,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=404, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2022-11-20 10:32:34,985 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2022-11-20 10:32:34,985 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 404 flow [2022-11-20 10:32:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 10:32:34,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:34,986 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] [2022-11-20 10:32:34,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:32:34,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1493924659, now seen corresponding path program 1 times [2022-11-20 10:32:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:34,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574395632] [2022-11-20 10:32:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:32:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:35,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574395632] [2022-11-20 10:32:35,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574395632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:35,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:35,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536719716] [2022-11-20 10:32:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:35,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:35,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:35,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:35,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:32:35,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 108 transitions, 404 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 10:32:35,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:35,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:32:35,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:37,468 INFO L130 PetriNetUnfolder]: 1802/3329 cut-off events. [2022-11-20 10:32:37,469 INFO L131 PetriNetUnfolder]: For 14693/17082 co-relation queries the response was YES. [2022-11-20 10:32:37,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14307 conditions, 3329 events. 1802/3329 cut-off events. For 14693/17082 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20727 event pairs, 373 based on Foata normal form. 79/3295 useless extension candidates. Maximal degree in co-relation 14230. Up to 1505 conditions per place. [2022-11-20 10:32:37,504 INFO L137 encePairwiseOnDemand]: 99/113 looper letters, 50 selfloop transitions, 21 changer transitions 73/210 dead transitions. [2022-11-20 10:32:37,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 210 transitions, 1470 flow [2022-11-20 10:32:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:32:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:32:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1159 transitions. [2022-11-20 10:32:37,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7889720898570456 [2022-11-20 10:32:37,508 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1159 transitions. [2022-11-20 10:32:37,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1159 transitions. [2022-11-20 10:32:37,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:37,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1159 transitions. [2022-11-20 10:32:37,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.15384615384616) internal successors, (1159), 13 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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 10:32:37,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:37,517 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:37,517 INFO L175 Difference]: Start difference. First operand has 130 places, 108 transitions, 404 flow. Second operand 13 states and 1159 transitions. [2022-11-20 10:32:37,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 210 transitions, 1470 flow [2022-11-20 10:32:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 210 transitions, 1398 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-11-20 10:32:37,557 INFO L231 Difference]: Finished difference. Result has 139 places, 119 transitions, 628 flow [2022-11-20 10:32:37,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=628, PETRI_PLACES=139, PETRI_TRANSITIONS=119} [2022-11-20 10:32:37,558 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 21 predicate places. [2022-11-20 10:32:37,559 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 119 transitions, 628 flow [2022-11-20 10:32:37,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 10:32:37,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:37,559 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] [2022-11-20 10:32:37,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:32:37,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -805685209, now seen corresponding path program 1 times [2022-11-20 10:32:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061211592] [2022-11-20 10:32:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,254 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 10:32:38,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:38,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061211592] [2022-11-20 10:32:38,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061211592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:38,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:38,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418351851] [2022-11-20 10:32:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:32:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:38,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:32:38,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:38,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 10:32:38,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 119 transitions, 628 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 10:32:38,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:38,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 10:32:38,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:39,435 INFO L130 PetriNetUnfolder]: 1589/3055 cut-off events. [2022-11-20 10:32:39,435 INFO L131 PetriNetUnfolder]: For 24045/32971 co-relation queries the response was YES. [2022-11-20 10:32:39,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15612 conditions, 3055 events. 1589/3055 cut-off events. For 24045/32971 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20058 event pairs, 357 based on Foata normal form. 248/3172 useless extension candidates. Maximal degree in co-relation 15530. Up to 1470 conditions per place. [2022-11-20 10:32:39,479 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 33 selfloop transitions, 20 changer transitions 79/221 dead transitions. [2022-11-20 10:32:39,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 221 transitions, 1844 flow [2022-11-20 10:32:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:32:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 10:32:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1413 transitions. [2022-11-20 10:32:39,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8336283185840708 [2022-11-20 10:32:39,485 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1413 transitions. [2022-11-20 10:32:39,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1413 transitions. [2022-11-20 10:32:39,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:39,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1413 transitions. [2022-11-20 10:32:39,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.2) internal successors, (1413), 15 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states 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 10:32:39,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states 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 10:32:39,496 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states 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 10:32:39,496 INFO L175 Difference]: Start difference. First operand has 139 places, 119 transitions, 628 flow. Second operand 15 states and 1413 transitions. [2022-11-20 10:32:39,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 221 transitions, 1844 flow [2022-11-20 10:32:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 221 transitions, 1802 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-11-20 10:32:39,537 INFO L231 Difference]: Finished difference. Result has 149 places, 134 transitions, 899 flow [2022-11-20 10:32:39,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=899, PETRI_PLACES=149, PETRI_TRANSITIONS=134} [2022-11-20 10:32:39,539 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2022-11-20 10:32:39,539 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 134 transitions, 899 flow [2022-11-20 10:32:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 10:32:39,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:39,540 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] [2022-11-20 10:32:39,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:32:39,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1682450726, now seen corresponding path program 1 times [2022-11-20 10:32:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:39,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104031615] [2022-11-20 10:32:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,487 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 10:32:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104031615] [2022-11-20 10:32:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104031615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:40,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:40,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830178553] [2022-11-20 10:32:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:40,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:32:40,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 134 transitions, 899 flow. Second operand has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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 10:32:40,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:40,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:32:40,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:42,165 INFO L130 PetriNetUnfolder]: 1956/4189 cut-off events. [2022-11-20 10:32:42,165 INFO L131 PetriNetUnfolder]: For 41694/65713 co-relation queries the response was YES. [2022-11-20 10:32:42,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23919 conditions, 4189 events. 1956/4189 cut-off events. For 41694/65713 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 31660 event pairs, 212 based on Foata normal form. 113/4182 useless extension candidates. Maximal degree in co-relation 23821. Up to 1709 conditions per place. [2022-11-20 10:32:42,237 INFO L137 encePairwiseOnDemand]: 98/113 looper letters, 68 selfloop transitions, 22 changer transitions 78/234 dead transitions. [2022-11-20 10:32:42,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 234 transitions, 2477 flow [2022-11-20 10:32:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:32:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:32:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1153 transitions. [2022-11-20 10:32:42,242 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7848876786929885 [2022-11-20 10:32:42,242 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1153 transitions. [2022-11-20 10:32:42,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1153 transitions. [2022-11-20 10:32:42,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:42,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1153 transitions. [2022-11-20 10:32:42,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.6923076923077) internal successors, (1153), 13 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states 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 10:32:42,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:42,250 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:42,250 INFO L175 Difference]: Start difference. First operand has 149 places, 134 transitions, 899 flow. Second operand 13 states and 1153 transitions. [2022-11-20 10:32:42,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 234 transitions, 2477 flow [2022-11-20 10:32:42,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 234 transitions, 2407 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-11-20 10:32:42,309 INFO L231 Difference]: Finished difference. Result has 159 places, 135 transitions, 1042 flow [2022-11-20 10:32:42,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1042, PETRI_PLACES=159, PETRI_TRANSITIONS=135} [2022-11-20 10:32:42,312 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 41 predicate places. [2022-11-20 10:32:42,312 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 1042 flow [2022-11-20 10:32:42,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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 10:32:42,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:42,313 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] [2022-11-20 10:32:42,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:32:42,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 738822861, now seen corresponding path program 1 times [2022-11-20 10:32:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163557038] [2022-11-20 10:32:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,921 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 10:32:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:42,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163557038] [2022-11-20 10:32:42,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163557038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:42,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:42,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:32:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255818630] [2022-11-20 10:32:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:32:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:32:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:42,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-20 10:32:42,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 135 transitions, 1042 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:42,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:42,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-20 10:32:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:44,323 INFO L130 PetriNetUnfolder]: 1569/3376 cut-off events. [2022-11-20 10:32:44,323 INFO L131 PetriNetUnfolder]: For 59420/83121 co-relation queries the response was YES. [2022-11-20 10:32:44,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22779 conditions, 3376 events. 1569/3376 cut-off events. For 59420/83121 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25159 event pairs, 361 based on Foata normal form. 332/3602 useless extension candidates. Maximal degree in co-relation 22676. Up to 1609 conditions per place. [2022-11-20 10:32:44,379 INFO L137 encePairwiseOnDemand]: 102/113 looper letters, 52 selfloop transitions, 11 changer transitions 80/232 dead transitions. [2022-11-20 10:32:44,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 232 transitions, 2998 flow [2022-11-20 10:32:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:32:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:32:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1333 transitions. [2022-11-20 10:32:44,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8426042983565107 [2022-11-20 10:32:44,385 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1333 transitions. [2022-11-20 10:32:44,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1333 transitions. [2022-11-20 10:32:44,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:44,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1333 transitions. [2022-11-20 10:32:44,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.21428571428571) internal successors, (1333), 14 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states 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 10:32:44,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states 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 10:32:44,396 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states 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 10:32:44,396 INFO L175 Difference]: Start difference. First operand has 159 places, 135 transitions, 1042 flow. Second operand 14 states and 1333 transitions. [2022-11-20 10:32:44,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 232 transitions, 2998 flow [2022-11-20 10:32:44,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 232 transitions, 2856 flow, removed 71 selfloop flow, removed 6 redundant places. [2022-11-20 10:32:44,479 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1127 flow [2022-11-20 10:32:44,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1127, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2022-11-20 10:32:44,480 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 49 predicate places. [2022-11-20 10:32:44,481 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1127 flow [2022-11-20 10:32:44,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:44,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:44,482 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] [2022-11-20 10:32:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:32:44,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -747349345, now seen corresponding path program 2 times [2022-11-20 10:32:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:44,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714257355] [2022-11-20 10:32:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:45,149 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 10:32:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:45,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714257355] [2022-11-20 10:32:45,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714257355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:45,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:45,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:32:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53939682] [2022-11-20 10:32:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:32:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:32:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:45,153 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-20 10:32:45,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1127 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:45,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:45,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-20 10:32:45,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:46,319 INFO L130 PetriNetUnfolder]: 1434/3122 cut-off events. [2022-11-20 10:32:46,319 INFO L131 PetriNetUnfolder]: For 69888/102100 co-relation queries the response was YES. [2022-11-20 10:32:46,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23170 conditions, 3122 events. 1434/3122 cut-off events. For 69888/102100 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 22650 event pairs, 411 based on Foata normal form. 325/3309 useless extension candidates. Maximal degree in co-relation 23060. Up to 1536 conditions per place. [2022-11-20 10:32:46,365 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 51 selfloop transitions, 7 changer transitions 62/209 dead transitions. [2022-11-20 10:32:46,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 209 transitions, 2809 flow [2022-11-20 10:32:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:32:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1044 transitions. [2022-11-20 10:32:46,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8399034593724859 [2022-11-20 10:32:46,369 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1044 transitions. [2022-11-20 10:32:46,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1044 transitions. [2022-11-20 10:32:46,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:46,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1044 transitions. [2022-11-20 10:32:46,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.9090909090909) internal successors, (1044), 11 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 10:32:46,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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 10:32:46,377 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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 10:32:46,377 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1127 flow. Second operand 11 states and 1044 transitions. [2022-11-20 10:32:46,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 209 transitions, 2809 flow [2022-11-20 10:32:46,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 209 transitions, 2713 flow, removed 41 selfloop flow, removed 8 redundant places. [2022-11-20 10:32:46,456 INFO L231 Difference]: Finished difference. Result has 167 places, 138 transitions, 1079 flow [2022-11-20 10:32:46,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1079, PETRI_PLACES=167, PETRI_TRANSITIONS=138} [2022-11-20 10:32:46,460 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 49 predicate places. [2022-11-20 10:32:46,460 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 138 transitions, 1079 flow [2022-11-20 10:32:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:46,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:46,461 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] [2022-11-20 10:32:46,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:32:46,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2039680837, now seen corresponding path program 1 times [2022-11-20 10:32:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:46,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730456085] [2022-11-20 10:32:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:47,429 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 10:32:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:47,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730456085] [2022-11-20 10:32:47,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730456085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:47,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:47,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:32:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625437913] [2022-11-20 10:32:47,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:47,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:47,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:47,432 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-20 10:32:47,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 138 transitions, 1079 flow. Second operand has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:47,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:47,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-20 10:32:47,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:48,863 INFO L130 PetriNetUnfolder]: 1727/3688 cut-off events. [2022-11-20 10:32:48,864 INFO L131 PetriNetUnfolder]: For 83961/101569 co-relation queries the response was YES. [2022-11-20 10:32:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27168 conditions, 3688 events. 1727/3688 cut-off events. For 83961/101569 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27579 event pairs, 451 based on Foata normal form. 482/4029 useless extension candidates. Maximal degree in co-relation 27053. Up to 1656 conditions per place. [2022-11-20 10:32:48,921 INFO L137 encePairwiseOnDemand]: 98/113 looper letters, 53 selfloop transitions, 38 changer transitions 124/301 dead transitions. [2022-11-20 10:32:48,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 301 transitions, 4585 flow [2022-11-20 10:32:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:32:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 10:32:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1650 transitions. [2022-11-20 10:32:48,925 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8112094395280236 [2022-11-20 10:32:48,926 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1650 transitions. [2022-11-20 10:32:48,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1650 transitions. [2022-11-20 10:32:48,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:48,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1650 transitions. [2022-11-20 10:32:48,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 91.66666666666667) internal successors, (1650), 18 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states 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 10:32:48,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states 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 10:32:48,940 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states 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 10:32:48,940 INFO L175 Difference]: Start difference. First operand has 167 places, 138 transitions, 1079 flow. Second operand 18 states and 1650 transitions. [2022-11-20 10:32:48,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 301 transitions, 4585 flow [2022-11-20 10:32:49,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 301 transitions, 4498 flow, removed 33 selfloop flow, removed 12 redundant places. [2022-11-20 10:32:49,060 INFO L231 Difference]: Finished difference. Result has 178 places, 168 transitions, 1829 flow [2022-11-20 10:32:49,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1829, PETRI_PLACES=178, PETRI_TRANSITIONS=168} [2022-11-20 10:32:49,061 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 60 predicate places. [2022-11-20 10:32:49,062 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 1829 flow [2022-11-20 10:32:49,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:49,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:49,063 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] [2022-11-20 10:32:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:32:49,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1253704069, now seen corresponding path program 2 times [2022-11-20 10:32:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946884827] [2022-11-20 10:32:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:50,389 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 10:32:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:50,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946884827] [2022-11-20 10:32:50,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946884827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:50,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:50,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:32:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287737380] [2022-11-20 10:32:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:50,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:32:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:32:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:32:50,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:32:50,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 1829 flow. Second operand has 13 states, 13 states have (on average 81.6923076923077) internal successors, (1062), 13 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:32:50,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:50,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:32:50,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:52,306 INFO L130 PetriNetUnfolder]: 1836/3937 cut-off events. [2022-11-20 10:32:52,307 INFO L131 PetriNetUnfolder]: For 115305/173373 co-relation queries the response was YES. [2022-11-20 10:32:52,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33562 conditions, 3937 events. 1836/3937 cut-off events. For 115305/173373 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29230 event pairs, 360 based on Foata normal form. 142/3922 useless extension candidates. Maximal degree in co-relation 33438. Up to 1693 conditions per place. [2022-11-20 10:32:52,372 INFO L137 encePairwiseOnDemand]: 96/113 looper letters, 86 selfloop transitions, 54 changer transitions 182/388 dead transitions. [2022-11-20 10:32:52,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 388 transitions, 7417 flow [2022-11-20 10:32:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:32:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 10:32:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1637 transitions. [2022-11-20 10:32:52,377 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7624592454587797 [2022-11-20 10:32:52,377 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1637 transitions. [2022-11-20 10:32:52,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1637 transitions. [2022-11-20 10:32:52,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:52,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1637 transitions. [2022-11-20 10:32:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 86.15789473684211) internal successors, (1637), 19 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states 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 10:32:52,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 113.0) internal successors, (2260), 20 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states 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 10:32:52,388 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 113.0) internal successors, (2260), 20 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states 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 10:32:52,389 INFO L175 Difference]: Start difference. First operand has 178 places, 168 transitions, 1829 flow. Second operand 19 states and 1637 transitions. [2022-11-20 10:32:52,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 388 transitions, 7417 flow [2022-11-20 10:32:52,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 388 transitions, 7167 flow, removed 121 selfloop flow, removed 7 redundant places. [2022-11-20 10:32:52,576 INFO L231 Difference]: Finished difference. Result has 191 places, 185 transitions, 2288 flow [2022-11-20 10:32:52,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2288, PETRI_PLACES=191, PETRI_TRANSITIONS=185} [2022-11-20 10:32:52,579 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 73 predicate places. [2022-11-20 10:32:52,580 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 185 transitions, 2288 flow [2022-11-20 10:32:52,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 81.6923076923077) internal successors, (1062), 13 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 10:32:52,581 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:52,581 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] [2022-11-20 10:32:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:32:52,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 946438861, now seen corresponding path program 1 times [2022-11-20 10:32:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:52,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58567561] [2022-11-20 10:32:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:32:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58567561] [2022-11-20 10:32:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58567561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:53,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:53,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092779048] [2022-11-20 10:32:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:53,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:32:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:32:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:53,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-11-20 10:32:53,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 185 transitions, 2288 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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 10:32:53,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:53,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-11-20 10:32:53,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:54,688 INFO L130 PetriNetUnfolder]: 1392/3110 cut-off events. [2022-11-20 10:32:54,688 INFO L131 PetriNetUnfolder]: For 176858/228649 co-relation queries the response was YES. [2022-11-20 10:32:54,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34337 conditions, 3110 events. 1392/3110 cut-off events. For 176858/228649 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22856 event pairs, 321 based on Foata normal form. 378/3333 useless extension candidates. Maximal degree in co-relation 34206. Up to 1498 conditions per place. [2022-11-20 10:32:54,743 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 86 selfloop transitions, 28 changer transitions 91/295 dead transitions. [2022-11-20 10:32:54,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 295 transitions, 6789 flow [2022-11-20 10:32:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:32:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:32:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1117 transitions. [2022-11-20 10:32:54,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237463126843658 [2022-11-20 10:32:54,746 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1117 transitions. [2022-11-20 10:32:54,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1117 transitions. [2022-11-20 10:32:54,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:54,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1117 transitions. [2022-11-20 10:32:54,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.08333333333333) internal successors, (1117), 12 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states 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 10:32:54,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states 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 10:32:54,753 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states 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 10:32:54,753 INFO L175 Difference]: Start difference. First operand has 191 places, 185 transitions, 2288 flow. Second operand 12 states and 1117 transitions. [2022-11-20 10:32:54,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 295 transitions, 6789 flow [2022-11-20 10:32:55,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 295 transitions, 6245 flow, removed 241 selfloop flow, removed 13 redundant places. [2022-11-20 10:32:55,034 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 2485 flow [2022-11-20 10:32:55,034 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2485, PETRI_PLACES=187, PETRI_TRANSITIONS=194} [2022-11-20 10:32:55,035 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 69 predicate places. [2022-11-20 10:32:55,035 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 2485 flow [2022-11-20 10:32:55,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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 10:32:55,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:55,036 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] [2022-11-20 10:32:55,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:32:55,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash -407188755, now seen corresponding path program 2 times [2022-11-20 10:32:55,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:55,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791821760] [2022-11-20 10:32:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:55,900 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 10:32:55,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:55,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791821760] [2022-11-20 10:32:55,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791821760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:55,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:55,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:32:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058873774] [2022-11-20 10:32:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:55,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:55,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:32:55,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 194 transitions, 2485 flow. Second operand has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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 10:32:55,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:55,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:32:55,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:57,513 INFO L130 PetriNetUnfolder]: 1435/3264 cut-off events. [2022-11-20 10:32:57,513 INFO L131 PetriNetUnfolder]: For 172651/222778 co-relation queries the response was YES. [2022-11-20 10:32:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35381 conditions, 3264 events. 1435/3264 cut-off events. For 172651/222778 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 24128 event pairs, 249 based on Foata normal form. 133/3257 useless extension candidates. Maximal degree in co-relation 35249. Up to 1373 conditions per place. [2022-11-20 10:32:57,570 INFO L137 encePairwiseOnDemand]: 96/113 looper letters, 83 selfloop transitions, 88 changer transitions 88/325 dead transitions. [2022-11-20 10:32:57,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 325 transitions, 6342 flow [2022-11-20 10:32:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:32:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 10:32:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1225 transitions. [2022-11-20 10:32:57,576 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7743362831858407 [2022-11-20 10:32:57,576 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1225 transitions. [2022-11-20 10:32:57,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1225 transitions. [2022-11-20 10:32:57,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:57,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1225 transitions. [2022-11-20 10:32:57,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.5) internal successors, (1225), 14 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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 10:32:57,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states 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 10:32:57,600 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states 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 10:32:57,601 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 2485 flow. Second operand 14 states and 1225 transitions. [2022-11-20 10:32:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 325 transitions, 6342 flow [2022-11-20 10:32:57,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 325 transitions, 5062 flow, removed 612 selfloop flow, removed 22 redundant places. [2022-11-20 10:32:57,843 INFO L231 Difference]: Finished difference. Result has 182 places, 214 transitions, 2785 flow [2022-11-20 10:32:57,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2785, PETRI_PLACES=182, PETRI_TRANSITIONS=214} [2022-11-20 10:32:57,844 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 64 predicate places. [2022-11-20 10:32:57,844 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 214 transitions, 2785 flow [2022-11-20 10:32:57,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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 10:32:57,845 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:57,845 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] [2022-11-20 10:32:57,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:32:57,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash -37920301, now seen corresponding path program 3 times [2022-11-20 10:32:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:57,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018739864] [2022-11-20 10:32:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:58,425 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 10:32:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:58,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018739864] [2022-11-20 10:32:58,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018739864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:58,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:58,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:32:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515551880] [2022-11-20 10:32:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:58,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:58,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:58,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 10:32:58,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 214 transitions, 2785 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 10:32:58,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:58,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 10:32:58,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:59,513 INFO L130 PetriNetUnfolder]: 1278/2827 cut-off events. [2022-11-20 10:32:59,513 INFO L131 PetriNetUnfolder]: For 127552/202866 co-relation queries the response was YES. [2022-11-20 10:32:59,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28713 conditions, 2827 events. 1278/2827 cut-off events. For 127552/202866 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20198 event pairs, 308 based on Foata normal form. 459/3131 useless extension candidates. Maximal degree in co-relation 28592. Up to 1380 conditions per place. [2022-11-20 10:32:59,555 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 93 selfloop transitions, 33 changer transitions 86/310 dead transitions. [2022-11-20 10:32:59,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 310 transitions, 6198 flow [2022-11-20 10:32:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:32:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:32:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1216 transitions. [2022-11-20 10:32:59,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277739959155889 [2022-11-20 10:32:59,558 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1216 transitions. [2022-11-20 10:32:59,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1216 transitions. [2022-11-20 10:32:59,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:59,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1216 transitions. [2022-11-20 10:32:59,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.53846153846153) internal successors, (1216), 13 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states 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 10:32:59,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:59,564 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:32:59,564 INFO L175 Difference]: Start difference. First operand has 182 places, 214 transitions, 2785 flow. Second operand 13 states and 1216 transitions. [2022-11-20 10:32:59,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 310 transitions, 6198 flow [2022-11-20 10:32:59,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 310 transitions, 5965 flow, removed 115 selfloop flow, removed 8 redundant places. [2022-11-20 10:32:59,739 INFO L231 Difference]: Finished difference. Result has 187 places, 216 transitions, 3008 flow [2022-11-20 10:32:59,740 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3008, PETRI_PLACES=187, PETRI_TRANSITIONS=216} [2022-11-20 10:32:59,740 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 69 predicate places. [2022-11-20 10:32:59,740 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 216 transitions, 3008 flow [2022-11-20 10:32:59,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 10:32:59,741 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:59,741 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] [2022-11-20 10:32:59,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:32:59,742 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:32:59,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash -448010961, now seen corresponding path program 4 times [2022-11-20 10:32:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:59,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971803721] [2022-11-20 10:32:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:01,095 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 10:33:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971803721] [2022-11-20 10:33:01,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971803721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:33:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602202430] [2022-11-20 10:33:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:01,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:33:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:33:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:33:01,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-11-20 10:33:01,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 216 transitions, 3008 flow. Second operand has 10 states, 10 states have (on average 82.3) internal successors, (823), 10 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 10:33:01,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:01,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-11-20 10:33:01,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:03,066 INFO L130 PetriNetUnfolder]: 1313/3156 cut-off events. [2022-11-20 10:33:03,066 INFO L131 PetriNetUnfolder]: For 123057/276136 co-relation queries the response was YES. [2022-11-20 10:33:03,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31734 conditions, 3156 events. 1313/3156 cut-off events. For 123057/276136 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 24250 event pairs, 172 based on Foata normal form. 146/3153 useless extension candidates. Maximal degree in co-relation 31605. Up to 1320 conditions per place. [2022-11-20 10:33:03,124 INFO L137 encePairwiseOnDemand]: 96/113 looper letters, 90 selfloop transitions, 114 changer transitions 123/393 dead transitions. [2022-11-20 10:33:03,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 393 transitions, 8449 flow [2022-11-20 10:33:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:33:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-20 10:33:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1568 transitions. [2022-11-20 10:33:03,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7708947885939036 [2022-11-20 10:33:03,129 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1568 transitions. [2022-11-20 10:33:03,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1568 transitions. [2022-11-20 10:33:03,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:03,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1568 transitions. [2022-11-20 10:33:03,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 87.11111111111111) internal successors, (1568), 18 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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 10:33:03,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states 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 10:33:03,138 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states 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 10:33:03,139 INFO L175 Difference]: Start difference. First operand has 187 places, 216 transitions, 3008 flow. Second operand 18 states and 1568 transitions. [2022-11-20 10:33:03,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 393 transitions, 8449 flow [2022-11-20 10:33:03,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 393 transitions, 7673 flow, removed 363 selfloop flow, removed 11 redundant places. [2022-11-20 10:33:03,341 INFO L231 Difference]: Finished difference. Result has 200 places, 248 transitions, 3977 flow [2022-11-20 10:33:03,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2789, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3977, PETRI_PLACES=200, PETRI_TRANSITIONS=248} [2022-11-20 10:33:03,342 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 82 predicate places. [2022-11-20 10:33:03,342 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 248 transitions, 3977 flow [2022-11-20 10:33:03,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.3) internal successors, (823), 10 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 10:33:03,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:03,343 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] [2022-11-20 10:33:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:33:03,344 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 879090438, now seen corresponding path program 1 times [2022-11-20 10:33:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:03,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653834209] [2022-11-20 10:33:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:03,597 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 10:33:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653834209] [2022-11-20 10:33:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653834209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:03,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:03,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:33:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210925902] [2022-11-20 10:33:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:03,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:33:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:33:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:33:03,600 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 10:33:03,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 248 transitions, 3977 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 10:33:03,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:03,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 10:33:03,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:06,273 INFO L130 PetriNetUnfolder]: 5082/9346 cut-off events. [2022-11-20 10:33:06,273 INFO L131 PetriNetUnfolder]: For 631264/655466 co-relation queries the response was YES. [2022-11-20 10:33:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81673 conditions, 9346 events. 5082/9346 cut-off events. For 631264/655466 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 75065 event pairs, 277 based on Foata normal form. 2388/11340 useless extension candidates. Maximal degree in co-relation 81545. Up to 3676 conditions per place. [2022-11-20 10:33:06,346 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 137 selfloop transitions, 9 changer transitions 271/529 dead transitions. [2022-11-20 10:33:06,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 529 transitions, 12556 flow [2022-11-20 10:33:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:33:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:33:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-11-20 10:33:06,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8601769911504424 [2022-11-20 10:33:06,349 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-11-20 10:33:06,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-11-20 10:33:06,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:06,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-11-20 10:33:06,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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 10:33:06,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states 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 10:33:06,354 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states 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 10:33:06,354 INFO L175 Difference]: Start difference. First operand has 200 places, 248 transitions, 3977 flow. Second operand 10 states and 972 transitions. [2022-11-20 10:33:06,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 529 transitions, 12556 flow [2022-11-20 10:33:06,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 529 transitions, 11835 flow, removed 345 selfloop flow, removed 10 redundant places. [2022-11-20 10:33:06,850 INFO L231 Difference]: Finished difference. Result has 197 places, 205 transitions, 2879 flow [2022-11-20 10:33:06,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=3057, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2879, PETRI_PLACES=197, PETRI_TRANSITIONS=205} [2022-11-20 10:33:06,851 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 79 predicate places. [2022-11-20 10:33:06,852 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 205 transitions, 2879 flow [2022-11-20 10:33:06,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 10:33:06,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:06,852 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 10:33:06,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:33:06,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -828716584, now seen corresponding path program 1 times [2022-11-20 10:33:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150239707] [2022-11-20 10:33:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:07,066 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 10:33:07,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:07,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150239707] [2022-11-20 10:33:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150239707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:07,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:07,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:33:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608214957] [2022-11-20 10:33:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:33:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:33:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:33:07,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 10:33:07,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 205 transitions, 2879 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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 10:33:07,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:07,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 10:33:07,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:09,047 INFO L130 PetriNetUnfolder]: 2814/5774 cut-off events. [2022-11-20 10:33:09,047 INFO L131 PetriNetUnfolder]: For 351515/365247 co-relation queries the response was YES. [2022-11-20 10:33:09,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51934 conditions, 5774 events. 2814/5774 cut-off events. For 351515/365247 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 49068 event pairs, 151 based on Foata normal form. 1551/7175 useless extension candidates. Maximal degree in co-relation 51806. Up to 2268 conditions per place. [2022-11-20 10:33:09,083 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 103 selfloop transitions, 13 changer transitions 249/469 dead transitions. [2022-11-20 10:33:09,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 469 transitions, 10684 flow [2022-11-20 10:33:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:33:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:33:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1260 transitions. [2022-11-20 10:33:09,085 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8577263444520081 [2022-11-20 10:33:09,085 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1260 transitions. [2022-11-20 10:33:09,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1260 transitions. [2022-11-20 10:33:09,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:09,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1260 transitions. [2022-11-20 10:33:09,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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 10:33:09,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:09,090 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:09,090 INFO L175 Difference]: Start difference. First operand has 197 places, 205 transitions, 2879 flow. Second operand 13 states and 1260 transitions. [2022-11-20 10:33:09,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 469 transitions, 10684 flow [2022-11-20 10:33:09,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 469 transitions, 10203 flow, removed 174 selfloop flow, removed 8 redundant places. [2022-11-20 10:33:09,521 INFO L231 Difference]: Finished difference. Result has 206 places, 176 transitions, 2110 flow [2022-11-20 10:33:09,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2110, PETRI_PLACES=206, PETRI_TRANSITIONS=176} [2022-11-20 10:33:09,522 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 88 predicate places. [2022-11-20 10:33:09,522 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 176 transitions, 2110 flow [2022-11-20 10:33:09,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states 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 10:33:09,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:09,523 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, 1, 1, 1] [2022-11-20 10:33:09,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:33:09,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -848418382, now seen corresponding path program 1 times [2022-11-20 10:33:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564597323] [2022-11-20 10:33:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:09,778 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 10:33:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:09,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564597323] [2022-11-20 10:33:09,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564597323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:09,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:09,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:33:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307862953] [2022-11-20 10:33:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:33:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:33:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:33:09,783 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 10:33:09,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 176 transitions, 2110 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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 10:33:09,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:09,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 10:33:09,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:10,811 INFO L130 PetriNetUnfolder]: 1290/3443 cut-off events. [2022-11-20 10:33:10,811 INFO L131 PetriNetUnfolder]: For 151809/154655 co-relation queries the response was YES. [2022-11-20 10:33:10,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27724 conditions, 3443 events. 1290/3443 cut-off events. For 151809/154655 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 31370 event pairs, 106 based on Foata normal form. 423/3827 useless extension candidates. Maximal degree in co-relation 27664. Up to 1127 conditions per place. [2022-11-20 10:33:10,850 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 46 selfloop transitions, 14 changer transitions 127/273 dead transitions. [2022-11-20 10:33:10,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 273 transitions, 4732 flow [2022-11-20 10:33:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:33:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:33:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1234 transitions. [2022-11-20 10:33:10,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8400272294077604 [2022-11-20 10:33:10,852 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1234 transitions. [2022-11-20 10:33:10,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1234 transitions. [2022-11-20 10:33:10,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:10,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1234 transitions. [2022-11-20 10:33:10,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.92307692307692) internal successors, (1234), 13 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states 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 10:33:10,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:10,857 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:10,858 INFO L175 Difference]: Start difference. First operand has 206 places, 176 transitions, 2110 flow. Second operand 13 states and 1234 transitions. [2022-11-20 10:33:10,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 273 transitions, 4732 flow [2022-11-20 10:33:11,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 273 transitions, 4052 flow, removed 284 selfloop flow, removed 15 redundant places. [2022-11-20 10:33:11,215 INFO L231 Difference]: Finished difference. Result has 204 places, 129 transitions, 1059 flow [2022-11-20 10:33:11,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1059, PETRI_PLACES=204, PETRI_TRANSITIONS=129} [2022-11-20 10:33:11,216 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 86 predicate places. [2022-11-20 10:33:11,216 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 129 transitions, 1059 flow [2022-11-20 10:33:11,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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 10:33:11,217 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:11,217 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:11,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:33:11,217 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1417758701, now seen corresponding path program 1 times [2022-11-20 10:33:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238727523] [2022-11-20 10:33:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:12,130 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 10:33:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:12,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238727523] [2022-11-20 10:33:12,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238727523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:12,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:12,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:33:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980793777] [2022-11-20 10:33:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:12,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:33:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:33:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:33:12,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-20 10:33:12,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 129 transitions, 1059 flow. Second operand has 11 states, 11 states have (on average 88.9090909090909) internal successors, (978), 11 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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 10:33:12,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:12,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-20 10:33:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:12,535 INFO L130 PetriNetUnfolder]: 160/1168 cut-off events. [2022-11-20 10:33:12,535 INFO L131 PetriNetUnfolder]: For 6291/6471 co-relation queries the response was YES. [2022-11-20 10:33:12,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1168 events. 160/1168 cut-off events. For 6291/6471 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11348 event pairs, 4 based on Foata normal form. 5/1098 useless extension candidates. Maximal degree in co-relation 4502. Up to 234 conditions per place. [2022-11-20 10:33:12,543 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 23 selfloop transitions, 14 changer transitions 15/139 dead transitions. [2022-11-20 10:33:12,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 139 transitions, 1269 flow [2022-11-20 10:33:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:33:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 991 transitions. [2022-11-20 10:33:12,545 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7972646822204345 [2022-11-20 10:33:12,545 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 991 transitions. [2022-11-20 10:33:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 991 transitions. [2022-11-20 10:33:12,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:12,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 991 transitions. [2022-11-20 10:33:12,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.0909090909091) internal successors, (991), 11 states have internal predecessors, (991), 0 states have call successors, (0), 0 states 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 10:33:12,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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 10:33:12,548 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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 10:33:12,548 INFO L175 Difference]: Start difference. First operand has 204 places, 129 transitions, 1059 flow. Second operand 11 states and 991 transitions. [2022-11-20 10:33:12,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 139 transitions, 1269 flow [2022-11-20 10:33:12,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 139 transitions, 915 flow, removed 112 selfloop flow, removed 42 redundant places. [2022-11-20 10:33:12,573 INFO L231 Difference]: Finished difference. Result has 164 places, 122 transitions, 691 flow [2022-11-20 10:33:12,574 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=691, PETRI_PLACES=164, PETRI_TRANSITIONS=122} [2022-11-20 10:33:12,574 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 46 predicate places. [2022-11-20 10:33:12,574 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 122 transitions, 691 flow [2022-11-20 10:33:12,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.9090909090909) internal successors, (978), 11 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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 10:33:12,575 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:12,575 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:33:12,575 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1292659427, now seen corresponding path program 2 times [2022-11-20 10:33:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16862555] [2022-11-20 10:33:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:14,144 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 10:33:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:14,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16862555] [2022-11-20 10:33:14,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16862555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:14,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:14,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:33:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108652083] [2022-11-20 10:33:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:33:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:33:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:33:14,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-11-20 10:33:14,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 122 transitions, 691 flow. Second operand has 15 states, 15 states have (on average 83.73333333333333) internal successors, (1256), 15 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states 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 10:33:14,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:14,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-11-20 10:33:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:14,798 INFO L130 PetriNetUnfolder]: 92/739 cut-off events. [2022-11-20 10:33:14,798 INFO L131 PetriNetUnfolder]: For 1078/1201 co-relation queries the response was YES. [2022-11-20 10:33:14,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 739 events. 92/739 cut-off events. For 1078/1201 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5914 event pairs, 2 based on Foata normal form. 14/706 useless extension candidates. Maximal degree in co-relation 1971. Up to 124 conditions per place. [2022-11-20 10:33:14,804 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 30 selfloop transitions, 9 changer transitions 17/136 dead transitions. [2022-11-20 10:33:14,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 136 transitions, 899 flow [2022-11-20 10:33:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:33:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 10:33:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1109 transitions. [2022-11-20 10:33:14,807 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7549353301565691 [2022-11-20 10:33:14,807 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1109 transitions. [2022-11-20 10:33:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1109 transitions. [2022-11-20 10:33:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:14,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1109 transitions. [2022-11-20 10:33:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 85.3076923076923) internal successors, (1109), 13 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states 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 10:33:14,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:14,812 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 10:33:14,812 INFO L175 Difference]: Start difference. First operand has 164 places, 122 transitions, 691 flow. Second operand 13 states and 1109 transitions. [2022-11-20 10:33:14,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 136 transitions, 899 flow [2022-11-20 10:33:14,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 136 transitions, 756 flow, removed 44 selfloop flow, removed 13 redundant places. [2022-11-20 10:33:14,820 INFO L231 Difference]: Finished difference. Result has 166 places, 116 transitions, 543 flow [2022-11-20 10:33:14,821 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=543, PETRI_PLACES=166, PETRI_TRANSITIONS=116} [2022-11-20 10:33:14,821 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-11-20 10:33:14,821 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 116 transitions, 543 flow [2022-11-20 10:33:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.73333333333333) internal successors, (1256), 15 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states 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 10:33:14,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:14,822 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:33:14,822 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 10:33:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash -331071725, now seen corresponding path program 3 times [2022-11-20 10:33:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:14,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732029977] [2022-11-20 10:33:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:33:14,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:33:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:33:14,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:33:14,984 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:33:14,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 10:33:14,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 10:33:15,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 10:33:15,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 10:33:15,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 10:33:15,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 10:33:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:33:15,005 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:15,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:33:15,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:33:15,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:33:15 BasicIcfg [2022-11-20 10:33:15,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:33:15,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:33:15,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:33:15,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:33:15,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:29" (3/4) ... [2022-11-20 10:33:15,206 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:33:15,329 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:33:15,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:33:15,330 INFO L158 Benchmark]: Toolchain (without parser) took 47382.71ms. Allocated memory was 127.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 94.5MB in the beginning and 717.3MB in the end (delta: -622.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-20 10:33:15,331 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 98.6MB. Free memory was 46.7MB in the beginning and 46.5MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:33:15,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.48ms. Allocated memory is still 127.9MB. Free memory was 94.1MB in the beginning and 71.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.55ms. Allocated memory is still 127.9MB. Free memory was 71.0MB in the beginning and 68.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,332 INFO L158 Benchmark]: Boogie Preprocessor took 47.89ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 66.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,332 INFO L158 Benchmark]: RCFGBuilder took 965.45ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 120.6MB in the end (delta: -54.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,333 INFO L158 Benchmark]: TraceAbstraction took 45465.00ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 119.6MB in the beginning and 738.3MB in the end (delta: -618.8MB). Peak memory consumption was 967.7MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,333 INFO L158 Benchmark]: Witness Printer took 127.10ms. Allocated memory is still 1.8GB. Free memory was 738.3MB in the beginning and 717.3MB in the end (delta: 21.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:33:15,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 98.6MB. Free memory was 46.7MB in the beginning and 46.5MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.48ms. Allocated memory is still 127.9MB. Free memory was 94.1MB in the beginning and 71.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.55ms. Allocated memory is still 127.9MB. Free memory was 71.0MB in the beginning and 68.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.89ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 66.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 965.45ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 66.4MB in the beginning and 120.6MB in the end (delta: -54.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45465.00ms. Allocated memory was 169.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 119.6MB in the beginning and 738.3MB in the end (delta: -618.8MB). Peak memory consumption was 967.7MB. Max. memory is 16.1GB. * Witness Printer took 127.10ms. Allocated memory is still 1.8GB. Free memory was 738.3MB in the beginning and 717.3MB in the end (delta: 21.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 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: 45.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1331 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 1592 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1277 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2976 IncrementalHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 315 mSDtfsCounter, 2976 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3977occurred in iteration=14, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1443 ConstructedInterpolants, 0 QuantifiedInterpolants, 9519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:33:15,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_644e7812-c99d-44fa-a5f1-695cd037b812/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE