./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:49:16,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:49:16,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:49:16,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:49:16,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:49:16,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:49:16,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:49:16,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:49:16,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:49:16,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:49:16,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:49:16,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:49:16,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:49:16,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:49:16,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:49:16,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:49:16,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:49:16,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:49:16,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:49:16,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:49:16,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:49:16,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:49:16,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:49:16,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:49:16,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:49:16,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:49:16,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:49:16,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:49:16,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:49:16,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:49:16,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:49:16,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:49:16,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:49:16,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:49:16,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:49:16,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:49:16,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:49:16,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:49:16,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:49:16,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:49:16,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:49:16,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:49:16,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:49:16,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:49:16,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:49:16,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:49:16,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:49:16,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:49:16,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:49:16,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:49:16,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:49:16,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:49:16,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:49:16,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:49:16,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:49:16,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer 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(__VERIFIER_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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-12-07 14:49:16,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:49:16,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:49:16,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:49:16,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:49:16,472 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:49:16,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2019-12-07 14:49:16,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/data/27f00736f/110bc9efcec948ecaa7cac0429b61b4c/FLAGa8d9a2002 [2019-12-07 14:49:16,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:49:16,881 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/sv-benchmarks/c/systemc/bist_cell.cil.c [2019-12-07 14:49:16,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/data/27f00736f/110bc9efcec948ecaa7cac0429b61b4c/FLAGa8d9a2002 [2019-12-07 14:49:16,895 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/data/27f00736f/110bc9efcec948ecaa7cac0429b61b4c [2019-12-07 14:49:16,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:49:16,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:49:16,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:49:16,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:49:16,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:49:16,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:49:16" (1/1) ... [2019-12-07 14:49:16,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8c33a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:16, skipping insertion in model container [2019-12-07 14:49:16,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:49:16" (1/1) ... [2019-12-07 14:49:16,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:49:16,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:49:17,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:49:17,093 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:49:17,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:49:17,128 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:49:17,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17 WrapperNode [2019-12-07 14:49:17,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:49:17,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:49:17,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:49:17,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:49:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:49:17,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:49:17,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:49:17,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:49:17,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... [2019-12-07 14:49:17,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:49:17,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:49:17,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:49:17,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:49:17,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:49:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:49:17,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:49:17,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:49:17,493 INFO L287 CfgBuilder]: Removed 64 assume(true) statements. [2019-12-07 14:49:17,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:17 BoogieIcfgContainer [2019-12-07 14:49:17,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:49:17,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:49:17,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:49:17,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:49:17,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:49:16" (1/3) ... [2019-12-07 14:49:17,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fab534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:49:17, skipping insertion in model container [2019-12-07 14:49:17,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:17" (2/3) ... [2019-12-07 14:49:17,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fab534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:49:17, skipping insertion in model container [2019-12-07 14:49:17,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:17" (3/3) ... [2019-12-07 14:49:17,499 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-12-07 14:49:17,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:49:17,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:49:17,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:49:17,536 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:49:17,536 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:49:17,536 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:49:17,536 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:49:17,536 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:49:17,536 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:49:17,537 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:49:17,537 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:49:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-12-07 14:49:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:49:17,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:17,553 INFO L410 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] [2019-12-07 14:49:17,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-12-07 14:49:17,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:17,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198473215] [2019-12-07 14:49:17,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:17,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198473215] [2019-12-07 14:49:17,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:17,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:17,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393916584] [2019-12-07 14:49:17,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:17,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,687 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-12-07 14:49:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:17,719 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-12-07 14:49:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:17,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 14:49:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:17,728 INFO L225 Difference]: With dead ends: 210 [2019-12-07 14:49:17,728 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:49:17,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:49:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 14:49:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:49:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-12-07 14:49:17,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-12-07 14:49:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:17,759 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-12-07 14:49:17,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-12-07 14:49:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:49:17,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:17,761 INFO L410 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] [2019-12-07 14:49:17,761 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-12-07 14:49:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:17,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522976222] [2019-12-07 14:49:17,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:17,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522976222] [2019-12-07 14:49:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703658692] [2019-12-07 14:49:17,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:17,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,807 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-12-07 14:49:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:17,828 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-12-07 14:49:17,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:17,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:49:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:17,830 INFO L225 Difference]: With dead ends: 199 [2019-12-07 14:49:17,830 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:49:17,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:49:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 14:49:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:49:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-12-07 14:49:17,841 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-12-07 14:49:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:17,842 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-12-07 14:49:17,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-12-07 14:49:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 14:49:17,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:17,844 INFO L410 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, 1, 1] [2019-12-07 14:49:17,845 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-12-07 14:49:17,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:17,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586683271] [2019-12-07 14:49:17,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:17,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586683271] [2019-12-07 14:49:17,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:17,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:17,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406371203] [2019-12-07 14:49:17,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:17,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:17,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,880 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-12-07 14:49:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:17,894 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-12-07 14:49:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:17,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 14:49:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:17,895 INFO L225 Difference]: With dead ends: 196 [2019-12-07 14:49:17,895 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:49:17,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:49:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 14:49:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:49:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-12-07 14:49:17,902 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-12-07 14:49:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:17,902 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-12-07 14:49:17,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-12-07 14:49:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:49:17,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:17,904 INFO L410 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, 1, 1, 1, 1] [2019-12-07 14:49:17,904 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-12-07 14:49:17,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:17,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412123549] [2019-12-07 14:49:17,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:17,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412123549] [2019-12-07 14:49:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:17,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:17,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258280261] [2019-12-07 14:49:17,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:17,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,934 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-12-07 14:49:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:17,945 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-12-07 14:49:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:17,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 14:49:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:17,947 INFO L225 Difference]: With dead ends: 193 [2019-12-07 14:49:17,947 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 14:49:17,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 14:49:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 14:49:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:49:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-12-07 14:49:17,953 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-12-07 14:49:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:17,953 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-12-07 14:49:17,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-12-07 14:49:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:49:17,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:17,954 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:17,954 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:17,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:17,955 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-12-07 14:49:17,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:17,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644783768] [2019-12-07 14:49:17,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:17,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644783768] [2019-12-07 14:49:17,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:17,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:17,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297729557] [2019-12-07 14:49:17,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:17,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:17,995 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-12-07 14:49:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,019 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-12-07 14:49:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 14:49:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,022 INFO L225 Difference]: With dead ends: 271 [2019-12-07 14:49:18,022 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 14:49:18,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 14:49:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-12-07 14:49:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-12-07 14:49:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-12-07 14:49:18,038 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-12-07 14:49:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,039 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-12-07 14:49:18,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-12-07 14:49:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:49:18,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,041 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,041 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-12-07 14:49:18,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538765744] [2019-12-07 14:49:18,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538765744] [2019-12-07 14:49:18,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844001248] [2019-12-07 14:49:18,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,079 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-12-07 14:49:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,115 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-12-07 14:49:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 14:49:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,118 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:49:18,118 INFO L226 Difference]: Without dead ends: 371 [2019-12-07 14:49:18,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-07 14:49:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-12-07 14:49:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-12-07 14:49:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-12-07 14:49:18,131 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-12-07 14:49:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,131 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-12-07 14:49:18,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-12-07 14:49:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:49:18,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,133 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,133 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-12-07 14:49:18,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375117797] [2019-12-07 14:49:18,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375117797] [2019-12-07 14:49:18,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033880438] [2019-12-07 14:49:18,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,161 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-12-07 14:49:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,191 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-12-07 14:49:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 14:49:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,193 INFO L225 Difference]: With dead ends: 697 [2019-12-07 14:49:18,194 INFO L226 Difference]: Without dead ends: 408 [2019-12-07 14:49:18,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-07 14:49:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-12-07 14:49:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 14:49:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-12-07 14:49:18,207 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-12-07 14:49:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,207 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-12-07 14:49:18,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-12-07 14:49:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:49:18,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,208 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-12-07 14:49:18,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180454067] [2019-12-07 14:49:18,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180454067] [2019-12-07 14:49:18,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100474370] [2019-12-07 14:49:18,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,241 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-12-07 14:49:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,282 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-12-07 14:49:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 14:49:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,286 INFO L225 Difference]: With dead ends: 1166 [2019-12-07 14:49:18,286 INFO L226 Difference]: Without dead ends: 805 [2019-12-07 14:49:18,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-07 14:49:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-12-07 14:49:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-07 14:49:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-12-07 14:49:18,308 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-12-07 14:49:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,308 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-12-07 14:49:18,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-12-07 14:49:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:49:18,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,310 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-12-07 14:49:18,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130197022] [2019-12-07 14:49:18,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130197022] [2019-12-07 14:49:18,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274215723] [2019-12-07 14:49:18,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,337 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-12-07 14:49:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,382 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-12-07 14:49:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 14:49:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,386 INFO L225 Difference]: With dead ends: 1533 [2019-12-07 14:49:18,386 INFO L226 Difference]: Without dead ends: 926 [2019-12-07 14:49:18,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-12-07 14:49:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-12-07 14:49:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 14:49:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-12-07 14:49:18,411 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-12-07 14:49:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,411 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-12-07 14:49:18,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-12-07 14:49:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:49:18,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,413 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,413 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-12-07 14:49:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923378122] [2019-12-07 14:49:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923378122] [2019-12-07 14:49:18,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129980816] [2019-12-07 14:49:18,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,445 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-12-07 14:49:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,482 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-12-07 14:49:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 14:49:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,486 INFO L225 Difference]: With dead ends: 1353 [2019-12-07 14:49:18,486 INFO L226 Difference]: Without dead ends: 622 [2019-12-07 14:49:18,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-07 14:49:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-12-07 14:49:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-07 14:49:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-12-07 14:49:18,501 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-12-07 14:49:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,501 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-12-07 14:49:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-12-07 14:49:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:49:18,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,503 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-12-07 14:49:18,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089596457] [2019-12-07 14:49:18,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089596457] [2019-12-07 14:49:18,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838741968] [2019-12-07 14:49:18,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,521 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-12-07 14:49:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,550 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-12-07 14:49:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 14:49:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,552 INFO L225 Difference]: With dead ends: 921 [2019-12-07 14:49:18,552 INFO L226 Difference]: Without dead ends: 442 [2019-12-07 14:49:18,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-07 14:49:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-12-07 14:49:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-12-07 14:49:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-12-07 14:49:18,564 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-12-07 14:49:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-12-07 14:49:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-12-07 14:49:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:49:18,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,565 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-12-07 14:49:18,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010205140] [2019-12-07 14:49:18,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010205140] [2019-12-07 14:49:18,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917944398] [2019-12-07 14:49:18,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,588 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-12-07 14:49:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,604 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-12-07 14:49:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 14:49:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,607 INFO L225 Difference]: With dead ends: 617 [2019-12-07 14:49:18,607 INFO L226 Difference]: Without dead ends: 344 [2019-12-07 14:49:18,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-07 14:49:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-07 14:49:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-07 14:49:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-12-07 14:49:18,620 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-12-07 14:49:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,620 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-12-07 14:49:18,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-12-07 14:49:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:49:18,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,621 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,621 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-12-07 14:49:18,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611236848] [2019-12-07 14:49:18,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611236848] [2019-12-07 14:49:18,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433295943] [2019-12-07 14:49:18,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,646 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-12-07 14:49:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,686 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-12-07 14:49:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 14:49:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,689 INFO L225 Difference]: With dead ends: 922 [2019-12-07 14:49:18,689 INFO L226 Difference]: Without dead ends: 665 [2019-12-07 14:49:18,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-12-07 14:49:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-12-07 14:49:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-07 14:49:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-12-07 14:49:18,707 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-12-07 14:49:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,707 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-12-07 14:49:18,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-12-07 14:49:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:49:18,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,709 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,709 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-12-07 14:49:18,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465733474] [2019-12-07 14:49:18,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465733474] [2019-12-07 14:49:18,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673213152] [2019-12-07 14:49:18,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,726 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-12-07 14:49:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,762 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-12-07 14:49:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 14:49:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,766 INFO L225 Difference]: With dead ends: 1151 [2019-12-07 14:49:18,766 INFO L226 Difference]: Without dead ends: 782 [2019-12-07 14:49:18,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-12-07 14:49:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-12-07 14:49:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-07 14:49:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-12-07 14:49:18,788 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-12-07 14:49:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,788 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-12-07 14:49:18,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-12-07 14:49:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:49:18,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,790 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-12-07 14:49:18,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828440086] [2019-12-07 14:49:18,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828440086] [2019-12-07 14:49:18,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93705846] [2019-12-07 14:49:18,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,807 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-12-07 14:49:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,842 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-12-07 14:49:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 14:49:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,845 INFO L225 Difference]: With dead ends: 1061 [2019-12-07 14:49:18,845 INFO L226 Difference]: Without dead ends: 572 [2019-12-07 14:49:18,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-07 14:49:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-07 14:49:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-07 14:49:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-12-07 14:49:18,862 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-12-07 14:49:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,862 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-12-07 14:49:18,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-12-07 14:49:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:49:18,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,863 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,863 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-12-07 14:49:18,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231265383] [2019-12-07 14:49:18,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231265383] [2019-12-07 14:49:18,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070650316] [2019-12-07 14:49:18,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,883 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-12-07 14:49:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,900 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-12-07 14:49:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 14:49:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,902 INFO L225 Difference]: With dead ends: 741 [2019-12-07 14:49:18,902 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 14:49:18,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 14:49:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-12-07 14:49:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-07 14:49:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-12-07 14:49:18,917 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-12-07 14:49:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:18,917 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-12-07 14:49:18,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-12-07 14:49:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:49:18,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:18,918 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:18,918 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-12-07 14:49:18,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:18,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566746035] [2019-12-07 14:49:18,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:18,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566746035] [2019-12-07 14:49:18,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:18,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:18,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630496378] [2019-12-07 14:49:18,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:18,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:18,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:18,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,937 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-12-07 14:49:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:18,981 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-12-07 14:49:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:18,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 14:49:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:18,984 INFO L225 Difference]: With dead ends: 1220 [2019-12-07 14:49:18,984 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 14:49:18,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 14:49:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-12-07 14:49:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-12-07 14:49:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-12-07 14:49:19,011 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-12-07 14:49:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,012 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-12-07 14:49:19,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-12-07 14:49:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:49:19,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,013 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:19,013 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-12-07 14:49:19,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696719673] [2019-12-07 14:49:19,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696719673] [2019-12-07 14:49:19,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788119783] [2019-12-07 14:49:19,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:19,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,043 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-12-07 14:49:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,074 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-12-07 14:49:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:19,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 14:49:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,078 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 14:49:19,078 INFO L226 Difference]: Without dead ends: 1072 [2019-12-07 14:49:19,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-12-07 14:49:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-12-07 14:49:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-12-07 14:49:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-12-07 14:49:19,109 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-12-07 14:49:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,109 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-12-07 14:49:19,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-12-07 14:49:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 14:49:19,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,111 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:19,111 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-12-07 14:49:19,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872584782] [2019-12-07 14:49:19,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872584782] [2019-12-07 14:49:19,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:19,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605248172] [2019-12-07 14:49:19,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:19,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,131 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-12-07 14:49:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,175 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-12-07 14:49:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:19,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 14:49:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,181 INFO L225 Difference]: With dead ends: 1999 [2019-12-07 14:49:19,181 INFO L226 Difference]: Without dead ends: 1006 [2019-12-07 14:49:19,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-07 14:49:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-12-07 14:49:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-12-07 14:49:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-12-07 14:49:19,215 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-12-07 14:49:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,215 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-12-07 14:49:19,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-12-07 14:49:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 14:49:19,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,216 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:49:19,217 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-12-07 14:49:19,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39480284] [2019-12-07 14:49:19,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39480284] [2019-12-07 14:49:19,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:19,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591379432] [2019-12-07 14:49:19,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:19,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:19,243 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-12-07 14:49:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,289 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-12-07 14:49:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:19,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 14:49:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,293 INFO L225 Difference]: With dead ends: 1579 [2019-12-07 14:49:19,293 INFO L226 Difference]: Without dead ends: 940 [2019-12-07 14:49:19,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-12-07 14:49:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-12-07 14:49:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-12-07 14:49:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-12-07 14:49:19,331 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-12-07 14:49:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,331 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-12-07 14:49:19,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-12-07 14:49:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 14:49:19,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,333 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 14:49:19,333 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-12-07 14:49:19,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882397401] [2019-12-07 14:49:19,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882397401] [2019-12-07 14:49:19,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:19,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348820152] [2019-12-07 14:49:19,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:19,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:19,361 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-12-07 14:49:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,411 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-12-07 14:49:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:19,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 14:49:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,416 INFO L225 Difference]: With dead ends: 1579 [2019-12-07 14:49:19,416 INFO L226 Difference]: Without dead ends: 940 [2019-12-07 14:49:19,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-12-07 14:49:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-12-07 14:49:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-12-07 14:49:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-12-07 14:49:19,456 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-12-07 14:49:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,456 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-12-07 14:49:19,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-12-07 14:49:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 14:49:19,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,458 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 14:49:19,458 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-12-07 14:49:19,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233512977] [2019-12-07 14:49:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233512977] [2019-12-07 14:49:19,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:19,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433781424] [2019-12-07 14:49:19,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:19,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,477 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-12-07 14:49:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,543 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-12-07 14:49:19,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:19,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 14:49:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,549 INFO L225 Difference]: With dead ends: 2176 [2019-12-07 14:49:19,549 INFO L226 Difference]: Without dead ends: 1537 [2019-12-07 14:49:19,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-12-07 14:49:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-12-07 14:49:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-12-07 14:49:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-12-07 14:49:19,604 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-12-07 14:49:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,604 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-12-07 14:49:19,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-12-07 14:49:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:49:19,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,606 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 14:49:19,606 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-12-07 14:49:19,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496932141] [2019-12-07 14:49:19,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496932141] [2019-12-07 14:49:19,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:19,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282813518] [2019-12-07 14:49:19,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:19,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:19,635 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-12-07 14:49:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,719 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-12-07 14:49:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:19,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:49:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,724 INFO L225 Difference]: With dead ends: 1591 [2019-12-07 14:49:19,724 INFO L226 Difference]: Without dead ends: 934 [2019-12-07 14:49:19,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-12-07 14:49:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-12-07 14:49:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-12-07 14:49:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-12-07 14:49:19,776 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-12-07 14:49:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,776 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-12-07 14:49:19,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-12-07 14:49:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:49:19,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,777 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 14:49:19,777 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-12-07 14:49:19,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746860565] [2019-12-07 14:49:19,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746860565] [2019-12-07 14:49:19,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:19,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86572477] [2019-12-07 14:49:19,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:19,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,797 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-12-07 14:49:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:19,874 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-12-07 14:49:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:19,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 14:49:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:19,880 INFO L225 Difference]: With dead ends: 2188 [2019-12-07 14:49:19,880 INFO L226 Difference]: Without dead ends: 1555 [2019-12-07 14:49:19,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-12-07 14:49:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-12-07 14:49:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-12-07 14:49:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-12-07 14:49:19,927 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-12-07 14:49:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:19,927 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-12-07 14:49:19,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-12-07 14:49:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:49:19,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:19,929 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 14:49:19,929 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-12-07 14:49:19,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:19,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286154646] [2019-12-07 14:49:19,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:19,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286154646] [2019-12-07 14:49:19,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:19,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:19,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518003708] [2019-12-07 14:49:19,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:19,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:19,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:19,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:19,947 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-12-07 14:49:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:20,038 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-12-07 14:49:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:20,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 14:49:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:20,044 INFO L225 Difference]: With dead ends: 2220 [2019-12-07 14:49:20,044 INFO L226 Difference]: Without dead ends: 1563 [2019-12-07 14:49:20,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-07 14:49:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-12-07 14:49:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-12-07 14:49:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-12-07 14:49:20,109 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-12-07 14:49:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:20,109 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-12-07 14:49:20,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-12-07 14:49:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:49:20,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:20,111 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:20,111 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-12-07 14:49:20,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:20,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498660048] [2019-12-07 14:49:20,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:20,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498660048] [2019-12-07 14:49:20,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270474453] [2019-12-07 14:49:20,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:20,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:49:20,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:49:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:20,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:49:20,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-12-07 14:49:20,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527074250] [2019-12-07 14:49:20,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:20,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:20,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:20,283 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-12-07 14:49:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:20,442 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-12-07 14:49:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:20,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 14:49:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:20,449 INFO L225 Difference]: With dead ends: 2609 [2019-12-07 14:49:20,449 INFO L226 Difference]: Without dead ends: 1906 [2019-12-07 14:49:20,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-12-07 14:49:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-12-07 14:49:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-12-07 14:49:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-12-07 14:49:20,543 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-12-07 14:49:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:20,543 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-12-07 14:49:20,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-12-07 14:49:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:49:20,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:20,545 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:20,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:20,746 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-12-07 14:49:20,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:20,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086647917] [2019-12-07 14:49:20,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:20,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086647917] [2019-12-07 14:49:20,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:20,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:20,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237460684] [2019-12-07 14:49:20,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:20,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:20,771 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-12-07 14:49:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:20,908 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-12-07 14:49:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:20,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 14:49:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:20,918 INFO L225 Difference]: With dead ends: 3706 [2019-12-07 14:49:20,918 INFO L226 Difference]: Without dead ends: 2603 [2019-12-07 14:49:20,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-12-07 14:49:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-12-07 14:49:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-12-07 14:49:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-12-07 14:49:20,992 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-12-07 14:49:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:20,993 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-12-07 14:49:20,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-12-07 14:49:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:49:20,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:20,995 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:20,995 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-12-07 14:49:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:49:20,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419661065] [2019-12-07 14:49:20,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:21,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419661065] [2019-12-07 14:49:21,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:21,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:21,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395913697] [2019-12-07 14:49:21,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:21,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:49:21,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:21,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:21,020 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-12-07 14:49:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:21,069 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-12-07 14:49:21,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:21,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 14:49:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:21,069 INFO L225 Difference]: With dead ends: 1970 [2019-12-07 14:49:21,069 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:49:21,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:49:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:49:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:49:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:49:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:49:21,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-12-07 14:49:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:21,072 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:49:21,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:49:21,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:49:21,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:49:22,392 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-12-07 14:49:22,872 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:23,220 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-12-07 14:49:23,471 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:23,625 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:24,171 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-12-07 14:49:24,319 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:24,749 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:25,147 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:25,252 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:25,441 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:25,557 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:25,974 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-12-07 14:49:26,547 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-12-07 14:49:26,763 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:27,154 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:27,266 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:27,646 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:27,972 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:28,196 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 14:49:28,429 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-07 14:49:28,589 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 14:49:29,306 WARN L192 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:29,427 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-12-07 14:49:29,840 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:30,120 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-12-07 14:49:30,501 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:49:31,162 WARN L192 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-12-07 14:49:32,080 WARN L192 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-07 14:49:32,083 INFO L246 CegarLoopResult]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-12-07 14:49:32,083 INFO L249 CegarLoopResult]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-12-07 14:49:32,083 INFO L242 CegarLoopResult]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L242 CegarLoopResult]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= 1 ~b1_req_up~0)) (.cse15 (<= 2 ~z_ev~0)) (.cse16 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~b0_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L242 CegarLoopResult]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-12-07 14:49:32,084 INFO L246 CegarLoopResult]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L242 CegarLoopResult]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,085 INFO L242 CegarLoopResult]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-12-07 14:49:32,085 INFO L246 CegarLoopResult]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L242 CegarLoopResult]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse19 (= ~b1_ev~0 0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= ~d1_req_up~0 1)) (.cse11 (= 0 ~z_val_t~0)) (.cse12 (<= ~z_val~0 0)) (.cse20 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse18 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-12-07 14:49:32,086 INFO L242 CegarLoopResult]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L276(line 276) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-12-07 14:49:32,086 INFO L246 CegarLoopResult]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L242 CegarLoopResult]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L242 CegarLoopResult]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L242 CegarLoopResult]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,087 INFO L246 CegarLoopResult]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-12-07 14:49:32,087 INFO L242 CegarLoopResult]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,088 INFO L242 CegarLoopResult]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (<= 1 ~d0_val_t~0) (= 1 ~b1_req_up~0) (<= 2 ~z_ev~0) (= ~d0_req_up~0 1)) [2019-12-07 14:49:32,088 INFO L242 CegarLoopResult]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse20 (<= 2 ~b0_ev~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse21 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~d1_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse8 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-12-07 14:49:32,088 INFO L242 CegarLoopResult]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-12-07 14:49:32,088 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:49:32,089 INFO L242 CegarLoopResult]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,089 INFO L242 CegarLoopResult]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,089 INFO L242 CegarLoopResult]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,090 INFO L242 CegarLoopResult]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,090 INFO L242 CegarLoopResult]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,090 INFO L246 CegarLoopResult]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-12-07 14:49:32,090 INFO L246 CegarLoopResult]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-12-07 14:49:32,090 INFO L246 CegarLoopResult]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-12-07 14:49:32,090 INFO L246 CegarLoopResult]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-12-07 14:49:32,090 INFO L246 CegarLoopResult]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L246 CegarLoopResult]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L246 CegarLoopResult]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L246 CegarLoopResult]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L246 CegarLoopResult]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:49:32,091 INFO L242 CegarLoopResult]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,092 INFO L242 CegarLoopResult]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-12-07 14:49:32,092 INFO L242 CegarLoopResult]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L423(line 423) no Hoare annotation was computed. [2019-12-07 14:49:32,092 INFO L246 CegarLoopResult]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L249 CegarLoopResult]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,093 INFO L246 CegarLoopResult]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L246 CegarLoopResult]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-12-07 14:49:32,094 INFO L242 CegarLoopResult]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,095 INFO L242 CegarLoopResult]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~d0_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,095 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 14:49:32,095 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-12-07 14:49:32,095 INFO L246 CegarLoopResult]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-12-07 14:49:32,095 INFO L242 CegarLoopResult]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 14:49:32,096 INFO L242 CegarLoopResult]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,096 INFO L242 CegarLoopResult]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,096 INFO L242 CegarLoopResult]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,096 INFO L242 CegarLoopResult]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,097 INFO L242 CegarLoopResult]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 14:49:32,097 INFO L242 CegarLoopResult]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-12-07 14:49:32,097 INFO L246 CegarLoopResult]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-12-07 14:49:32,097 INFO L246 CegarLoopResult]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-12-07 14:49:32,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:49:32 BoogieIcfgContainer [2019-12-07 14:49:32,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:49:32,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:49:32,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:49:32,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:49:32,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:17" (3/4) ... [2019-12-07 14:49:32,162 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:49:32,176 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 14:49:32,177 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:49:32,266 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5e33432a-8ad9-4327-ae76-f1079a0d0b79/bin/uautomizer/witness.graphml [2019-12-07 14:49:32,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:49:32,267 INFO L168 Benchmark]: Toolchain (without parser) took 15369.57 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.1 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -361.9 MB). Peak memory consumption was 93.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,267 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:49:32,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,268 INFO L168 Benchmark]: Boogie Preprocessor took 21.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:49:32,268 INFO L168 Benchmark]: RCFGBuilder took 313.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,269 INFO L168 Benchmark]: TraceAbstraction took 14663.83 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -278.5 MB). Peak memory consumption was 551.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,269 INFO L168 Benchmark]: Witness Printer took 107.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:32,270 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 313.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14663.83 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 360.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -278.5 MB). Peak memory consumption was 551.6 MB. Max. memory is 11.5 GB. * Witness Printer took 107.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && b0_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1 - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 2531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5972 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63852 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32535 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...