./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF --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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:48:10,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:48:10,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:48:10,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:48:10,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:48:10,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:48:10,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:48:10,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:48:10,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:48:10,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:48:10,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:48:10,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:48:10,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:48:10,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:48:10,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:48:10,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:48:10,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:48:10,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:48:10,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:48:10,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:48:10,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:48:10,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:48:10,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:48:10,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:48:10,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:48:10,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:48:10,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:48:10,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:48:10,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:48:10,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:48:10,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:48:10,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:48:10,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:48:10,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:48:10,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:48:10,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:48:10,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:48:10,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:48:10,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:48:10,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:48:10,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:48:10,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 05:48:10,372 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:48:10,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:48:10,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:48:10,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:48:10,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:48:10,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:48:10,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:48:10,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:48:10,378 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:48:10,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:48:10,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:48:10,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:48:10,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:48:10,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:48:10,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:48:10,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:48:10,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:48:10,382 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:48:10,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:48:10,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:48:10,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:48:10,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:48:10,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:48:10,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:48:10,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:48:10,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:48:10,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:48:10,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:48:10,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:48:10,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:48:10,389 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 05:48:10,389 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 05:48:10,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:48:10,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:48:10,390 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_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/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_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2021-11-20 05:48:10,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:48:10,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:48:10,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:48:10,785 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:48:10,786 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:48:10,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-20 05:48:10,893 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/data/90022001c/a53b89d3b01849a291d756fbb99eb6be/FLAGd68d05373 [2021-11-20 05:48:11,554 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:48:11,558 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-20 05:48:11,589 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/data/90022001c/a53b89d3b01849a291d756fbb99eb6be/FLAGd68d05373 [2021-11-20 05:48:11,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/data/90022001c/a53b89d3b01849a291d756fbb99eb6be [2021-11-20 05:48:11,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:48:11,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:48:11,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:48:11,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:48:11,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:48:11,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:11" (1/1) ... [2021-11-20 05:48:11,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0b9616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:11, skipping insertion in model container [2021-11-20 05:48:11,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:11" (1/1) ... [2021-11-20 05:48:11,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:48:11,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:48:12,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-20 05:48:12,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-20 05:48:12,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:48:12,218 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:48:12,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-20 05:48:12,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-20 05:48:12,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:48:12,314 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:48:12,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12 WrapperNode [2021-11-20 05:48:12,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:48:12,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:48:12,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:48:12,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:48:12,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,402 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2021-11-20 05:48:12,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:48:12,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:48:12,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:48:12,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:48:12,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:48:12,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:48:12,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:48:12,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:48:12,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (1/1) ... [2021-11-20 05:48:12,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:48:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:12,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:48:12,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:48:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:48:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-20 05:48:12,591 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-20 05:48:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-20 05:48:12,591 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-20 05:48:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-20 05:48:12,592 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-20 05:48:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-20 05:48:12,592 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-20 05:48:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-11-20 05:48:12,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-11-20 05:48:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-20 05:48:12,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-20 05:48:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-20 05:48:12,593 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-20 05:48:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-11-20 05:48:12,594 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-11-20 05:48:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-20 05:48:12,594 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-20 05:48:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-11-20 05:48:12,594 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-11-20 05:48:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-20 05:48:12,595 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-20 05:48:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:48:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-20 05:48:12,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-20 05:48:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-11-20 05:48:12,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-11-20 05:48:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:48:12,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:48:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-20 05:48:12,596 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-20 05:48:12,706 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:48:12,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:48:13,399 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:48:13,420 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:48:13,420 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-20 05:48:13,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:13 BoogieIcfgContainer [2021-11-20 05:48:13,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:48:13,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:48:13,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:48:13,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:48:13,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:48:11" (1/3) ... [2021-11-20 05:48:13,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df55cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:13, skipping insertion in model container [2021-11-20 05:48:13,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:12" (2/3) ... [2021-11-20 05:48:13,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df55cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:13, skipping insertion in model container [2021-11-20 05:48:13,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:13" (3/3) ... [2021-11-20 05:48:13,435 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-20 05:48:13,442 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:48:13,442 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 05:48:13,510 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:48:13,519 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:48:13,519 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-20 05:48:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2021-11-20 05:48:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 05:48:13,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:13,568 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:13,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2021-11-20 05:48:13,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811816150] [2021-11-20 05:48:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:13,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:13,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811816150] [2021-11-20 05:48:13,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811816150] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:13,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:13,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:48:13,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676644870] [2021-11-20 05:48:13,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:13,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:48:13,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:48:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:48:13,994 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:15,153 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2021-11-20 05:48:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 05:48:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 05:48:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:15,193 INFO L225 Difference]: With dead ends: 530 [2021-11-20 05:48:15,193 INFO L226 Difference]: Without dead ends: 329 [2021-11-20 05:48:15,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:48:15,216 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 516 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:15,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 775 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 05:48:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-11-20 05:48:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2021-11-20 05:48:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2021-11-20 05:48:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2021-11-20 05:48:15,396 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2021-11-20 05:48:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:15,396 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2021-11-20 05:48:15,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2021-11-20 05:48:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 05:48:15,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:15,408 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:15,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:48:15,409 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2021-11-20 05:48:15,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570015866] [2021-11-20 05:48:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:15,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:15,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570015866] [2021-11-20 05:48:15,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570015866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:15,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:15,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:15,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063244486] [2021-11-20 05:48:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:15,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:15,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:15,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:15,628 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:16,594 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2021-11-20 05:48:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 05:48:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 05:48:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:16,607 INFO L225 Difference]: With dead ends: 620 [2021-11-20 05:48:16,607 INFO L226 Difference]: Without dead ends: 437 [2021-11-20 05:48:16,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 05:48:16,619 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 493 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:16,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 1059 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 05:48:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-20 05:48:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2021-11-20 05:48:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-11-20 05:48:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2021-11-20 05:48:16,732 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2021-11-20 05:48:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:16,732 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2021-11-20 05:48:16,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2021-11-20 05:48:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 05:48:16,743 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:16,743 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:16,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 05:48:16,744 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2021-11-20 05:48:16,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:16,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143513977] [2021-11-20 05:48:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:16,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:16,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143513977] [2021-11-20 05:48:16,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143513977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:16,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:16,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:16,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713664396] [2021-11-20 05:48:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:16,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:16,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:16,936 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:18,102 INFO L93 Difference]: Finished difference Result 956 states and 1345 transitions. [2021-11-20 05:48:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 05:48:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 05:48:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:18,110 INFO L225 Difference]: With dead ends: 956 [2021-11-20 05:48:18,111 INFO L226 Difference]: Without dead ends: 688 [2021-11-20 05:48:18,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-11-20 05:48:18,114 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 506 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:18,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1060 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 05:48:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-11-20 05:48:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 538. [2021-11-20 05:48:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 428 states have (on average 1.4182242990654206) internal successors, (607), 436 states have internal predecessors, (607), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-11-20 05:48:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 752 transitions. [2021-11-20 05:48:18,207 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 752 transitions. Word has length 57 [2021-11-20 05:48:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:18,207 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 752 transitions. [2021-11-20 05:48:18,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 752 transitions. [2021-11-20 05:48:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 05:48:18,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:18,213 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:18,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 05:48:18,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2021-11-20 05:48:18,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:18,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086699803] [2021-11-20 05:48:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:18,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:18,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086699803] [2021-11-20 05:48:18,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086699803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:18,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:18,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:18,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753062363] [2021-11-20 05:48:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:18,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:18,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:18,421 INFO L87 Difference]: Start difference. First operand 538 states and 752 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:19,235 INFO L93 Difference]: Finished difference Result 1128 states and 1612 transitions. [2021-11-20 05:48:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 05:48:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 05:48:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:19,245 INFO L225 Difference]: With dead ends: 1128 [2021-11-20 05:48:19,245 INFO L226 Difference]: Without dead ends: 696 [2021-11-20 05:48:19,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-20 05:48:19,259 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 268 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:19,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1026 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 05:48:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-20 05:48:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 553. [2021-11-20 05:48:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 443 states have (on average 1.4040632054176072) internal successors, (622), 451 states have internal predecessors, (622), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-11-20 05:48:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 767 transitions. [2021-11-20 05:48:19,322 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 767 transitions. Word has length 57 [2021-11-20 05:48:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:19,323 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 767 transitions. [2021-11-20 05:48:19,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 767 transitions. [2021-11-20 05:48:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 05:48:19,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:19,326 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:19,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:48:19,326 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:19,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2021-11-20 05:48:19,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:19,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762146974] [2021-11-20 05:48:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:19,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:19,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762146974] [2021-11-20 05:48:19,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762146974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:19,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:19,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:19,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379715663] [2021-11-20 05:48:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:19,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:19,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:19,512 INFO L87 Difference]: Start difference. First operand 553 states and 767 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:21,020 INFO L93 Difference]: Finished difference Result 2414 states and 3494 transitions. [2021-11-20 05:48:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 05:48:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 05:48:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:21,039 INFO L225 Difference]: With dead ends: 2414 [2021-11-20 05:48:21,039 INFO L226 Difference]: Without dead ends: 1967 [2021-11-20 05:48:21,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-20 05:48:21,044 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 945 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:21,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 981 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 05:48:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2021-11-20 05:48:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1712. [2021-11-20 05:48:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1359 states have (on average 1.3745401030169242) internal successors, (1868), 1394 states have internal predecessors, (1868), 208 states have call successors, (208), 128 states have call predecessors, (208), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2021-11-20 05:48:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2379 transitions. [2021-11-20 05:48:21,264 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2379 transitions. Word has length 57 [2021-11-20 05:48:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:21,265 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2379 transitions. [2021-11-20 05:48:21,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 05:48:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2379 transitions. [2021-11-20 05:48:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:21,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:21,268 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:21,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 05:48:21,268 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2021-11-20 05:48:21,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:21,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601953536] [2021-11-20 05:48:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:21,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:21,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:21,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601953536] [2021-11-20 05:48:21,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601953536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:21,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:21,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:48:21,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18731793] [2021-11-20 05:48:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:21,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:48:21,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:48:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:21,382 INFO L87 Difference]: Start difference. First operand 1712 states and 2379 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:22,299 INFO L93 Difference]: Finished difference Result 1935 states and 2694 transitions. [2021-11-20 05:48:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 05:48:22,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 05:48:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:22,315 INFO L225 Difference]: With dead ends: 1935 [2021-11-20 05:48:22,315 INFO L226 Difference]: Without dead ends: 1847 [2021-11-20 05:48:22,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-11-20 05:48:22,325 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 411 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:22,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 1058 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 05:48:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-11-20 05:48:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1808. [2021-11-20 05:48:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1435 states have (on average 1.3749128919860627) internal successors, (1973), 1472 states have internal predecessors, (1973), 219 states have call successors, (219), 135 states have call predecessors, (219), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2021-11-20 05:48:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2511 transitions. [2021-11-20 05:48:22,512 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2511 transitions. Word has length 65 [2021-11-20 05:48:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:22,515 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2511 transitions. [2021-11-20 05:48:22,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2511 transitions. [2021-11-20 05:48:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:22,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:22,518 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:22,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 05:48:22,519 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2021-11-20 05:48:22,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:22,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608758334] [2021-11-20 05:48:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:22,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:22,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:22,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608758334] [2021-11-20 05:48:22,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608758334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:22,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:22,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:48:22,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322061582] [2021-11-20 05:48:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:22,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:48:22,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:48:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:22,673 INFO L87 Difference]: Start difference. First operand 1808 states and 2511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:23,641 INFO L93 Difference]: Finished difference Result 2155 states and 2988 transitions. [2021-11-20 05:48:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 05:48:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 05:48:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:23,660 INFO L225 Difference]: With dead ends: 2155 [2021-11-20 05:48:23,660 INFO L226 Difference]: Without dead ends: 1978 [2021-11-20 05:48:23,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-20 05:48:23,668 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 740 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:23,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 1086 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 05:48:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2021-11-20 05:48:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1904. [2021-11-20 05:48:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1511 states have (on average 1.3745863666446063) internal successors, (2077), 1550 states have internal predecessors, (2077), 230 states have call successors, (230), 142 states have call predecessors, (230), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2021-11-20 05:48:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2645 transitions. [2021-11-20 05:48:23,884 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2645 transitions. Word has length 65 [2021-11-20 05:48:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:23,884 INFO L470 AbstractCegarLoop]: Abstraction has 1904 states and 2645 transitions. [2021-11-20 05:48:23,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2645 transitions. [2021-11-20 05:48:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:23,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:23,888 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:23,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 05:48:23,889 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2021-11-20 05:48:23,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413574716] [2021-11-20 05:48:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:23,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:24,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413574716] [2021-11-20 05:48:24,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413574716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:24,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:24,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 05:48:24,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906965359] [2021-11-20 05:48:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:24,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 05:48:24,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 05:48:24,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:48:24,082 INFO L87 Difference]: Start difference. First operand 1904 states and 2645 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:24,956 INFO L93 Difference]: Finished difference Result 2205 states and 3059 transitions. [2021-11-20 05:48:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 05:48:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-11-20 05:48:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:24,975 INFO L225 Difference]: With dead ends: 2205 [2021-11-20 05:48:24,975 INFO L226 Difference]: Without dead ends: 1938 [2021-11-20 05:48:24,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 05:48:24,979 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 210 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:24,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1332 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 05:48:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2021-11-20 05:48:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1909. [2021-11-20 05:48:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1515 states have (on average 1.3722772277227724) internal successors, (2079), 1554 states have internal predecessors, (2079), 230 states have call successors, (230), 142 states have call predecessors, (230), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2021-11-20 05:48:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2648 transitions. [2021-11-20 05:48:25,162 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2648 transitions. Word has length 65 [2021-11-20 05:48:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:25,164 INFO L470 AbstractCegarLoop]: Abstraction has 1909 states and 2648 transitions. [2021-11-20 05:48:25,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2648 transitions. [2021-11-20 05:48:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:25,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:25,172 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:25,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 05:48:25,173 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2021-11-20 05:48:25,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:25,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659371126] [2021-11-20 05:48:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:25,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:25,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:25,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659371126] [2021-11-20 05:48:25,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659371126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:25,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:25,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 05:48:25,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702062473] [2021-11-20 05:48:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:25,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 05:48:25,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 05:48:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:48:25,402 INFO L87 Difference]: Start difference. First operand 1909 states and 2648 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 05:48:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:27,814 INFO L93 Difference]: Finished difference Result 3571 states and 4920 transitions. [2021-11-20 05:48:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 05:48:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-11-20 05:48:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:27,841 INFO L225 Difference]: With dead ends: 3571 [2021-11-20 05:48:27,841 INFO L226 Difference]: Without dead ends: 3299 [2021-11-20 05:48:27,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 05:48:27,846 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 1450 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:27,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1467 Valid, 1411 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 05:48:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-11-20 05:48:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3049. [2021-11-20 05:48:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 2415 states have (on average 1.349896480331263) internal successors, (3260), 2474 states have internal predecessors, (3260), 347 states have call successors, (347), 244 states have call predecessors, (347), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2021-11-20 05:48:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4132 transitions. [2021-11-20 05:48:28,173 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4132 transitions. Word has length 65 [2021-11-20 05:48:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:28,175 INFO L470 AbstractCegarLoop]: Abstraction has 3049 states and 4132 transitions. [2021-11-20 05:48:28,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 05:48:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4132 transitions. [2021-11-20 05:48:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:28,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:28,183 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:28,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 05:48:28,183 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2021-11-20 05:48:28,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:28,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650968522] [2021-11-20 05:48:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:28,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:28,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650968522] [2021-11-20 05:48:28,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650968522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:28,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:28,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 05:48:28,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639135989] [2021-11-20 05:48:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:28,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 05:48:28,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 05:48:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:48:28,349 INFO L87 Difference]: Start difference. First operand 3049 states and 4132 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:29,351 INFO L93 Difference]: Finished difference Result 4650 states and 6256 transitions. [2021-11-20 05:48:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 05:48:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-11-20 05:48:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:29,382 INFO L225 Difference]: With dead ends: 4650 [2021-11-20 05:48:29,382 INFO L226 Difference]: Without dead ends: 3238 [2021-11-20 05:48:29,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-20 05:48:29,389 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 208 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:29,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1325 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 05:48:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2021-11-20 05:48:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3094. [2021-11-20 05:48:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2451 states have (on average 1.3410852713178294) internal successors, (3287), 2510 states have internal predecessors, (3287), 347 states have call successors, (347), 244 states have call predecessors, (347), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2021-11-20 05:48:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4171 transitions. [2021-11-20 05:48:29,722 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4171 transitions. Word has length 65 [2021-11-20 05:48:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:29,722 INFO L470 AbstractCegarLoop]: Abstraction has 3094 states and 4171 transitions. [2021-11-20 05:48:29,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4171 transitions. [2021-11-20 05:48:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:29,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:29,726 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:29,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 05:48:29,727 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2021-11-20 05:48:29,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790037736] [2021-11-20 05:48:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:29,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:29,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:29,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790037736] [2021-11-20 05:48:29,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790037736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:29,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:29,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:48:29,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458863851] [2021-11-20 05:48:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:29,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:48:29,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:48:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:29,861 INFO L87 Difference]: Start difference. First operand 3094 states and 4171 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:31,021 INFO L93 Difference]: Finished difference Result 4529 states and 6010 transitions. [2021-11-20 05:48:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 05:48:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 05:48:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:31,049 INFO L225 Difference]: With dead ends: 4529 [2021-11-20 05:48:31,050 INFO L226 Difference]: Without dead ends: 3292 [2021-11-20 05:48:31,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-11-20 05:48:31,057 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 557 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:31,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 976 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 05:48:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2021-11-20 05:48:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3072. [2021-11-20 05:48:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 2437 states have (on average 1.3389413212966763) internal successors, (3263), 2490 states have internal predecessors, (3263), 347 states have call successors, (347), 244 states have call predecessors, (347), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2021-11-20 05:48:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4131 transitions. [2021-11-20 05:48:31,396 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4131 transitions. Word has length 65 [2021-11-20 05:48:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:31,397 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4131 transitions. [2021-11-20 05:48:31,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4131 transitions. [2021-11-20 05:48:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 05:48:31,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:31,400 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:31,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 05:48:31,400 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2021-11-20 05:48:31,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:31,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395403514] [2021-11-20 05:48:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:31,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:31,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:31,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395403514] [2021-11-20 05:48:31,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395403514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:31,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:31,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:31,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528900731] [2021-11-20 05:48:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:31,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:31,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:31,535 INFO L87 Difference]: Start difference. First operand 3072 states and 4131 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:32,451 INFO L93 Difference]: Finished difference Result 6147 states and 8110 transitions. [2021-11-20 05:48:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 05:48:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 05:48:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:32,502 INFO L225 Difference]: With dead ends: 6147 [2021-11-20 05:48:32,502 INFO L226 Difference]: Without dead ends: 4715 [2021-11-20 05:48:32,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-20 05:48:32,511 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 657 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:32,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 664 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 05:48:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2021-11-20 05:48:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4443. [2021-11-20 05:48:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 3503 states have (on average 1.3074507564944333) internal successors, (4580), 3577 states have internal predecessors, (4580), 499 states have call successors, (499), 367 states have call predecessors, (499), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2021-11-20 05:48:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 5872 transitions. [2021-11-20 05:48:33,001 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 5872 transitions. Word has length 65 [2021-11-20 05:48:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:33,001 INFO L470 AbstractCegarLoop]: Abstraction has 4443 states and 5872 transitions. [2021-11-20 05:48:33,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 05:48:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 5872 transitions. [2021-11-20 05:48:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-20 05:48:33,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:33,007 INFO L514 BasicCegarLoop]: 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] [2021-11-20 05:48:33,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 05:48:33,008 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:33,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2021-11-20 05:48:33,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:33,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532339696] [2021-11-20 05:48:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:33,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:33,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:33,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532339696] [2021-11-20 05:48:33,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532339696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:33,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:33,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:48:33,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358983362] [2021-11-20 05:48:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:33,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:48:33,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:48:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:48:33,112 INFO L87 Difference]: Start difference. First operand 4443 states and 5872 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:34,100 INFO L93 Difference]: Finished difference Result 9461 states and 12386 transitions. [2021-11-20 05:48:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 05:48:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-11-20 05:48:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:34,175 INFO L225 Difference]: With dead ends: 9461 [2021-11-20 05:48:34,175 INFO L226 Difference]: Without dead ends: 6637 [2021-11-20 05:48:34,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:48:34,189 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 379 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:34,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 798 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 05:48:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2021-11-20 05:48:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6121. [2021-11-20 05:48:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 4788 states have (on average 1.2907268170426065) internal successors, (6180), 4869 states have internal predecessors, (6180), 693 states have call successors, (693), 541 states have call predecessors, (693), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2021-11-20 05:48:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 7987 transitions. [2021-11-20 05:48:34,805 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 7987 transitions. Word has length 66 [2021-11-20 05:48:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:34,807 INFO L470 AbstractCegarLoop]: Abstraction has 6121 states and 7987 transitions. [2021-11-20 05:48:34,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 05:48:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 7987 transitions. [2021-11-20 05:48:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-20 05:48:34,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:34,812 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:34,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 05:48:34,813 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2021-11-20 05:48:34,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:34,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291965176] [2021-11-20 05:48:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:34,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:34,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:34,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291965176] [2021-11-20 05:48:34,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291965176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:34,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:34,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:48:34,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788483906] [2021-11-20 05:48:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:34,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:48:34,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:48:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:48:34,904 INFO L87 Difference]: Start difference. First operand 6121 states and 7987 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-20 05:48:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:36,071 INFO L93 Difference]: Finished difference Result 7751 states and 9989 transitions. [2021-11-20 05:48:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 05:48:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-11-20 05:48:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:36,114 INFO L225 Difference]: With dead ends: 7751 [2021-11-20 05:48:36,114 INFO L226 Difference]: Without dead ends: 7748 [2021-11-20 05:48:36,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-20 05:48:36,122 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 791 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:36,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 684 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 05:48:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2021-11-20 05:48:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 7175. [2021-11-20 05:48:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7175 states, 5591 states have (on average 1.2788409944553747) internal successors, (7150), 5681 states have internal predecessors, (7150), 819 states have call successors, (819), 655 states have call predecessors, (819), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2021-11-20 05:48:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 9276 transitions. [2021-11-20 05:48:36,879 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 9276 transitions. Word has length 73 [2021-11-20 05:48:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:36,880 INFO L470 AbstractCegarLoop]: Abstraction has 7175 states and 9276 transitions. [2021-11-20 05:48:36,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-20 05:48:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 9276 transitions. [2021-11-20 05:48:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-20 05:48:36,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:36,885 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:36,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 05:48:36,886 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2021-11-20 05:48:36,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:36,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297102734] [2021-11-20 05:48:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:36,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:37,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:37,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297102734] [2021-11-20 05:48:37,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297102734] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:48:37,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021133872] [2021-11-20 05:48:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:37,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:37,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:48:37,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 05:48:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:37,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 05:48:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:48:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:37,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:48:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:38,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021133872] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:48:38,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:48:38,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-11-20 05:48:38,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174908347] [2021-11-20 05:48:38,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:48:38,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 05:48:38,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:38,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 05:48:38,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:48:38,149 INFO L87 Difference]: Start difference. First operand 7175 states and 9276 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-20 05:48:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:40,662 INFO L93 Difference]: Finished difference Result 14821 states and 18804 transitions. [2021-11-20 05:48:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 05:48:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-11-20 05:48:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:40,738 INFO L225 Difference]: With dead ends: 14821 [2021-11-20 05:48:40,738 INFO L226 Difference]: Without dead ends: 14818 [2021-11-20 05:48:40,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-11-20 05:48:40,749 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1185 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:40,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1537 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 05:48:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2021-11-20 05:48:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 12433. [2021-11-20 05:48:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12433 states, 9683 states have (on average 1.2660332541567696) internal successors, (12259), 9825 states have internal predecessors, (12259), 1385 states have call successors, (1385), 1145 states have call predecessors, (1385), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2021-11-20 05:48:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12433 states to 12433 states and 15890 transitions. [2021-11-20 05:48:41,780 INFO L78 Accepts]: Start accepts. Automaton has 12433 states and 15890 transitions. Word has length 74 [2021-11-20 05:48:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:41,781 INFO L470 AbstractCegarLoop]: Abstraction has 12433 states and 15890 transitions. [2021-11-20 05:48:41,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-20 05:48:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 12433 states and 15890 transitions. [2021-11-20 05:48:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-20 05:48:41,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:41,786 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:41,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:48:42,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 05:48:42,001 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2021-11-20 05:48:42,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:42,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100760759] [2021-11-20 05:48:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:42,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:48:42,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:42,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100760759] [2021-11-20 05:48:42,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100760759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:42,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:42,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:48:42,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639509052] [2021-11-20 05:48:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:42,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:48:42,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:48:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:48:42,079 INFO L87 Difference]: Start difference. First operand 12433 states and 15890 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-20 05:48:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:43,124 INFO L93 Difference]: Finished difference Result 18976 states and 24232 transitions. [2021-11-20 05:48:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 05:48:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-11-20 05:48:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:43,162 INFO L225 Difference]: With dead ends: 18976 [2021-11-20 05:48:43,162 INFO L226 Difference]: Without dead ends: 9038 [2021-11-20 05:48:43,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:48:43,194 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 527 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:43,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 662 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 05:48:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9038 states. [2021-11-20 05:48:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9038 to 8486. [2021-11-20 05:48:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 6630 states have (on average 1.251734539969834) internal successors, (8299), 6728 states have internal predecessors, (8299), 952 states have call successors, (952), 769 states have call predecessors, (952), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2021-11-20 05:48:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 10716 transitions. [2021-11-20 05:48:43,897 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 10716 transitions. Word has length 77 [2021-11-20 05:48:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:43,898 INFO L470 AbstractCegarLoop]: Abstraction has 8486 states and 10716 transitions. [2021-11-20 05:48:43,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-20 05:48:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 10716 transitions. [2021-11-20 05:48:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-20 05:48:43,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:43,904 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:43,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 05:48:43,905 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2021-11-20 05:48:43,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:43,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972459282] [2021-11-20 05:48:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:43,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 05:48:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 05:48:43,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972459282] [2021-11-20 05:48:43,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972459282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:43,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:43,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:48:43,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546170372] [2021-11-20 05:48:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:43,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:48:43,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:48:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:44,000 INFO L87 Difference]: Start difference. First operand 8486 states and 10716 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 05:48:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:45,965 INFO L93 Difference]: Finished difference Result 22360 states and 27933 transitions. [2021-11-20 05:48:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 05:48:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-11-20 05:48:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:46,053 INFO L225 Difference]: With dead ends: 22360 [2021-11-20 05:48:46,053 INFO L226 Difference]: Without dead ends: 15517 [2021-11-20 05:48:46,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-11-20 05:48:46,084 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 768 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:46,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 1067 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 05:48:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15517 states. [2021-11-20 05:48:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15517 to 14658. [2021-11-20 05:48:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14658 states, 11306 states have (on average 1.2193525561648682) internal successors, (13786), 11510 states have internal predecessors, (13786), 1668 states have call successors, (1668), 1373 states have call predecessors, (1668), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2021-11-20 05:48:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14658 states to 14658 states and 18322 transitions. [2021-11-20 05:48:47,232 INFO L78 Accepts]: Start accepts. Automaton has 14658 states and 18322 transitions. Word has length 84 [2021-11-20 05:48:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:47,233 INFO L470 AbstractCegarLoop]: Abstraction has 14658 states and 18322 transitions. [2021-11-20 05:48:47,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 05:48:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 14658 states and 18322 transitions. [2021-11-20 05:48:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-20 05:48:47,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:47,244 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:47,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 05:48:47,245 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2021-11-20 05:48:47,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:47,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039504087] [2021-11-20 05:48:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:47,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 05:48:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 05:48:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 05:48:47,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039504087] [2021-11-20 05:48:47,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039504087] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:48:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226658389] [2021-11-20 05:48:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:47,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:47,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:47,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:48:47,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 05:48:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:47,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:48:47,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:48:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 05:48:47,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:48:47,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226658389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:47,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:48:47,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 05:48:47,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224188752] [2021-11-20 05:48:47,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:47,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:48:47,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:47,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:48:47,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:47,634 INFO L87 Difference]: Start difference. First operand 14658 states and 18322 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:48:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:48,530 INFO L93 Difference]: Finished difference Result 17700 states and 22591 transitions. [2021-11-20 05:48:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:48:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2021-11-20 05:48:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:48,605 INFO L225 Difference]: With dead ends: 17700 [2021-11-20 05:48:48,606 INFO L226 Difference]: Without dead ends: 15051 [2021-11-20 05:48:48,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:48,624 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 114 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:48,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 652 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:48:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2021-11-20 05:48:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 15051. [2021-11-20 05:48:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15051 states, 11625 states have (on average 1.2227096774193549) internal successors, (14214), 11833 states have internal predecessors, (14214), 1710 states have call successors, (1710), 1401 states have call predecessors, (1710), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2021-11-20 05:48:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 18856 transitions. [2021-11-20 05:48:49,762 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 18856 transitions. Word has length 92 [2021-11-20 05:48:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:49,762 INFO L470 AbstractCegarLoop]: Abstraction has 15051 states and 18856 transitions. [2021-11-20 05:48:49,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:48:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 18856 transitions. [2021-11-20 05:48:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-20 05:48:49,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:49,775 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:49,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:48:50,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 05:48:50,001 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2021-11-20 05:48:50,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:50,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160416699] [2021-11-20 05:48:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:50,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:48:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:48:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:48:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:48:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:48:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:48:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-20 05:48:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 05:48:50,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:50,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160416699] [2021-11-20 05:48:50,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160416699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:50,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:48:50,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 05:48:50,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186118908] [2021-11-20 05:48:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:50,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 05:48:50,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:50,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 05:48:50,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:48:50,112 INFO L87 Difference]: Start difference. First operand 15051 states and 18856 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 05:48:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:52,421 INFO L93 Difference]: Finished difference Result 25925 states and 32175 transitions. [2021-11-20 05:48:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 05:48:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2021-11-20 05:48:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:52,494 INFO L225 Difference]: With dead ends: 25925 [2021-11-20 05:48:52,495 INFO L226 Difference]: Without dead ends: 13526 [2021-11-20 05:48:52,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-11-20 05:48:52,543 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1326 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:52,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1361 Valid, 1082 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 05:48:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13526 states. [2021-11-20 05:48:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13526 to 12626. [2021-11-20 05:48:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12626 states, 9791 states have (on average 1.2179552650393217) internal successors, (11925), 9966 states have internal predecessors, (11925), 1411 states have call successors, (1411), 1150 states have call predecessors, (1411), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2021-11-20 05:48:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12626 states to 12626 states and 15600 transitions. [2021-11-20 05:48:53,636 INFO L78 Accepts]: Start accepts. Automaton has 12626 states and 15600 transitions. Word has length 93 [2021-11-20 05:48:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:53,636 INFO L470 AbstractCegarLoop]: Abstraction has 12626 states and 15600 transitions. [2021-11-20 05:48:53,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-20 05:48:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 12626 states and 15600 transitions. [2021-11-20 05:48:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-20 05:48:53,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:53,656 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:53,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-20 05:48:53,657 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2021-11-20 05:48:53,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:53,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939304800] [2021-11-20 05:48:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:53,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 05:48:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-20 05:48:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 05:48:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-20 05:48:53,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939304800] [2021-11-20 05:48:53,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939304800] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:48:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160044919] [2021-11-20 05:48:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:53,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:53,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:48:53,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 05:48:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:53,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:48:53,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:48:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 05:48:54,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:48:54,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160044919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:54,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:48:54,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-11-20 05:48:54,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167685459] [2021-11-20 05:48:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:54,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:48:54,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:48:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:54,265 INFO L87 Difference]: Start difference. First operand 12626 states and 15600 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 05:48:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:55,079 INFO L93 Difference]: Finished difference Result 15426 states and 19539 transitions. [2021-11-20 05:48:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:48:55,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2021-11-20 05:48:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:55,136 INFO L225 Difference]: With dead ends: 15426 [2021-11-20 05:48:55,136 INFO L226 Difference]: Without dead ends: 13808 [2021-11-20 05:48:55,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:55,152 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 197 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:55,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 408 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:48:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2021-11-20 05:48:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 13766. [2021-11-20 05:48:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13766 states, 10706 states have (on average 1.2296842891836353) internal successors, (13165), 10898 states have internal predecessors, (13165), 1539 states have call successors, (1539), 1235 states have call predecessors, (1539), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2021-11-20 05:48:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13766 states to 13766 states and 17148 transitions. [2021-11-20 05:48:56,429 INFO L78 Accepts]: Start accepts. Automaton has 13766 states and 17148 transitions. Word has length 118 [2021-11-20 05:48:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:56,430 INFO L470 AbstractCegarLoop]: Abstraction has 13766 states and 17148 transitions. [2021-11-20 05:48:56,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 05:48:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13766 states and 17148 transitions. [2021-11-20 05:48:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-20 05:48:56,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:56,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:56,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 05:48:56,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:56,677 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2021-11-20 05:48:56,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:56,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85753127] [2021-11-20 05:48:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:56,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 05:48:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 05:48:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-20 05:48:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-20 05:48:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-20 05:48:56,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:56,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85753127] [2021-11-20 05:48:56,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85753127] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:48:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759183019] [2021-11-20 05:48:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:56,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:56,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:48:56,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 05:48:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:56,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:48:56,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:48:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 05:48:57,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:48:57,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759183019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:48:57,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:48:57,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 05:48:57,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060443647] [2021-11-20 05:48:57,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:48:57,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:48:57,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:48:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:48:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:57,319 INFO L87 Difference]: Start difference. First operand 13766 states and 17148 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 05:48:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:48:58,177 INFO L93 Difference]: Finished difference Result 17400 states and 22224 transitions. [2021-11-20 05:48:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:48:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2021-11-20 05:48:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:48:58,225 INFO L225 Difference]: With dead ends: 17400 [2021-11-20 05:48:58,225 INFO L226 Difference]: Without dead ends: 14260 [2021-11-20 05:48:58,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:48:58,241 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 248 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:48:58,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 295 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:48:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2021-11-20 05:48:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 14150. [2021-11-20 05:48:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 11065 states have (on average 1.215634884771803) internal successors, (13451), 11252 states have internal predecessors, (13451), 1535 states have call successors, (1535), 1261 states have call predecessors, (1535), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-11-20 05:48:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 17412 transitions. [2021-11-20 05:48:59,456 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 17412 transitions. Word has length 134 [2021-11-20 05:48:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:48:59,457 INFO L470 AbstractCegarLoop]: Abstraction has 14150 states and 17412 transitions. [2021-11-20 05:48:59,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 05:48:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 17412 transitions. [2021-11-20 05:48:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-20 05:48:59,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:48:59,476 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:48:59,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-20 05:48:59,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-20 05:48:59,689 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:48:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:48:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2021-11-20 05:48:59,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:48:59,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572610850] [2021-11-20 05:48:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:59,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:48:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:48:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:48:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:48:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:48:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:48:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 05:48:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 05:48:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-20 05:48:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:48:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-20 05:48:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-20 05:48:59,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:48:59,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572610850] [2021-11-20 05:48:59,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572610850] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:48:59,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951684181] [2021-11-20 05:48:59,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:48:59,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:48:59,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:48:59,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:48:59,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 05:48:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:48:59,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 05:48:59,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 05:49:00,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:00,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951684181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:00,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:00,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 05:49:00,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348236421] [2021-11-20 05:49:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:00,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:49:00,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:49:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:00,268 INFO L87 Difference]: Start difference. First operand 14150 states and 17412 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 05:49:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:01,408 INFO L93 Difference]: Finished difference Result 17757 states and 22151 transitions. [2021-11-20 05:49:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:49:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2021-11-20 05:49:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:01,454 INFO L225 Difference]: With dead ends: 17757 [2021-11-20 05:49:01,455 INFO L226 Difference]: Without dead ends: 14235 [2021-11-20 05:49:01,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:01,471 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 248 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:01,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14235 states. [2021-11-20 05:49:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14235 to 14120. [2021-11-20 05:49:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14120 states, 11035 states have (on average 1.2080652469415496) internal successors, (13331), 11222 states have internal predecessors, (13331), 1535 states have call successors, (1535), 1261 states have call predecessors, (1535), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-11-20 05:49:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14120 states to 14120 states and 17292 transitions. [2021-11-20 05:49:02,798 INFO L78 Accepts]: Start accepts. Automaton has 14120 states and 17292 transitions. Word has length 134 [2021-11-20 05:49:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:02,799 INFO L470 AbstractCegarLoop]: Abstraction has 14120 states and 17292 transitions. [2021-11-20 05:49:02,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 05:49:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14120 states and 17292 transitions. [2021-11-20 05:49:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-20 05:49:02,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:02,820 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:02,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:03,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 05:49:03,028 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2021-11-20 05:49:03,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:03,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634412125] [2021-11-20 05:49:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:03,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-20 05:49:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-20 05:49:03,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634412125] [2021-11-20 05:49:03,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634412125] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229143507] [2021-11-20 05:49:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:03,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:03,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:03,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 05:49:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:03,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 05:49:03,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 05:49:03,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:03,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229143507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:03,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:03,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 05:49:03,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509193138] [2021-11-20 05:49:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:03,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:49:03,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:49:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:03,576 INFO L87 Difference]: Start difference. First operand 14120 states and 17292 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-20 05:49:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:04,522 INFO L93 Difference]: Finished difference Result 15596 states and 19282 transitions. [2021-11-20 05:49:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:49:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2021-11-20 05:49:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:04,567 INFO L225 Difference]: With dead ends: 15596 [2021-11-20 05:49:04,567 INFO L226 Difference]: Without dead ends: 13839 [2021-11-20 05:49:04,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:04,577 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 76 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:04,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 626 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2021-11-20 05:49:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13777. [2021-11-20 05:49:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 10760 states have (on average 1.2018587360594795) internal successors, (12932), 10943 states have internal predecessors, (12932), 1499 states have call successors, (1499), 1236 states have call predecessors, (1499), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2021-11-20 05:49:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 16793 transitions. [2021-11-20 05:49:05,812 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 16793 transitions. Word has length 135 [2021-11-20 05:49:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:05,812 INFO L470 AbstractCegarLoop]: Abstraction has 13777 states and 16793 transitions. [2021-11-20 05:49:05,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-20 05:49:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 16793 transitions. [2021-11-20 05:49:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 05:49:05,826 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:05,826 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:05,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:06,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-20 05:49:06,026 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2021-11-20 05:49:06,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:06,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713294143] [2021-11-20 05:49:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:06,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 05:49:06,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713294143] [2021-11-20 05:49:06,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713294143] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:06,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70173511] [2021-11-20 05:49:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:06,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:06,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:06,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:06,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 05:49:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:06,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 05:49:06,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 05:49:06,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:06,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70173511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:06,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:06,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-20 05:49:06,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210894352] [2021-11-20 05:49:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:06,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:49:06,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:49:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:49:06,587 INFO L87 Difference]: Start difference. First operand 13777 states and 16793 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:07,746 INFO L93 Difference]: Finished difference Result 15113 states and 18526 transitions. [2021-11-20 05:49:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:49:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 05:49:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:07,779 INFO L225 Difference]: With dead ends: 15113 [2021-11-20 05:49:07,779 INFO L226 Difference]: Without dead ends: 13155 [2021-11-20 05:49:07,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:49:07,786 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 302 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:07,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 480 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 05:49:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13155 states. [2021-11-20 05:49:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13155 to 13134. [2021-11-20 05:49:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13134 states, 10235 states have (on average 1.1930630190522715) internal successors, (12211), 10401 states have internal predecessors, (12211), 1440 states have call successors, (1440), 1191 states have call predecessors, (1440), 1457 states have return successors, (2244), 1552 states have call predecessors, (2244), 1439 states have call successors, (2244) [2021-11-20 05:49:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13134 states to 13134 states and 15895 transitions. [2021-11-20 05:49:08,834 INFO L78 Accepts]: Start accepts. Automaton has 13134 states and 15895 transitions. Word has length 136 [2021-11-20 05:49:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:08,834 INFO L470 AbstractCegarLoop]: Abstraction has 13134 states and 15895 transitions. [2021-11-20 05:49:08,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13134 states and 15895 transitions. [2021-11-20 05:49:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 05:49:08,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:08,852 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:08,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:09,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:09,077 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2021-11-20 05:49:09,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:09,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027519032] [2021-11-20 05:49:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:09,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 05:49:09,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027519032] [2021-11-20 05:49:09,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027519032] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715566491] [2021-11-20 05:49:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:09,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:09,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:09,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 05:49:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:09,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 05:49:09,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 05:49:09,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:09,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715566491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:09,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:09,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-20 05:49:09,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100749316] [2021-11-20 05:49:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:09,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:49:09,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:49:09,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:49:09,662 INFO L87 Difference]: Start difference. First operand 13134 states and 15895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:10,880 INFO L93 Difference]: Finished difference Result 14753 states and 17891 transitions. [2021-11-20 05:49:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:49:10,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 05:49:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:10,915 INFO L225 Difference]: With dead ends: 14753 [2021-11-20 05:49:10,916 INFO L226 Difference]: Without dead ends: 12328 [2021-11-20 05:49:10,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-20 05:49:10,923 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 321 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:10,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 488 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 05:49:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2021-11-20 05:49:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 11814. [2021-11-20 05:49:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11814 states, 9169 states have (on average 1.185189224561021) internal successors, (10867), 9319 states have internal predecessors, (10867), 1294 states have call successors, (1294), 1088 states have call predecessors, (1294), 1349 states have return successors, (2052), 1416 states have call predecessors, (2052), 1293 states have call successors, (2052) [2021-11-20 05:49:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11814 states to 11814 states and 14213 transitions. [2021-11-20 05:49:11,663 INFO L78 Accepts]: Start accepts. Automaton has 11814 states and 14213 transitions. Word has length 136 [2021-11-20 05:49:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:11,664 INFO L470 AbstractCegarLoop]: Abstraction has 11814 states and 14213 transitions. [2021-11-20 05:49:11,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 11814 states and 14213 transitions. [2021-11-20 05:49:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 05:49:11,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:11,672 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:11,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:11,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 05:49:11,874 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2021-11-20 05:49:11,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:11,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298672414] [2021-11-20 05:49:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:11,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 05:49:11,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:11,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298672414] [2021-11-20 05:49:11,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298672414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072905919] [2021-11-20 05:49:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:11,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:11,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:11,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 05:49:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:12,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 05:49:12,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-20 05:49:12,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:12,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072905919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:12,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:12,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-11-20 05:49:12,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640070876] [2021-11-20 05:49:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:12,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:49:12,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:49:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:49:12,310 INFO L87 Difference]: Start difference. First operand 11814 states and 14213 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:13,178 INFO L93 Difference]: Finished difference Result 13036 states and 15700 transitions. [2021-11-20 05:49:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:49:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 05:49:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:13,205 INFO L225 Difference]: With dead ends: 13036 [2021-11-20 05:49:13,205 INFO L226 Difference]: Without dead ends: 11849 [2021-11-20 05:49:13,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-20 05:49:13,211 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:13,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2021-11-20 05:49:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11829. [2021-11-20 05:49:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11829 states, 9184 states have (on average 1.1824912891986064) internal successors, (10860), 9334 states have internal predecessors, (10860), 1294 states have call successors, (1294), 1088 states have call predecessors, (1294), 1349 states have return successors, (2052), 1416 states have call predecessors, (2052), 1293 states have call successors, (2052) [2021-11-20 05:49:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 14206 transitions. [2021-11-20 05:49:14,063 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 14206 transitions. Word has length 136 [2021-11-20 05:49:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:14,063 INFO L470 AbstractCegarLoop]: Abstraction has 11829 states and 14206 transitions. [2021-11-20 05:49:14,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 05:49:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 14206 transitions. [2021-11-20 05:49:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 05:49:14,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:14,075 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:14,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:14,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:14,277 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2021-11-20 05:49:14,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:14,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366424379] [2021-11-20 05:49:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:14,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-20 05:49:14,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:14,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366424379] [2021-11-20 05:49:14,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366424379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:14,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:14,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:14,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563797812] [2021-11-20 05:49:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:14,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:14,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:14,420 INFO L87 Difference]: Start difference. First operand 11829 states and 14206 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-20 05:49:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:15,641 INFO L93 Difference]: Finished difference Result 12808 states and 15307 transitions. [2021-11-20 05:49:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 05:49:15,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-11-20 05:49:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:15,673 INFO L225 Difference]: With dead ends: 12808 [2021-11-20 05:49:15,674 INFO L226 Difference]: Without dead ends: 12806 [2021-11-20 05:49:15,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-20 05:49:15,678 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 690 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:15,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 788 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 05:49:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12806 states. [2021-11-20 05:49:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12806 to 12533. [2021-11-20 05:49:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12533 states, 9764 states have (on average 1.1788201556739042) internal successors, (11510), 9920 states have internal predecessors, (11510), 1362 states have call successors, (1362), 1136 states have call predecessors, (1362), 1405 states have return successors, (2131), 1486 states have call predecessors, (2131), 1361 states have call successors, (2131) [2021-11-20 05:49:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 15003 transitions. [2021-11-20 05:49:16,602 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 15003 transitions. Word has length 136 [2021-11-20 05:49:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:16,602 INFO L470 AbstractCegarLoop]: Abstraction has 12533 states and 15003 transitions. [2021-11-20 05:49:16,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-20 05:49:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 15003 transitions. [2021-11-20 05:49:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-20 05:49:16,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:16,611 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:16,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-20 05:49:16,611 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:16,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2021-11-20 05:49:16,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:16,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126675511] [2021-11-20 05:49:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:16,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:49:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:49:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:49:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:49:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 05:49:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 05:49:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-20 05:49:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-20 05:49:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-20 05:49:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-20 05:49:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-20 05:49:16,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:16,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126675511] [2021-11-20 05:49:16,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126675511] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388979453] [2021-11-20 05:49:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:16,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:16,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:16,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:16,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 05:49:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 05:49:16,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 05:49:17,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:17,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388979453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:17,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:17,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-11-20 05:49:17,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493227761] [2021-11-20 05:49:17,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:17,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:17,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-20 05:49:17,190 INFO L87 Difference]: Start difference. First operand 12533 states and 15003 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 05:49:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:17,811 INFO L93 Difference]: Finished difference Result 17681 states and 21223 transitions. [2021-11-20 05:49:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:49:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-11-20 05:49:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:17,833 INFO L225 Difference]: With dead ends: 17681 [2021-11-20 05:49:17,833 INFO L226 Difference]: Without dead ends: 7099 [2021-11-20 05:49:17,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-20 05:49:17,850 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:17,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1283 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2021-11-20 05:49:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 6657. [2021-11-20 05:49:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 5329 states have (on average 1.1589416400825672) internal successors, (6176), 5383 states have internal predecessors, (6176), 664 states have call successors, (664), 530 states have call predecessors, (664), 662 states have return successors, (971), 744 states have call predecessors, (971), 663 states have call successors, (971) [2021-11-20 05:49:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 7811 transitions. [2021-11-20 05:49:18,511 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 7811 transitions. Word has length 145 [2021-11-20 05:49:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:18,512 INFO L470 AbstractCegarLoop]: Abstraction has 6657 states and 7811 transitions. [2021-11-20 05:49:18,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 05:49:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 7811 transitions. [2021-11-20 05:49:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-20 05:49:18,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:18,518 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:18,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:18,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-20 05:49:18,719 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2021-11-20 05:49:18,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269999395] [2021-11-20 05:49:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:18,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:49:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:49:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:49:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:49:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 05:49:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-20 05:49:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-20 05:49:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-20 05:49:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-20 05:49:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-20 05:49:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-20 05:49:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-20 05:49:18,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:18,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269999395] [2021-11-20 05:49:18,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269999395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:18,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:18,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:18,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545524052] [2021-11-20 05:49:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:18,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:18,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:18,835 INFO L87 Difference]: Start difference. First operand 6657 states and 7811 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-20 05:49:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:19,477 INFO L93 Difference]: Finished difference Result 7205 states and 8429 transitions. [2021-11-20 05:49:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:49:19,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2021-11-20 05:49:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:19,490 INFO L225 Difference]: With dead ends: 7205 [2021-11-20 05:49:19,491 INFO L226 Difference]: Without dead ends: 6456 [2021-11-20 05:49:19,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:49:19,494 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 388 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:19,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 551 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 05:49:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2021-11-20 05:49:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 6232. [2021-11-20 05:49:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 5000 states have (on average 1.1592) internal successors, (5796), 5051 states have internal predecessors, (5796), 618 states have call successors, (618), 490 states have call predecessors, (618), 612 states have return successors, (907), 691 states have call predecessors, (907), 617 states have call successors, (907) [2021-11-20 05:49:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 7321 transitions. [2021-11-20 05:49:19,868 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 7321 transitions. Word has length 147 [2021-11-20 05:49:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:19,868 INFO L470 AbstractCegarLoop]: Abstraction has 6232 states and 7321 transitions. [2021-11-20 05:49:19,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-20 05:49:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 7321 transitions. [2021-11-20 05:49:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-20 05:49:19,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:19,874 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:19,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-20 05:49:19,874 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2021-11-20 05:49:19,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:19,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689952580] [2021-11-20 05:49:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:19,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 05:49:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-20 05:49:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 05:49:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-20 05:49:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-20 05:49:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-20 05:49:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 05:49:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-20 05:49:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-20 05:49:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-20 05:49:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-20 05:49:19,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689952580] [2021-11-20 05:49:19,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689952580] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221057085] [2021-11-20 05:49:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:19,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:19,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:20,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 05:49:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:20,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 05:49:20,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 05:49:20,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:20,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221057085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:20,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:20,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 05:49:20,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146354406] [2021-11-20 05:49:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:20,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:49:20,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:49:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:20,487 INFO L87 Difference]: Start difference. First operand 6232 states and 7321 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 05:49:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:21,002 INFO L93 Difference]: Finished difference Result 8068 states and 9481 transitions. [2021-11-20 05:49:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:49:21,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2021-11-20 05:49:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:21,012 INFO L225 Difference]: With dead ends: 8068 [2021-11-20 05:49:21,012 INFO L226 Difference]: Without dead ends: 4028 [2021-11-20 05:49:21,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:21,020 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:21,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2021-11-20 05:49:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4028. [2021-11-20 05:49:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 3266 states have (on average 1.144213104715248) internal successors, (3737), 3301 states have internal predecessors, (3737), 389 states have call successors, (389), 302 states have call predecessors, (389), 371 states have return successors, (525), 425 states have call predecessors, (525), 388 states have call successors, (525) [2021-11-20 05:49:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 4651 transitions. [2021-11-20 05:49:21,330 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 4651 transitions. Word has length 158 [2021-11-20 05:49:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:21,330 INFO L470 AbstractCegarLoop]: Abstraction has 4028 states and 4651 transitions. [2021-11-20 05:49:21,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-20 05:49:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 4651 transitions. [2021-11-20 05:49:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-20 05:49:21,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:21,337 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:21,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:21,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:21,538 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2021-11-20 05:49:21,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583763021] [2021-11-20 05:49:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:21,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:49:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:49:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:49:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:49:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-20 05:49:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-20 05:49:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-20 05:49:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 05:49:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-20 05:49:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-20 05:49:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-20 05:49:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-20 05:49:21,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583763021] [2021-11-20 05:49:21,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583763021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:21,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:21,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:49:21,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663979204] [2021-11-20 05:49:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:21,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:49:21,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:49:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:49:21,673 INFO L87 Difference]: Start difference. First operand 4028 states and 4651 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-20 05:49:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:22,509 INFO L93 Difference]: Finished difference Result 5892 states and 6861 transitions. [2021-11-20 05:49:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 05:49:22,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2021-11-20 05:49:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:22,518 INFO L225 Difference]: With dead ends: 5892 [2021-11-20 05:49:22,518 INFO L226 Difference]: Without dead ends: 4131 [2021-11-20 05:49:22,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:49:22,524 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 223 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:22,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 961 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 05:49:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2021-11-20 05:49:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 3587. [2021-11-20 05:49:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2917 states have (on average 1.1450119986287282) internal successors, (3340), 2951 states have internal predecessors, (3340), 345 states have call successors, (345), 266 states have call predecessors, (345), 323 states have return successors, (457), 370 states have call predecessors, (457), 344 states have call successors, (457) [2021-11-20 05:49:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4142 transitions. [2021-11-20 05:49:22,812 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4142 transitions. Word has length 159 [2021-11-20 05:49:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:22,813 INFO L470 AbstractCegarLoop]: Abstraction has 3587 states and 4142 transitions. [2021-11-20 05:49:22,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-20 05:49:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4142 transitions. [2021-11-20 05:49:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-20 05:49:22,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:22,816 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:22,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-20 05:49:22,817 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2021-11-20 05:49:22,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:22,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115766948] [2021-11-20 05:49:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:22,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:49:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:49:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:49:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:49:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-20 05:49:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-20 05:49:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 05:49:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-20 05:49:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-20 05:49:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-20 05:49:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-20 05:49:22,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:22,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115766948] [2021-11-20 05:49:22,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115766948] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:22,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057137580] [2021-11-20 05:49:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:22,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:22,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:22,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 05:49:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 05:49:23,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 05:49:23,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:49:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-20 05:49:24,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057137580] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:49:24,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:49:24,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-11-20 05:49:24,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947943409] [2021-11-20 05:49:24,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:49:24,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 05:49:24,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 05:49:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-20 05:49:24,168 INFO L87 Difference]: Start difference. First operand 3587 states and 4142 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-11-20 05:49:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:25,617 INFO L93 Difference]: Finished difference Result 5622 states and 6620 transitions. [2021-11-20 05:49:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 05:49:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2021-11-20 05:49:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:25,627 INFO L225 Difference]: With dead ends: 5622 [2021-11-20 05:49:25,627 INFO L226 Difference]: Without dead ends: 3874 [2021-11-20 05:49:25,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2021-11-20 05:49:25,634 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1336 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:25,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 788 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 05:49:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2021-11-20 05:49:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3674. [2021-11-20 05:49:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 2962 states have (on average 1.1323430114787305) internal successors, (3354), 3001 states have internal predecessors, (3354), 367 states have call successors, (367), 290 states have call predecessors, (367), 343 states have return successors, (508), 383 states have call predecessors, (508), 366 states have call successors, (508) [2021-11-20 05:49:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4229 transitions. [2021-11-20 05:49:25,937 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4229 transitions. Word has length 162 [2021-11-20 05:49:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:25,937 INFO L470 AbstractCegarLoop]: Abstraction has 3674 states and 4229 transitions. [2021-11-20 05:49:25,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-11-20 05:49:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4229 transitions. [2021-11-20 05:49:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-20 05:49:25,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:25,942 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:25,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:26,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-20 05:49:26,143 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2021-11-20 05:49:26,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707377761] [2021-11-20 05:49:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:26,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 05:49:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 05:49:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 05:49:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 05:49:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 05:49:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-20 05:49:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 05:49:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 05:49:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-11-20 05:49:26,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:26,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707377761] [2021-11-20 05:49:26,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707377761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:26,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:26,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:26,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567268090] [2021-11-20 05:49:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:26,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:26,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:26,288 INFO L87 Difference]: Start difference. First operand 3674 states and 4229 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 05:49:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:27,163 INFO L93 Difference]: Finished difference Result 5637 states and 6478 transitions. [2021-11-20 05:49:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 05:49:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2021-11-20 05:49:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:27,167 INFO L225 Difference]: With dead ends: 5637 [2021-11-20 05:49:27,167 INFO L226 Difference]: Without dead ends: 1760 [2021-11-20 05:49:27,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-20 05:49:27,174 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 796 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:27,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 714 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 05:49:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2021-11-20 05:49:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2021-11-20 05:49:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2021-11-20 05:49:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2021-11-20 05:49:27,293 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2021-11-20 05:49:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:27,293 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2021-11-20 05:49:27,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 05:49:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2021-11-20 05:49:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-20 05:49:27,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:27,295 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:27,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-20 05:49:27,295 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2021-11-20 05:49:27,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:27,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799432247] [2021-11-20 05:49:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:27,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 05:49:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-20 05:49:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 05:49:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 05:49:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-20 05:49:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-20 05:49:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-20 05:49:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-20 05:49:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-20 05:49:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-20 05:49:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-20 05:49:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-20 05:49:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-11-20 05:49:27,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799432247] [2021-11-20 05:49:27,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799432247] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418195820] [2021-11-20 05:49:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:27,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:27,400 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:27,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 05:49:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 05:49:27,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-11-20 05:49:27,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 05:49:27,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418195820] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:27,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 05:49:27,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-20 05:49:27,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6478867] [2021-11-20 05:49:27,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:27,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:49:27,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:27,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:49:27,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-20 05:49:27,808 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-20 05:49:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:28,093 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2021-11-20 05:49:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:49:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2021-11-20 05:49:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:28,096 INFO L225 Difference]: With dead ends: 3405 [2021-11-20 05:49:28,097 INFO L226 Difference]: Without dead ends: 1477 [2021-11-20 05:49:28,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-20 05:49:28,100 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:28,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 276 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:49:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-20 05:49:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2021-11-20 05:49:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2021-11-20 05:49:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2021-11-20 05:49:28,228 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2021-11-20 05:49:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:28,228 INFO L470 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2021-11-20 05:49:28,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-20 05:49:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2021-11-20 05:49:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-20 05:49:28,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:28,231 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:28,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:28,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-20 05:49:28,433 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:28,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2021-11-20 05:49:28,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:28,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567505519] [2021-11-20 05:49:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:28,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 05:49:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 05:49:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 05:49:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 05:49:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 05:49:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-20 05:49:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-20 05:49:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 05:49:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-20 05:49:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-20 05:49:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-20 05:49:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 05:49:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 05:49:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-20 05:49:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-11-20 05:49:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-20 05:49:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 05:49:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 05:49:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-20 05:49:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-20 05:49:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-20 05:49:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-20 05:49:28,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:28,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567505519] [2021-11-20 05:49:28,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567505519] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:28,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26079269] [2021-11-20 05:49:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:28,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:28,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:28,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 05:49:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:28,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 05:49:28,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-20 05:49:29,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:49:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-20 05:49:30,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26079269] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:49:30,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:49:30,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-11-20 05:49:30,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432758189] [2021-11-20 05:49:30,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:49:30,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 05:49:30,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 05:49:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:49:30,022 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-11-20 05:49:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:30,562 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2021-11-20 05:49:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 05:49:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2021-11-20 05:49:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:30,564 INFO L225 Difference]: With dead ends: 1743 [2021-11-20 05:49:30,565 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 05:49:30,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-20 05:49:30,568 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 372 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:30,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 450 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 05:49:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 05:49:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 05:49:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 05:49:30,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2021-11-20 05:49:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:30,570 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 05:49:30,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-11-20 05:49:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 05:49:30,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 05:49:30,575 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-20 05:49:30,575 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-20 05:49:30,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:30,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:30,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 05:50:51,937 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2021-11-20 05:50:51,937 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse4 .cse6 (not (<= ~t1_pc~0 0)) .cse7 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13 .cse15) (or .cse1 (and (not (< 0 ~m_pc~0)) (not (<= 1 ~t1_pc~0))) .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 (and (or (not (< 1 ~m_pc~0)) (not (<= ~t1_pc~0 1))) (not (<= ~m_pc~0 0))) .cse12 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse13) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13 .cse15))) [2021-11-20 05:50:51,938 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2021-11-20 05:50:51,938 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2021-11-20 05:50:51,938 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse32 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse33 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (and .cse32 .cse33 .cse34 (= ~q_read_ev~0 2))) (.cse29 (not (= |old(~q_req_up~0)| 1))) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse26 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse27 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse16 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse21 (and .cse32 .cse33 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse34)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= ~q_free~0 0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse10 (not (<= |old(~q_req_up~0)| 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse21 .cse5 .cse6 .cse8 .cse22 .cse2 .cse12 .cse13 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse2 .cse12 .cse13 .cse26 .cse27 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse25 .cse10 .cse2 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse29 .cse21 .cse30 .cse5 .cse6 .cse31 .cse8 .cse22 .cse25 .cse2 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse10 .cse2 .cse12 .cse13 .cse26 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse29 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse2 .cse12 .cse13 .cse26 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse7 .cse8 .cse9 .cse2 .cse11 .cse12 .cse27 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse16 .cse17) (or .cse20 .cse1 .cse3 .cse21 .cse30 .cse5 .cse6 .cse31 .cse8 .cse22 .cse25 .cse10 .cse2 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse18 .cse19)))) [2021-11-20 05:50:51,939 INFO L854 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse26 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse27 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse20 (not (= ~q_free~0 0))) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse23 (not (= |old(~q_read_ev~0)| 2))) (.cse25 (not (= |old(~q_req_up~0)| 1))) (.cse24 (<= ~q_req_up~0 0)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= |old(~q_req_up~0)| 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse22 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse20 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse18 .cse19) (or .cse0 (and .cse24 (= ~q_read_ev~0 2)) .cse1 .cse2 .cse25 .cse26 .cse3 .cse5 .cse27 .cse6 .cse20 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse5 .cse27 .cse6 .cse20 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse23 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse20 .cse10 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse11 .cse12 .cse15 .cse18 .cse19) (or .cse28 .cse1 (not .cse10) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse21 .cse22 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse24 .cse9) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-20 05:50:51,939 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2021-11-20 05:50:51,939 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2021-11-20 05:50:51,939 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2021-11-20 05:50:51,939 INFO L858 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2021-11-20 05:50:51,940 INFO L858 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2021-11-20 05:50:51,940 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse12 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse18 (not (<= 2 ~E_M~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse4 .cse6 .cse17 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14))) [2021-11-20 05:50:51,940 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2021-11-20 05:50:51,940 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2021-11-20 05:50:51,940 INFO L858 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2021-11-20 05:50:51,941 INFO L854 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse20 (<= ~p_dw_pc~0 0)) (.cse21 (< 1 ~p_dw_pc~0))) (let ((.cse36 (= ~c_num_read~0 0)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (= ~p_dw_st~0 0)) (.cse29 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse30 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse38 (= ~p_num_write~0 0)) (.cse42 (< 1 ~m_pc~0)) (.cse41 (<= ~m_pc~0 0)) (.cse31 (= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (= ~q_free~0 0)) (.cse43 (<= 2 ~m_st~0)) (.cse34 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse44 (or .cse20 .cse21)) (.cse33 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (not (= ~M_E~0 2))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (and .cse38 (or .cse42 .cse41) .cse31 .cse39 .cse32 .cse35 .cse43 .cse34 .cse44 .cse33)) (.cse23 (not (<= ~t1_pc~0 0))) (.cse14 (and .cse29 .cse30)) (.cse22 (and (not .cse42) (not .cse41))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse27 (and .cse38 .cse36 .cse37 (or .cse41 (and (<= ~t1_pc~0 1) .cse42)) .cse39 .cse32 .cse35 .cse43 .cse34 .cse44 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse40 .cse33)) (.cse13 (not (< ~local~0 ~token~0))) (.cse25 (and .cse31 .cse32 .cse29 .cse30)) (.cse28 (not (= |old(~m_st~0)| 0))) (.cse17 (not (<= 2 ~E_1~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not .cse40)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse39)) (.cse8 (not .cse38)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not .cse37)) (.cse11 (not .cse36)) (.cse12 (not .cse35)) (.cse24 (not (<= 2 ~E_M~0))) (.cse15 (not .cse34)) (.cse16 (not .cse33)) (.cse26 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse2 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 (and (not .cse20) (not .cse21)) .cse22 .cse16) (or .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse26) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse14 (and .cse0 (= ~E_M~0 ~M_E~0)) .cse15 .cse16 .cse17 .cse26) (or .cse19 .cse1 .cse2 .cse4 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse28 .cse22 .cse16 .cse17 .cse26) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26) (or .cse1 .cse2 (and (= ~m_st~0 0) .cse29 .cse30 (not (= ~t1_st~0 0))) .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse15 .cse25 .cse28 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse5 (and .cse31 .cse32) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse15 .cse16 .cse26))))) [2021-11-20 05:50:51,941 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2021-11-20 05:50:51,942 INFO L854 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse13 (not (< ~local~0 ~token~0))) (.cse17 (not (<= ~token~0 (+ ~local~0 1)))) (.cse19 (not (<= ~t1_pc~0 0))) (.cse21 (not (= ~token~0 ~local~0))) (.cse18 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 (not (= |old(~m_st~0)| 0)) .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse21) (or .cse18 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse21) (or .cse18 .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse15) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16)))) [2021-11-20 05:50:51,942 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2021-11-20 05:50:51,942 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2021-11-20 05:50:51,942 INFO L854 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse9 (<= ~p_dw_pc~0 0)) (.cse10 (< 1 ~p_dw_pc~0))) (let ((.cse38 (= ~c_num_read~0 0)) (.cse39 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= ~p_dw_st~0 0)) (.cse31 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse32 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse33 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse34 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse40 (= ~p_num_write~0 0)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (= ~q_free~0 0)) (.cse45 (<= 2 ~m_st~0)) (.cse36 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse46 (or .cse9 .cse10)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse44 (< 1 ~m_pc~0)) (.cse43 (<= ~m_pc~0 0))) (let ((.cse11 (and (not .cse44) (not .cse43))) (.cse0 (and .cse40 (or .cse44 .cse43) .cse29 .cse41 .cse30 .cse37 .cse45 .cse36 .cse46 .cse35)) (.cse26 (not (= ~M_E~0 2))) (.cse25 (= ~T1_E~0 ~M_E~0)) (.cse23 (and .cse31 .cse32 .cse33 .cse34)) (.cse22 (not (= |old(~m_st~0)| 0))) (.cse14 (and .cse40 .cse38 .cse39 (or .cse43 (and (<= ~t1_pc~0 1) .cse44)) .cse29 .cse41 .cse30 .cse37 .cse45 .cse36 .cse46 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse42 .cse35)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= ~t1_pc~0 1))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse27 (not (< ~local~0 ~token~0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse13 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse15 (not (<= 2 ~T1_E~0))) (.cse3 (not .cse41)) (.cse24 (not (<= ~t1_pc~0 0))) (.cse4 (not .cse40)) (.cse5 (not .cse39)) (.cse6 (not .cse38)) (.cse7 (not .cse37)) (.cse17 (not (<= 2 ~E_M~0))) (.cse8 (not .cse36)) (.cse18 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) (.cse12 (not .cse35)) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (not .cse9) (not .cse10)) .cse11 .cse12) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse13 .cse1 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse22 .cse11 .cse12 .cse19 .cse23 .cse20) (or .cse0 .cse13 .cse1 .cse2 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19) (or .cse25 .cse13 .cse1 .cse26 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse27 .cse8 .cse12 .cse19 .cse28 .cse23) (or .cse13 .cse1 .cse26 .cse2 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 (and .cse25 (= ~E_M~0 ~M_E~0)) .cse8 .cse12 .cse19 .cse23 .cse20) (or .cse13 .cse1 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse27 .cse8 .cse22 .cse18 .cse12 .cse19 .cse28) (or .cse13 .cse1 .cse15 (and .cse29 .cse30) .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse12 .cse20) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse27 (and (= ~m_st~0 0) .cse31 .cse32 .cse33 (not (= ~t1_st~0 0)) .cse34) .cse8 .cse18 .cse12 .cse19 .cse28) (or .cse13 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse20))))) [2021-11-20 05:50:51,943 INFO L858 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2021-11-20 05:50:51,943 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2021-11-20 05:50:51,943 INFO L858 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2021-11-20 05:50:51,943 INFO L854 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse20 (not (<= ~t1_pc~0 0))) (.cse18 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse19 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= 2 ~E_M~0))) (.cse21 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse3 .cse4 (and .cse16 .cse17) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14)))) [2021-11-20 05:50:51,943 INFO L858 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2021-11-20 05:50:51,944 INFO L854 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse18 (and .cse30 (= ~p_dw_st~0 0))) (.cse20 (not .cse3)) (.cse15 (not (= ~p_num_write~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (= ~q_read_ev~0 2))) (.cse21 (not (<= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse24 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse12 (= |old(~c_dr_st~0)| 0)) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse12 .cse20 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse17 .cse9 .cse24 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse19 .cse12 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 .cse26 .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse26 .cse29 .cse11 .cse19 .cse12 .cse21 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse24 .cse26 .cse29 .cse11 .cse19 .cse12 .cse23 .cse13 .cse14)))) [2021-11-20 05:50:51,944 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse39 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse38 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (<= activate_threads1_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse21 (= ~p_dw_st~0 0)) (.cse24 (= |old(~p_dw_st~0)| 0))) (let ((.cse14 (not .cse24)) (.cse33 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse35 (not .cse21)) (.cse37 (not (= ~c_dr_st~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse31 (and .cse20 .cse22)) (.cse40 (and .cse38 .cse19 .cse20 .cse22)) (.cse34 (not (= ~q_free~0 0))) (.cse9 (not .cse39)) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse36 (and .cse38 .cse19)) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse27 (not (<= ~c_dr_pc~0 1))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse29 (not (<= 2 ~q_write_ev~0))) (.cse30 (not (<= 1 ~c_dr_pc~0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~q_free~0 1))) (.cse32 (= |old(~c_dr_st~0)| 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse21 .cse22) .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse28 .cse29 .cse30 .cse31 .cse12 .cse13 .cse32 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse29 .cse30 .cse31 .cse12 .cse13 .cse32 .cse15 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse33 .cse31 .cse13 .cse32 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 (and .cse35 .cse20 .cse22) .cse12 .cse32 .cse16 .cse18 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse19 .cse21) .cse12 .cse13 .cse32 .cse14 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse36 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse33 .cse13 .cse32 .cse17) (or .cse1 (and (= ~q_read_ev~0 1) .cse37 .cse21) .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse29 .cse30 .cse12 .cse13 .cse32 (and .cse38 .cse19 .cse39) .cse15 .cse17 .cse18 .cse23) (or .cse0 .cse1 .cse35 .cse2 .cse24 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 .cse28 .cse12 .cse32 .cse18 .cse23) (or .cse0 .cse1 .cse2 (and .cse37 .cse21) .cse24 .cse36 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 .cse12 .cse32 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse40 .cse3 .cse5 .cse7 .cse34 .cse27 .cse9 .cse10 .cse11 .cse29 .cse12 .cse32 .cse15 .cse16 .cse18 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse32 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse40 .cse3 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse34 .cse27 .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse32 .cse15 .cse16 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse36 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse28 .cse29 .cse30 .cse12 .cse13 .cse32 .cse17 .cse18 .cse23)))) [2021-11-20 05:50:51,944 INFO L858 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2021-11-20 05:50:51,944 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse18 (and .cse30 (= ~p_dw_st~0 0))) (.cse20 (not .cse3)) (.cse15 (not (= ~p_num_write~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (= ~q_read_ev~0 2))) (.cse21 (not (<= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse24 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse12 (= |old(~c_dr_st~0)| 0)) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse12 .cse20 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse17 .cse9 .cse24 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse19 .cse12 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 .cse26 .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse26 .cse29 .cse11 .cse19 .cse12 .cse21 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse24 .cse26 .cse29 .cse11 .cse19 .cse12 .cse23 .cse13 .cse14)))) [2021-11-20 05:50:51,944 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2021-11-20 05:50:51,944 INFO L858 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2021-11-20 05:50:51,944 INFO L858 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse14 (not (= ~m_st~0 0))) (.cse6 (= ~t1_st~0 0)) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse14 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 .cse1 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17))) [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2021-11-20 05:50:51,945 INFO L858 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2021-11-20 05:50:51,946 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2021-11-20 05:50:51,946 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2021-11-20 05:50:51,946 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse17 (and .cse29 (= ~q_read_ev~0 2))) (.cse24 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= 2 |old(~q_write_ev~0)|))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (= ~p_dw_st~0 0)) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse19 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse21 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse1 (not .cse8) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse4 .cse20 .cse5 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse15 .cse23 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse25 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse14 .cse22 .cse15 .cse23 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse25 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse28 .cse27 .cse14 .cse22 .cse23 .cse16 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse8 .cse10 .cse11 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse26 .cse21 .cse8 .cse9 .cse10 .cse28 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse26 .cse21 .cse9 .cse10 .cse11 .cse14 .cse22 .cse23 .cse16 .cse18)))) [2021-11-20 05:50:51,946 INFO L858 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2021-11-20 05:50:51,946 INFO L858 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2021-11-20 05:50:51,947 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L854 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse30 (< 1 ~m_pc~0)) (.cse31 (<= ~m_pc~0 0)) (.cse38 (= ~m_pc~0 ~t1_pc~0)) (.cse32 (<= 1 ~c_dr_pc~0)) (.cse35 (<= ~c_dr_pc~0 1)) (.cse34 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse36 (= ~E_M~0 ~M_E~0)) (.cse37 (= ~M_E~0 2)) (.cse39 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse40 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse25 (not (= ~p_num_write~0 0))) (.cse26 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse10 (and .cse39 .cse40)) (.cse29 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse15 (and .cse33 (or .cse30 .cse31) .cse38 .cse32 .cse35 .cse39 .cse34 .cse40 .cse36 .cse37)) (.cse2 (not .cse38)) (.cse3 (not .cse37)) (.cse4 (not .cse36)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse18 (not .cse35)) (.cse27 (= ~p_dw_st~0 0)) (.cse19 (not .cse34)) (.cse8 (not .cse33)) (.cse9 (not (= ~m_st~0 0))) (.cse20 (not (<= 2 ~q_write_ev~0))) (.cse21 (not .cse32)) (.cse11 (and (not .cse30) (not .cse31))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse2 (not (= ~q_read_ev~0 1)) .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse19 .cse8 .cse9 .cse20 .cse21 .cse11 .cse12 .cse22 .cse23 .cse24 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse26 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse27 .cse8 .cse9 .cse28 .cse10 .cse20 .cse21 .cse11 .cse12 .cse22 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse18 .cse27 .cse19 .cse8 .cse9 (= ~q_write_ev~0 0) .cse10 .cse12 .cse23 .cse29 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse25 .cse6 .cse26 .cse27 .cse19 .cse8 .cse28 .cse10 .cse11 .cse22 .cse24) (or .cse1 .cse2 (not .cse27) .cse3 .cse4 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse25 .cse6 .cse26 .cse19 .cse8 .cse9 .cse10 .cse12 .cse22 .cse23 .cse29 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse27 .cse19 .cse8 .cse9 .cse10 .cse20 .cse12 .cse23 .cse29 .cse13 .cse14) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse27 .cse19 .cse8 .cse9 .cse20 .cse21 .cse11 .cse12 .cse22 .cse23 .cse24 .cse13 .cse14)))) [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L854 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2021-11-20 05:50:51,948 INFO L858 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L854 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L854 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-11-20 05:50:51,949 INFO L854 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2021-11-20 05:50:51,949 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2021-11-20 05:50:51,950 INFO L858 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2021-11-20 05:50:51,950 INFO L854 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2021-11-20 05:50:51,950 INFO L854 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-20 05:50:51,950 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2021-11-20 05:50:51,950 INFO L858 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2021-11-20 05:50:51,950 INFO L858 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2021-11-20 05:50:51,950 INFO L854 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 1 ~c_dr_pc~0)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse12) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse13 .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-20 05:50:51,951 INFO L858 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2021-11-20 05:50:51,951 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-11-20 05:50:51,951 INFO L854 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse6 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (<= 2 ~E_1~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse13 (<= ~t1_pc~0 0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 (<= 1 ~q_read_ev~0) .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse20 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse3 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse22 .cse10 .cse12 .cse26 .cse24 .cse16 .cse18))) [2021-11-20 05:50:51,951 INFO L858 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2021-11-20 05:50:51,951 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-11-20 05:50:51,951 INFO L854 garLoopResultBuilder]: At program point L568(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse3 .cse4 .cse5 .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse7 .cse8) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse3 .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2021-11-20 05:50:51,951 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2021-11-20 05:50:51,951 INFO L854 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-20 05:50:51,952 INFO L854 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse3 .cse4 .cse5 .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse7 .cse8))) [2021-11-20 05:50:51,952 INFO L858 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2021-11-20 05:50:51,952 INFO L854 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-20 05:50:51,952 INFO L858 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2021-11-20 05:50:51,952 INFO L854 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-20 05:50:51,953 INFO L854 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-20 05:50:51,953 INFO L858 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2021-11-20 05:50:51,953 INFO L854 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-20 05:50:51,953 INFO L854 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,953 INFO L854 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,954 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2021-11-20 05:50:51,954 INFO L854 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-20 05:50:51,954 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2021-11-20 05:50:51,954 INFO L854 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse6 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (<= 2 ~E_1~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse13 (<= ~t1_pc~0 0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 (<= 1 ~q_read_ev~0) .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse20 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse3 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse22 .cse10 .cse12 .cse26 .cse24 .cse16 .cse18))) [2021-11-20 05:50:51,955 INFO L854 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-20 05:50:51,955 INFO L854 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-20 05:50:51,955 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 05:50:51,955 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2021-11-20 05:50:51,955 INFO L854 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2021-11-20 05:50:51,955 INFO L858 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2021-11-20 05:50:51,956 INFO L854 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,956 INFO L854 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse18 (= ~q_req_up~0 1)) (.cse21 (<= 1 ~q_read_ev~0)) (.cse28 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse31 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse22 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not .cse32)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse29 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse9 .cse11 (<= ~p_num_write~0 1) .cse21 .cse14 .cse15 .cse22 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse25 .cse28 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse21 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse31 .cse2 .cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse24 .cse8 .cse10 .cse28 .cse26 .cse15 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse6 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse23 .cse20 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse8 .cse10 .cse11 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse29 .cse23 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30)))) [2021-11-20 05:50:51,956 INFO L854 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,957 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-11-20 05:50:51,957 INFO L854 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-11-20 05:50:51,957 INFO L854 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-11-20 05:50:51,957 INFO L854 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse18 (<= 1 ~c_dr_pc~0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse19 (= ~q_free~0 1)) (.cse21 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ~q_free~0 0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse16 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse16 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse19 .cse6 .cse15 .cse21 .cse22 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-11-20 05:50:51,958 INFO L854 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse7 (= ~q_free~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse8 (<= ~t1_pc~0 0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse11 (= ~token~0 ~local~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse16 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse19 .cse6 .cse15 .cse21 .cse22 .cse10 .cse12))) [2021-11-20 05:50:51,958 INFO L854 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,958 INFO L854 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,958 INFO L854 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,959 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-11-20 05:50:51,959 INFO L858 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2021-11-20 05:50:51,959 INFO L858 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2021-11-20 05:50:51,959 INFO L858 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2021-11-20 05:50:51,959 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse5 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse26 (< 0 ~q_write_ev~0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~q_free~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse19 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse20 (= ~q_free~0 1)) (.cse21 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse20 .cse21 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse20 .cse21 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse20 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse19 .cse6 .cse20 (= ~q_read_ev~0 1) .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25))) [2021-11-20 05:50:51,960 INFO L854 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,960 INFO L854 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0)))) (.cse12 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse16 .cse5 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15 (= ~token~0 ~local~0)))) [2021-11-20 05:50:51,960 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-11-20 05:50:51,960 INFO L858 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2021-11-20 05:50:51,960 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 05:50:51,961 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2021-11-20 05:50:51,961 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2021-11-20 05:50:51,961 INFO L858 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2021-11-20 05:50:51,961 INFO L854 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2021-11-20 05:50:51,961 INFO L854 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,962 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-11-20 05:50:51,962 INFO L858 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2021-11-20 05:50:51,962 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2021-11-20 05:50:51,962 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2021-11-20 05:50:51,962 INFO L858 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2021-11-20 05:50:51,963 INFO L854 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse6 (= ~m_st~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse14 .cse3 .cse5 .cse7 .cse15 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-20 05:50:51,963 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-11-20 05:50:51,963 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2021-11-20 05:50:51,963 INFO L858 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2021-11-20 05:50:51,963 INFO L858 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2021-11-20 05:50:51,963 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2021-11-20 05:50:51,964 INFO L854 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0))) (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not .cse28)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse26 (= ~p_num_write~0 0)) (.cse27 (= ~c_num_read~0 0)) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse29 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse26 .cse2 .cse27 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse26 .cse27 .cse3 .cse4 .cse5 .cse21 .cse6 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse24 .cse15 .cse29 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse26 .cse27 .cse3 .cse4 .cse5 .cse21 .cse8 .cse10 .cse11 .cse14 .cse24 .cse15 .cse29 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse29 .cse16 .cse17)))) [2021-11-20 05:50:51,964 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2021-11-20 05:50:51,964 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2021-11-20 05:50:51,964 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-11-20 05:50:51,964 INFO L858 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2021-11-20 05:50:51,964 INFO L858 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2021-11-20 05:50:51,965 INFO L854 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,965 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2021-11-20 05:50:51,965 INFO L854 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~q_read_ev~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse23 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse20 (= ~p_num_write~0 0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse21 (= ~c_num_read~0 0)) (.cse4 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse22 (= ~q_free~0 1)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse14 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 ~M_E~0)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse22 .cse10 .cse14 .cse23 .cse24 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 (<= ~p_num_write~0 1) .cse24 .cse16 .cse17 .cse25 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse22 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 .cse19))) [2021-11-20 05:50:51,965 INFO L858 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2021-11-20 05:50:51,965 INFO L858 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2021-11-20 05:50:51,966 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 05:50:51,966 INFO L861 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2021-11-20 05:50:51,966 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2021-11-20 05:50:51,966 INFO L854 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-20 05:50:51,966 INFO L858 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2021-11-20 05:50:51,967 INFO L854 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,967 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)))) [2021-11-20 05:50:51,967 INFO L854 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse8 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse16 (= ~p_num_write~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse17 (= ~c_num_read~0 0)) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~c_dr_pc~0) .cse5 .cse6 .cse7 (<= ~c_dr_pc~0 1) .cse8 .cse9 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse10 .cse11 .cse12 .cse13 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 (= ~q_free~0 0) .cse9 .cse10 .cse11 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse10 .cse11 .cse15 .cse12 .cse13))) [2021-11-20 05:50:51,967 INFO L858 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2021-11-20 05:50:51,967 INFO L861 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2021-11-20 05:50:51,968 INFO L854 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-11-20 05:50:51,968 INFO L858 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2021-11-20 05:50:51,968 INFO L854 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse11 .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 (<= ~c_dr_pc~0 1) .cse16 .cse9 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-11-20 05:50:51,968 INFO L854 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse18 (= ~q_req_up~0 1)) (.cse21 (<= 1 ~q_read_ev~0)) (.cse28 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse31 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse22 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not .cse32)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse29 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse9 .cse11 (<= ~p_num_write~0 1) .cse21 .cse14 .cse15 .cse22 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse25 .cse28 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse21 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse31 .cse2 .cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse24 .cse8 .cse10 .cse28 .cse26 .cse15 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse6 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse23 .cse20 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse8 .cse10 .cse11 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse29 .cse23 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30)))) [2021-11-20 05:50:51,969 INFO L854 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2021-11-20 05:50:51,969 INFO L854 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse23 (= ~p_dw_st~0 0))) (let ((.cse1 (= ~q_req_up~0 1)) (.cse3 (not .cse23)) (.cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse21 (<= 1 ~q_read_ev~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse22 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse20 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse18))) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse21 .cse13 .cse15 .cse20 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse2 (= ~p_num_write~0 0) .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse23 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse20 .cse16 .cse17)))) [2021-11-20 05:50:51,969 INFO L854 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2021-11-20 05:50:51,969 INFO L858 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2021-11-20 05:50:51,969 INFO L858 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2021-11-20 05:50:51,970 INFO L854 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse26 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse28 (<= is_do_write_p_triggered_~__retres1~0 0)) (.cse29 (<= 0 is_do_write_p_triggered_~__retres1~0))) (let ((.cse15 (not (<= ~q_req_up~0 0))) (.cse21 (not (= ~q_free~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse27 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse23 (not (<= ~c_dr_pc~0 1))) (.cse12 (not (= ~m_st~0 0))) (.cse24 (not (<= 2 ~q_write_ev~0))) (.cse30 (not (<= 1 ~c_dr_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (and .cse28 .cse29)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse10 (not .cse26)) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse14 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse2 .cse11 .cse12 .cse22 .cse13 .cse18 .cse19) (or .cse20 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse7 (not (< ~c_num_read~0 ~p_num_write~0)) .cse8 .cse21 .cse23 .cse2 .cse10 .cse11 .cse12 (= ~q_write_ev~0 0) .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse23 .cse2 .cse10 .cse11 .cse12 .cse24 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse25 .cse5 (and (= ~q_read_ev~0 1) .cse26) .cse8 .cse27 (and .cse26 .cse28 .cse29) .cse23 .cse2 .cse11 .cse12 .cse24 .cse30 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse2 .cse11 .cse12 .cse13 .cse16 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse25 .cse5 .cse7 .cse8 .cse27 .cse23 .cse2 .cse11 .cse12 .cse22 .cse24 .cse30 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse22 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14 .cse17)))) [2021-11-20 05:50:51,970 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2021-11-20 05:50:51,970 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2021-11-20 05:50:51,970 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2021-11-20 05:50:51,970 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2021-11-20 05:50:51,970 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2021-11-20 05:50:51,971 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2021-11-20 05:50:51,971 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2021-11-20 05:50:51,971 INFO L854 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse19 (= ~q_read_ev~0 2)) (.cse0 (= ~c_dr_st~0 0)) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse3 (not .cse16)) (.cse20 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse22 (not (= ~q_free~0 1))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not .cse0)) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse17 (not (<= 2 ~q_write_ev~0))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse19)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse7 .cse15 .cse8 .cse16 .cse9 .cse10 .cse17 (and (= ~q_write_ev~0 ~q_read_ev~0) .cse18 .cse19) .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) .cse13 (not (<= ~p_num_write~0 1)) .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse21 .cse9 .cse10 .cse17 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse26 .cse9 .cse10 .cse17 .cse27 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse6 .cse7 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse26 .cse21 .cse9 .cse10 .cse17 .cse27 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse25 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 .cse18 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse26 .cse16 .cse21 .cse9 .cse10 .cse17 .cse27 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14)))) [2021-11-20 05:50:51,971 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2021-11-20 05:50:51,971 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2021-11-20 05:50:51,972 INFO L858 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2021-11-20 05:50:51,973 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2021-11-20 05:50:51,973 INFO L858 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2021-11-20 05:50:51,973 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2021-11-20 05:50:51,973 INFO L861 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2021-11-20 05:50:51,973 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2021-11-20 05:50:51,973 INFO L858 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse31 (not (< 0 |old(~q_write_ev~0)|))) (.cse18 (and .cse32 (= ~q_read_ev~0 2))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse29 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse30 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse26 (not (<= 2 |old(~q_write_ev~0)|))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse21 .cse22 .cse10 .cse11 .cse13 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse2 .cse10 .cse11 .cse26 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse2 .cse10 .cse11 .cse26 .cse28 .cse27 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse7 .cse21 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse31 .cse27 .cse13 .cse15 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse2 .cse9 .cse10 .cse28 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14 .cse16) (or .cse20 .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse7 .cse21 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~q_write_ev~0)| 0) .cse15 .cse17 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse9 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1)) .cse26 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19)))) [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse14 (not (= ~m_st~0 0))) (.cse6 (= ~t1_st~0 0)) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse14 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 .cse1 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17))) [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2021-11-20 05:50:51,974 INFO L858 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2021-11-20 05:50:51,977 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:50:51,979 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:50:52,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:50:52 BoogieIcfgContainer [2021-11-20 05:50:52,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:50:52,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:50:52,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:50:52,143 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:50:52,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:13" (3/4) ... [2021-11-20 05:50:52,147 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-20 05:50:52,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-11-20 05:50:52,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-20 05:50:52,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-20 05:50:52,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-20 05:50:52,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 05:50:52,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 05:50:52,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2021-11-20 05:50:52,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) [2021-11-20 05:50:52,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2021-11-20 05:50:52,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-20 05:50:52,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-20 05:50:52,336 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 05:50:52,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:50:52,341 INFO L158 Benchmark]: Toolchain (without parser) took 160508.22ms. Allocated memory was 98.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 64.4MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 753.4MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,341 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 98.6MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:50:52,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.20ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 68.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.44ms. Allocated memory is still 98.6MB. Free memory was 68.3MB in the beginning and 65.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,349 INFO L158 Benchmark]: Boogie Preprocessor took 67.21ms. Allocated memory is still 98.6MB. Free memory was 65.6MB in the beginning and 63.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,349 INFO L158 Benchmark]: RCFGBuilder took 952.51ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 63.2MB in the beginning and 91.6MB in the end (delta: -28.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,349 INFO L158 Benchmark]: TraceAbstraction took 158716.11ms. Allocated memory was 119.5MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 91.0MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2021-11-20 05:50:52,349 INFO L158 Benchmark]: Witness Printer took 193.75ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-20 05:50:52,351 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 98.6MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.20ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 68.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.44ms. Allocated memory is still 98.6MB. Free memory was 68.3MB in the beginning and 65.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.21ms. Allocated memory is still 98.6MB. Free memory was 65.6MB in the beginning and 63.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 952.51ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 63.2MB in the beginning and 91.6MB in the end (delta: -28.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 158716.11ms. Allocated memory was 119.5MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 91.0MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 193.75ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 158.5s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 81.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18064 SdHoareTripleChecker+Valid, 16.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17614 mSDsluCounter, 29165 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18884 mSDsCounter, 4380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15317 IncrementalHoareTripleChecker+Invalid, 19697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4380 mSolverCounterUnsat, 10281 mSDtfsCounter, 15317 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3758 GetRequests, 3283 SyntacticMatches, 9 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15051occurred in iteration=18, InterpolantAutomatonStates: 411, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 10070 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 17669 PreInvPairs, 19898 NumberOfFragments, 27648 HoareAnnotationTreeSize, 17669 FomulaSimplifications, 9116 FormulaSimplificationTreeSizeReduction, 18.3s HoareSimplificationTime, 84 FomulaSimplificationsInter, 1174458 FormulaSimplificationTreeSizeReductionInter, 62.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11553 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (q_read_ev == 1 && c_dr_pc == p_dw_pc)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || ((c_dr_pc == p_dw_pc && __retres1 <= 0) && 0 <= __retres1)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1) && E_M == M_E) && M_E == 2)) || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1) && E_M == M_E) && M_E == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || (((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || ((q_write_ev == q_read_ev && !(c_dr_st == 0)) && q_read_ev == 2)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) RESULT: Ultimate proved your program to be correct! [2021-11-20 05:50:52,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a979bb84-46f1-4126-9885-388333ef16d4/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE