./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/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 f29aa323a0a92d5a9d9b59bc37634431cad4c2bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:46:31,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:46:31,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:46:31,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:46:31,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:46:31,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:46:31,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:46:31,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:46:31,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:46:31,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:46:31,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:46:31,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:46:31,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:46:31,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:46:31,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:46:31,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:46:31,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:46:31,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:46:31,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:46:31,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:46:31,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:46:31,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:46:31,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:46:31,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:46:31,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:46:31,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:46:31,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:46:31,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:46:31,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:46:31,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:46:31,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:46:31,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:46:31,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:46:31,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:46:31,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:46:31,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:46:31,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:46:31,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:46:31,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:46:31,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:46:31,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:46:31,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:46:31,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:46:31,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:46:31,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:46:31,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:46:31,567 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:46:31,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:46:31,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:46:31,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:46:31,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:46:31,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:46:31,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:46:31,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:46:31,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:46:31,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:46:31,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:46:31,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:46:31,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:46:31,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:46:31,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:46:31,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:46:31,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:46:31,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:46:31,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:46:31,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:46:31,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:46:31,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:46:31,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:46:31,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:46:31,575 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_b703a737-c65d-453d-9b1c-57e859c01219/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 -> f29aa323a0a92d5a9d9b59bc37634431cad4c2bd [2019-11-15 21:46:31,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:46:31,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:46:31,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:46:31,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:46:31,642 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:46:31,644 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2019-11-15 21:46:31,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/data/2999719bb/a49cd8e14652409a9a880bef069c9b45/FLAGf4feda343 [2019-11-15 21:46:32,503 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:46:32,504 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2019-11-15 21:46:32,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/data/2999719bb/a49cd8e14652409a9a880bef069c9b45/FLAGf4feda343 [2019-11-15 21:46:33,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/data/2999719bb/a49cd8e14652409a9a880bef069c9b45 [2019-11-15 21:46:33,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:46:33,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:46:33,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:46:33,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:46:33,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:46:33,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:46:33" (1/1) ... [2019-11-15 21:46:33,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532072ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:33, skipping insertion in model container [2019-11-15 21:46:33,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:46:33" (1/1) ... [2019-11-15 21:46:33,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:46:33,158 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:46:34,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:46:34,113 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:46:34,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:46:34,468 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:46:34,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34 WrapperNode [2019-11-15 21:46:34,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:46:34,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:46:34,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:46:34,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:46:34,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:46:34,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:46:34,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:46:34,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:46:34,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... [2019-11-15 21:46:34,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:46:34,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:46:34,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:46:34,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:46:34,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/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-11-15 21:46:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:46:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:46:39,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:46:39,697 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:46:39,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:46:39 BoogieIcfgContainer [2019-11-15 21:46:39,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:46:39,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:46:39,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:46:39,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:46:39,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:46:33" (1/3) ... [2019-11-15 21:46:39,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421dee5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:46:39, skipping insertion in model container [2019-11-15 21:46:39,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:34" (2/3) ... [2019-11-15 21:46:39,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421dee5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:46:39, skipping insertion in model container [2019-11-15 21:46:39,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:46:39" (3/3) ... [2019-11-15 21:46:39,707 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label16.c [2019-11-15 21:46:39,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:46:39,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:46:39,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:46:39,792 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:46:39,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:46:39,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:46:39,793 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:46:39,793 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:46:39,793 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:46:39,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:46:39,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:46:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 21:46:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 21:46:39,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:39,855 INFO L380 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] [2019-11-15 21:46:39,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:46:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2019-11-15 21:46:39,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:39,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176679154] [2019-11-15 21:46:39,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:39,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:39,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:40,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176679154] [2019-11-15 21:46:40,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:40,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:46:40,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337020815] [2019-11-15 21:46:40,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:46:40,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:46:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:40,324 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 21:46:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:46,643 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-15 21:46:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:46:46,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 21:46:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:46,674 INFO L225 Difference]: With dead ends: 1470 [2019-11-15 21:46:46,675 INFO L226 Difference]: Without dead ends: 978 [2019-11-15 21:46:46,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-15 21:46:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-15 21:46:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-15 21:46:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-15 21:46:46,822 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 62 [2019-11-15 21:46:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:46,823 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-15 21:46:46,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:46:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-15 21:46:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 21:46:46,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:46,832 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:46,833 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:46:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2081040869, now seen corresponding path program 1 times [2019-11-15 21:46:46,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:46,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369627562] [2019-11-15 21:46:46,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:46,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:47,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369627562] [2019-11-15 21:46:47,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:47,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:46:47,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753689613] [2019-11-15 21:46:47,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:46:47,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:46:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:47,141 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-11-15 21:46:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:53,302 INFO L93 Difference]: Finished difference Result 3755 states and 5687 transitions. [2019-11-15 21:46:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:46:53,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-15 21:46:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:53,322 INFO L225 Difference]: With dead ends: 3755 [2019-11-15 21:46:53,322 INFO L226 Difference]: Without dead ends: 2781 [2019-11-15 21:46:53,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-11-15 21:46:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2779. [2019-11-15 21:46:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-11-15 21:46:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3749 transitions. [2019-11-15 21:46:53,401 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3749 transitions. Word has length 127 [2019-11-15 21:46:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:53,402 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3749 transitions. [2019-11-15 21:46:53,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:46:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3749 transitions. [2019-11-15 21:46:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 21:46:53,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:53,415 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:53,415 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:46:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 146795855, now seen corresponding path program 1 times [2019-11-15 21:46:53,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:53,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660030618] [2019-11-15 21:46:53,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:53,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:53,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 119 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:46:53,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660030618] [2019-11-15 21:46:53,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981060130] [2019-11-15 21:46:53,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/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-11-15 21:46:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:46:53,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:53,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:46:53,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 21:46:53,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495369748] [2019-11-15 21:46:53,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:46:53,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:46:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:53,933 INFO L87 Difference]: Start difference. First operand 2779 states and 3749 transitions. Second operand 3 states. [2019-11-15 21:46:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:56,449 INFO L93 Difference]: Finished difference Result 7949 states and 10778 transitions. [2019-11-15 21:46:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:46:56,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-15 21:46:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:56,496 INFO L225 Difference]: With dead ends: 7949 [2019-11-15 21:46:56,496 INFO L226 Difference]: Without dead ends: 5172 [2019-11-15 21:46:56,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-11-15 21:46:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 3077. [2019-11-15 21:46:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-11-15 21:46:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4101 transitions. [2019-11-15 21:46:56,602 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4101 transitions. Word has length 232 [2019-11-15 21:46:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:56,604 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 4101 transitions. [2019-11-15 21:46:56,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:46:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4101 transitions. [2019-11-15 21:46:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-15 21:46:56,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:56,614 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:46:56,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:56,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:46:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash -966314421, now seen corresponding path program 1 times [2019-11-15 21:46:56,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:56,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697155763] [2019-11-15 21:46:56,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:56,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:56,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 21:46:57,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697155763] [2019-11-15 21:46:57,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:57,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:46:57,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251601078] [2019-11-15 21:46:57,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:46:57,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:57,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:46:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:46:57,713 INFO L87 Difference]: Start difference. First operand 3077 states and 4101 transitions. Second operand 5 states. [2019-11-15 21:47:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:03,426 INFO L93 Difference]: Finished difference Result 7350 states and 9514 transitions. [2019-11-15 21:47:03,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:03,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 412 [2019-11-15 21:47:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:03,455 INFO L225 Difference]: With dead ends: 7350 [2019-11-15 21:47:03,456 INFO L226 Difference]: Without dead ends: 4275 [2019-11-15 21:47:03,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-11-15 21:47:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3975. [2019-11-15 21:47:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3975 states. [2019-11-15 21:47:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 5065 transitions. [2019-11-15 21:47:03,561 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 5065 transitions. Word has length 412 [2019-11-15 21:47:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:03,562 INFO L462 AbstractCegarLoop]: Abstraction has 3975 states and 5065 transitions. [2019-11-15 21:47:03,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 5065 transitions. [2019-11-15 21:47:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-11-15 21:47:03,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:03,577 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:47:03,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 478727325, now seen corresponding path program 1 times [2019-11-15 21:47:03,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:03,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867665482] [2019-11-15 21:47:03,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:03,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:03,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:47:04,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867665482] [2019-11-15 21:47:04,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:04,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:04,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747480481] [2019-11-15 21:47:04,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:04,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:04,252 INFO L87 Difference]: Start difference. First operand 3975 states and 5065 transitions. Second operand 4 states. [2019-11-15 21:47:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:07,492 INFO L93 Difference]: Finished difference Result 9748 states and 12676 transitions. [2019-11-15 21:47:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:07,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 486 [2019-11-15 21:47:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:07,523 INFO L225 Difference]: With dead ends: 9748 [2019-11-15 21:47:07,524 INFO L226 Difference]: Without dead ends: 5775 [2019-11-15 21:47:07,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-11-15 21:47:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5472. [2019-11-15 21:47:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5472 states. [2019-11-15 21:47:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 6856 transitions. [2019-11-15 21:47:07,661 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 6856 transitions. Word has length 486 [2019-11-15 21:47:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:07,663 INFO L462 AbstractCegarLoop]: Abstraction has 5472 states and 6856 transitions. [2019-11-15 21:47:07,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 6856 transitions. [2019-11-15 21:47:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-11-15 21:47:07,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:07,679 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:47:07,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1964567663, now seen corresponding path program 1 times [2019-11-15 21:47:07,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:07,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043505405] [2019-11-15 21:47:07,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:07,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:07,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 21:47:08,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043505405] [2019-11-15 21:47:08,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:08,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:08,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652997248] [2019-11-15 21:47:08,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:08,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:08,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:08,387 INFO L87 Difference]: Start difference. First operand 5472 states and 6856 transitions. Second operand 4 states. [2019-11-15 21:47:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:13,802 INFO L93 Difference]: Finished difference Result 11539 states and 14365 transitions. [2019-11-15 21:47:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:13,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 492 [2019-11-15 21:47:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:13,833 INFO L225 Difference]: With dead ends: 11539 [2019-11-15 21:47:13,834 INFO L226 Difference]: Without dead ends: 6069 [2019-11-15 21:47:13,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2019-11-15 21:47:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 5767. [2019-11-15 21:47:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 21:47:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6799 transitions. [2019-11-15 21:47:13,960 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6799 transitions. Word has length 492 [2019-11-15 21:47:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:13,961 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6799 transitions. [2019-11-15 21:47:13,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6799 transitions. [2019-11-15 21:47:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2019-11-15 21:47:13,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:13,980 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:13,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1761323282, now seen corresponding path program 1 times [2019-11-15 21:47:13,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:13,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927810418] [2019-11-15 21:47:13,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:13,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:13,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 536 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 21:47:15,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927810418] [2019-11-15 21:47:15,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760752987] [2019-11-15 21:47:15,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:15,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:47:15,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 21:47:15,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:47:15,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 21:47:15,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514300495] [2019-11-15 21:47:15,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:15,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:15,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:15,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:47:15,952 INFO L87 Difference]: Start difference. First operand 5767 states and 6799 transitions. Second operand 3 states. [2019-11-15 21:47:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:18,859 INFO L93 Difference]: Finished difference Result 11532 states and 13596 transitions. [2019-11-15 21:47:18,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:18,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 515 [2019-11-15 21:47:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:18,886 INFO L225 Difference]: With dead ends: 11532 [2019-11-15 21:47:18,886 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 21:47:18,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 514 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:47:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 21:47:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-15 21:47:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 21:47:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6781 transitions. [2019-11-15 21:47:18,993 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6781 transitions. Word has length 515 [2019-11-15 21:47:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:18,994 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6781 transitions. [2019-11-15 21:47:18,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6781 transitions. [2019-11-15 21:47:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-11-15 21:47:19,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:19,002 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:47:19,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:19,207 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2049638368, now seen corresponding path program 1 times [2019-11-15 21:47:19,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:19,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715009288] [2019-11-15 21:47:19,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:19,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:19,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 21:47:19,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715009288] [2019-11-15 21:47:19,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:19,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:47:19,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475173983] [2019-11-15 21:47:19,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:47:19,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:47:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:19,641 INFO L87 Difference]: Start difference. First operand 5767 states and 6781 transitions. Second operand 4 states. [2019-11-15 21:47:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:22,761 INFO L93 Difference]: Finished difference Result 11534 states and 13566 transitions. [2019-11-15 21:47:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:47:22,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2019-11-15 21:47:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:22,773 INFO L225 Difference]: With dead ends: 11534 [2019-11-15 21:47:22,773 INFO L226 Difference]: Without dead ends: 5769 [2019-11-15 21:47:22,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:47:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-11-15 21:47:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5764. [2019-11-15 21:47:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-11-15 21:47:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6601 transitions. [2019-11-15 21:47:22,865 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6601 transitions. Word has length 518 [2019-11-15 21:47:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:22,866 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6601 transitions. [2019-11-15 21:47:22,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:47:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6601 transitions. [2019-11-15 21:47:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2019-11-15 21:47:22,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:22,875 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:22,875 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 703199593, now seen corresponding path program 1 times [2019-11-15 21:47:22,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:22,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191197474] [2019-11-15 21:47:22,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:22,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:22,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 573 proven. 3 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 21:47:24,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191197474] [2019-11-15 21:47:24,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900829660] [2019-11-15 21:47:24,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:24,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:47:24,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-15 21:47:24,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:47:24,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 21:47:24,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573864378] [2019-11-15 21:47:24,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:24,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:47:24,860 INFO L87 Difference]: Start difference. First operand 5764 states and 6601 transitions. Second operand 3 states. [2019-11-15 21:47:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:27,398 INFO L93 Difference]: Finished difference Result 16022 states and 18422 transitions. [2019-11-15 21:47:27,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:27,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 550 [2019-11-15 21:47:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:27,416 INFO L225 Difference]: With dead ends: 16022 [2019-11-15 21:47:27,416 INFO L226 Difference]: Without dead ends: 10260 [2019-11-15 21:47:27,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:47:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2019-11-15 21:47:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9953. [2019-11-15 21:47:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9953 states. [2019-11-15 21:47:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9953 states to 9953 states and 11216 transitions. [2019-11-15 21:47:27,560 INFO L78 Accepts]: Start accepts. Automaton has 9953 states and 11216 transitions. Word has length 550 [2019-11-15 21:47:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:27,561 INFO L462 AbstractCegarLoop]: Abstraction has 9953 states and 11216 transitions. [2019-11-15 21:47:27,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9953 states and 11216 transitions. [2019-11-15 21:47:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-11-15 21:47:27,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:27,572 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:47:27,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:27,778 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1248358995, now seen corresponding path program 1 times [2019-11-15 21:47:27,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:27,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145590664] [2019-11-15 21:47:27,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:27,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:27,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-11-15 21:47:28,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145590664] [2019-11-15 21:47:28,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:28,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:47:28,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600941442] [2019-11-15 21:47:28,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:28,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:28,204 INFO L87 Difference]: Start difference. First operand 9953 states and 11216 transitions. Second operand 3 states. [2019-11-15 21:47:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:30,205 INFO L93 Difference]: Finished difference Result 20201 states and 22769 transitions. [2019-11-15 21:47:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:30,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 563 [2019-11-15 21:47:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:30,220 INFO L225 Difference]: With dead ends: 20201 [2019-11-15 21:47:30,220 INFO L226 Difference]: Without dead ends: 10250 [2019-11-15 21:47:30,230 INFO L600 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-11-15 21:47:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2019-11-15 21:47:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 9951. [2019-11-15 21:47:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9951 states. [2019-11-15 21:47:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9951 states to 9951 states and 11212 transitions. [2019-11-15 21:47:30,366 INFO L78 Accepts]: Start accepts. Automaton has 9951 states and 11212 transitions. Word has length 563 [2019-11-15 21:47:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:30,367 INFO L462 AbstractCegarLoop]: Abstraction has 9951 states and 11212 transitions. [2019-11-15 21:47:30,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9951 states and 11212 transitions. [2019-11-15 21:47:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-11-15 21:47:30,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:30,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:30,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash -939629100, now seen corresponding path program 1 times [2019-11-15 21:47:30,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:30,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535714090] [2019-11-15 21:47:30,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:30,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:30,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 649 proven. 3 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 21:47:31,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535714090] [2019-11-15 21:47:31,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246541147] [2019-11-15 21:47:31,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:32,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:47:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:32,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:47:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 613 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 21:47:32,634 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:47:32,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 21:47:32,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675555809] [2019-11-15 21:47:32,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:47:32,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:47:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:47:32,637 INFO L87 Difference]: Start difference. First operand 9951 states and 11212 transitions. Second operand 9 states. [2019-11-15 21:47:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:40,762 INFO L93 Difference]: Finished difference Result 25735 states and 28732 transitions. [2019-11-15 21:47:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:47:40,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 626 [2019-11-15 21:47:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:40,774 INFO L225 Difference]: With dead ends: 25735 [2019-11-15 21:47:40,774 INFO L226 Difference]: Without dead ends: 11145 [2019-11-15 21:47:40,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 623 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:47:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11145 states. [2019-11-15 21:47:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11145 to 10846. [2019-11-15 21:47:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10846 states. [2019-11-15 21:47:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 11342 transitions. [2019-11-15 21:47:40,925 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 11342 transitions. Word has length 626 [2019-11-15 21:47:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:40,926 INFO L462 AbstractCegarLoop]: Abstraction has 10846 states and 11342 transitions. [2019-11-15 21:47:40,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:47:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 11342 transitions. [2019-11-15 21:47:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-11-15 21:47:40,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:40,943 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:41,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:41,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 543791112, now seen corresponding path program 1 times [2019-11-15 21:47:41,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:41,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842471203] [2019-11-15 21:47:41,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:41,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:41,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-15 21:47:41,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842471203] [2019-11-15 21:47:41,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:41,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:47:41,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035021248] [2019-11-15 21:47:41,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:47:41,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:47:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:41,762 INFO L87 Difference]: Start difference. First operand 10846 states and 11342 transitions. Second operand 5 states. [2019-11-15 21:47:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:44,309 INFO L93 Difference]: Finished difference Result 28270 states and 29565 transitions. [2019-11-15 21:47:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:47:44,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 687 [2019-11-15 21:47:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:44,324 INFO L225 Difference]: With dead ends: 28270 [2019-11-15 21:47:44,324 INFO L226 Difference]: Without dead ends: 17426 [2019-11-15 21:47:44,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:47:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17426 states. [2019-11-15 21:47:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17426 to 12039. [2019-11-15 21:47:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12039 states. [2019-11-15 21:47:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 12553 transitions. [2019-11-15 21:47:44,468 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 12553 transitions. Word has length 687 [2019-11-15 21:47:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:44,469 INFO L462 AbstractCegarLoop]: Abstraction has 12039 states and 12553 transitions. [2019-11-15 21:47:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:47:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 12553 transitions. [2019-11-15 21:47:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-11-15 21:47:44,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:44,483 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:44,483 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1908358813, now seen corresponding path program 1 times [2019-11-15 21:47:44,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:44,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291400552] [2019-11-15 21:47:44,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:44,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:44,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-15 21:47:45,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291400552] [2019-11-15 21:47:45,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:45,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:47:45,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256751250] [2019-11-15 21:47:45,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:45,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:45,142 INFO L87 Difference]: Start difference. First operand 12039 states and 12553 transitions. Second operand 3 states. [2019-11-15 21:47:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:46,563 INFO L93 Difference]: Finished difference Result 26467 states and 27614 transitions. [2019-11-15 21:47:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:46,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 692 [2019-11-15 21:47:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:46,575 INFO L225 Difference]: With dead ends: 26467 [2019-11-15 21:47:46,575 INFO L226 Difference]: Without dead ends: 14430 [2019-11-15 21:47:46,581 INFO L600 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-11-15 21:47:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14430 states. [2019-11-15 21:47:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14430 to 11440. [2019-11-15 21:47:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2019-11-15 21:47:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 11904 transitions. [2019-11-15 21:47:46,713 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 11904 transitions. Word has length 692 [2019-11-15 21:47:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:46,714 INFO L462 AbstractCegarLoop]: Abstraction has 11440 states and 11904 transitions. [2019-11-15 21:47:46,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 11904 transitions. [2019-11-15 21:47:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-11-15 21:47:46,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:46,727 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:47:46,728 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1116494967, now seen corresponding path program 1 times [2019-11-15 21:47:46,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:46,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763242102] [2019-11-15 21:47:46,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:46,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:46,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-11-15 21:47:47,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763242102] [2019-11-15 21:47:47,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:47:47,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:47:47,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594671965] [2019-11-15 21:47:47,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:47,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:47,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:47:47,660 INFO L87 Difference]: Start difference. First operand 11440 states and 11904 transitions. Second operand 3 states. [2019-11-15 21:47:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:48,687 INFO L93 Difference]: Finished difference Result 21044 states and 21901 transitions. [2019-11-15 21:47:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:48,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 752 [2019-11-15 21:47:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:48,700 INFO L225 Difference]: With dead ends: 21044 [2019-11-15 21:47:48,700 INFO L226 Difference]: Without dead ends: 9606 [2019-11-15 21:47:48,705 INFO L600 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-11-15 21:47:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-11-15 21:47:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 8709. [2019-11-15 21:47:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8709 states. [2019-11-15 21:47:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 8969 transitions. [2019-11-15 21:47:48,806 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 8969 transitions. Word has length 752 [2019-11-15 21:47:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 8709 states and 8969 transitions. [2019-11-15 21:47:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 8969 transitions. [2019-11-15 21:47:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-11-15 21:47:48,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:48,818 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:48,818 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1610032020, now seen corresponding path program 1 times [2019-11-15 21:47:48,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:48,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383260124] [2019-11-15 21:47:48,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:48,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:48,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 424 proven. 60 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-11-15 21:47:49,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383260124] [2019-11-15 21:47:49,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798796846] [2019-11-15 21:47:49,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:50,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:47:50,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:50,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:50,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:50,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-11-15 21:47:51,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:47:51,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-15 21:47:51,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888544337] [2019-11-15 21:47:51,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:47:51,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:47:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:47:51,267 INFO L87 Difference]: Start difference. First operand 8709 states and 8969 transitions. Second operand 3 states. [2019-11-15 21:47:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:47:52,779 INFO L93 Difference]: Finished difference Result 18016 states and 18545 transitions. [2019-11-15 21:47:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:47:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 808 [2019-11-15 21:47:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:47:52,789 INFO L225 Difference]: With dead ends: 18016 [2019-11-15 21:47:52,789 INFO L226 Difference]: Without dead ends: 9309 [2019-11-15 21:47:52,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:47:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9309 states. [2019-11-15 21:47:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9309 to 9009. [2019-11-15 21:47:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2019-11-15 21:47:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 9271 transitions. [2019-11-15 21:47:52,884 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 9271 transitions. Word has length 808 [2019-11-15 21:47:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:47:52,884 INFO L462 AbstractCegarLoop]: Abstraction has 9009 states and 9271 transitions. [2019-11-15 21:47:52,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:47:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 9271 transitions. [2019-11-15 21:47:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2019-11-15 21:47:52,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:47:52,896 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:47:53,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:53,097 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:47:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:47:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash -116249522, now seen corresponding path program 1 times [2019-11-15 21:47:53,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:47:53,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851882424] [2019-11-15 21:47:53,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:53,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:47:53,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:47:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 163 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:47:56,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851882424] [2019-11-15 21:47:56,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765055357] [2019-11-15 21:47:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:47:56,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:56,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:56,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:56,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:47:56,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:47:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 677 proven. 54 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-15 21:47:58,273 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:47:58,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 15 [2019-11-15 21:47:58,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172313226] [2019-11-15 21:47:58,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:47:58,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:47:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:47:58,275 INFO L87 Difference]: Start difference. First operand 9009 states and 9271 transitions. Second operand 15 states. [2019-11-15 21:48:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:26,701 INFO L93 Difference]: Finished difference Result 28538 states and 29396 transitions. [2019-11-15 21:48:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:48:26,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 827 [2019-11-15 21:48:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:26,718 INFO L225 Difference]: With dead ends: 28538 [2019-11-15 21:48:26,718 INFO L226 Difference]: Without dead ends: 18921 [2019-11-15 21:48:26,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 842 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:48:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-11-15 21:48:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 10802. [2019-11-15 21:48:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10802 states. [2019-11-15 21:48:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10802 states to 10802 states and 11091 transitions. [2019-11-15 21:48:26,875 INFO L78 Accepts]: Start accepts. Automaton has 10802 states and 11091 transitions. Word has length 827 [2019-11-15 21:48:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:26,876 INFO L462 AbstractCegarLoop]: Abstraction has 10802 states and 11091 transitions. [2019-11-15 21:48:26,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:48:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10802 states and 11091 transitions. [2019-11-15 21:48:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-15 21:48:26,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:26,889 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:48:27,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:27,093 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2066422329, now seen corresponding path program 1 times [2019-11-15 21:48:27,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:27,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931840461] [2019-11-15 21:48:27,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 796 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-11-15 21:48:28,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931840461] [2019-11-15 21:48:28,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:28,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:48:28,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151077515] [2019-11-15 21:48:28,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:48:28,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:48:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:48:28,088 INFO L87 Difference]: Start difference. First operand 10802 states and 11091 transitions. Second operand 3 states. [2019-11-15 21:48:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:29,248 INFO L93 Difference]: Finished difference Result 22805 states and 23442 transitions. [2019-11-15 21:48:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:48:29,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2019-11-15 21:48:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:29,265 INFO L225 Difference]: With dead ends: 22805 [2019-11-15 21:48:29,265 INFO L226 Difference]: Without dead ends: 12304 [2019-11-15 21:48:29,297 INFO L600 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-11-15 21:48:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12304 states. [2019-11-15 21:48:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12304 to 10800. [2019-11-15 21:48:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10800 states. [2019-11-15 21:48:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10800 states to 10800 states and 11096 transitions. [2019-11-15 21:48:29,408 INFO L78 Accepts]: Start accepts. Automaton has 10800 states and 11096 transitions. Word has length 847 [2019-11-15 21:48:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:29,409 INFO L462 AbstractCegarLoop]: Abstraction has 10800 states and 11096 transitions. [2019-11-15 21:48:29,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:48:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10800 states and 11096 transitions. [2019-11-15 21:48:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-11-15 21:48:29,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:29,424 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:48:29,425 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1095195449, now seen corresponding path program 1 times [2019-11-15 21:48:29,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:29,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348349574] [2019-11-15 21:48:29,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 871 proven. 139 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-15 21:48:30,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348349574] [2019-11-15 21:48:30,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517237134] [2019-11-15 21:48:30,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:30,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:48:30,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:48:30,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:48:30,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:30,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:31,170 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-11-15 21:48:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:48:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 823 proven. 187 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-15 21:48:32,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:48:32,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 21:48:32,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635826499] [2019-11-15 21:48:32,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:48:32,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:32,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:48:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:48:32,409 INFO L87 Difference]: Start difference. First operand 10800 states and 11096 transitions. Second operand 12 states. [2019-11-15 21:48:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:50,147 INFO L93 Difference]: Finished difference Result 29705 states and 30534 transitions. [2019-11-15 21:48:50,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 21:48:50,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 860 [2019-11-15 21:48:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:50,177 INFO L225 Difference]: With dead ends: 29705 [2019-11-15 21:48:50,177 INFO L226 Difference]: Without dead ends: 18303 [2019-11-15 21:48:50,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 21:48:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-11-15 21:48:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 10199. [2019-11-15 21:48:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10199 states. [2019-11-15 21:48:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 10369 transitions. [2019-11-15 21:48:50,410 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 10369 transitions. Word has length 860 [2019-11-15 21:48:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:50,410 INFO L462 AbstractCegarLoop]: Abstraction has 10199 states and 10369 transitions. [2019-11-15 21:48:50,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:48:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 10369 transitions. [2019-11-15 21:48:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2019-11-15 21:48:50,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:50,424 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 21:48:50,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:50,625 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1796046328, now seen corresponding path program 1 times [2019-11-15 21:48:50,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:50,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425616728] [2019-11-15 21:48:50,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 786 proven. 549 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 21:48:52,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425616728] [2019-11-15 21:48:52,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815925548] [2019-11-15 21:48:52,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:52,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:48:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:48:52,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:52,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:48:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:48:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:48:52,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:48:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1129 proven. 76 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-15 21:48:53,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:48:53,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-11-15 21:48:53,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942081396] [2019-11-15 21:48:53,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:48:53,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:48:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:48:53,948 INFO L87 Difference]: Start difference. First operand 10199 states and 10369 transitions. Second operand 14 states. [2019-11-15 21:49:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:04,181 INFO L93 Difference]: Finished difference Result 27119 states and 27548 transitions. [2019-11-15 21:49:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 21:49:04,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 917 [2019-11-15 21:49:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:04,197 INFO L225 Difference]: With dead ends: 27119 [2019-11-15 21:49:04,197 INFO L226 Difference]: Without dead ends: 16919 [2019-11-15 21:49:04,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 937 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:49:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16919 states. [2019-11-15 21:49:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16919 to 11992. [2019-11-15 21:49:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11992 states. [2019-11-15 21:49:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11992 states to 11992 states and 12172 transitions. [2019-11-15 21:49:04,366 INFO L78 Accepts]: Start accepts. Automaton has 11992 states and 12172 transitions. Word has length 917 [2019-11-15 21:49:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:04,367 INFO L462 AbstractCegarLoop]: Abstraction has 11992 states and 12172 transitions. [2019-11-15 21:49:04,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:49:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11992 states and 12172 transitions. [2019-11-15 21:49:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2019-11-15 21:49:04,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:04,384 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:04,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:04,588 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1966924578, now seen corresponding path program 1 times [2019-11-15 21:49:04,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:04,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573673589] [2019-11-15 21:49:04,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-15 21:49:05,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573673589] [2019-11-15 21:49:05,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:05,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:05,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862961824] [2019-11-15 21:49:05,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:05,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:05,714 INFO L87 Difference]: Start difference. First operand 11992 states and 12172 transitions. Second operand 5 states. [2019-11-15 21:49:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:07,748 INFO L93 Difference]: Finished difference Result 14697 states and 14911 transitions. [2019-11-15 21:49:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:49:07,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 929 [2019-11-15 21:49:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:07,751 INFO L225 Difference]: With dead ends: 14697 [2019-11-15 21:49:07,751 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:49:07,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:49:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:49:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:49:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:49:07,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 929 [2019-11-15 21:49:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:07,823 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:49:07,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:49:07,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:49:07,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:49:09,134 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 606 DAG size of output: 529 [2019-11-15 21:49:10,068 WARN L191 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 529 [2019-11-15 21:49:10,600 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 511 DAG size of output: 449 [2019-11-15 21:49:16,918 WARN L191 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 505 DAG size of output: 176 [2019-11-15 21:49:22,569 WARN L191 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 505 DAG size of output: 176 [2019-11-15 21:49:27,240 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 432 DAG size of output: 173 [2019-11-15 21:49:27,243 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,243 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,243 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,243 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,244 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,245 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,246 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 21:49:27,247 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:49:27,248 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,249 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,250 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 21:49:27,251 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:49:27,252 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,253 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,254 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,255 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,256 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:49:27,257 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,258 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,259 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:49:27,260 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,261 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,262 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse40 (+ ~a4~0 86))) (let ((.cse13 (<= .cse40 0)) (.cse32 (<= 0 (+ ~a0~0 44))) (.cse37 (+ ~a0~0 147))) (let ((.cse2 (= 4 ~a2~0)) (.cse17 (= 3 ~a2~0)) (.cse21 (< 0 .cse37)) (.cse22 (= 1 ~a2~0)) (.cse38 (+ ~a29~0 144)) (.cse4 (<= (+ ~a4~0 42) 0)) (.cse0 (let ((.cse41 (not (= 5 ~a2~0)))) (or (and .cse13 .cse41) (and .cse41 .cse32)))) (.cse23 (= 2 ~a2~0))) (let ((.cse8 (and .cse4 .cse0 .cse23)) (.cse18 (<= 0 (+ ~a29~0 600001))) (.cse30 (and .cse4 .cse22 (< 0 .cse38))) (.cse14 (<= 48792 ~a29~0)) (.cse31 (or (and .cse22 .cse32) (and .cse13 .cse22))) (.cse7 (and .cse13 .cse21)) (.cse10 (< 0 (+ ~a29~0 16))) (.cse25 (and .cse4 .cse0 .cse17)) (.cse20 (<= ~a29~0 43)) (.cse6 (<= (+ ~a0~0 148) 0)) (.cse9 (<= 2 ~a2~0)) (.cse19 (<= (+ ~a0~0 98) 0)) (.cse28 (not .cse23)) (.cse29 (< 0 .cse40)) (.cse5 (<= 0 (+ ~a29~0 140))) (.cse12 (not .cse2)) (.cse27 (exists ((v_~a29~0_899 Int)) (let ((.cse39 (mod v_~a29~0_899 63))) (and (<= .cse39 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse39 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse3 (<= ~a29~0 42)) (.cse34 (and .cse4 .cse0)) (.cse15 (<= .cse38 0)) (.cse16 (<= 0 (+ ~a29~0 599991))) (.cse11 (<= .cse37 0)) (.cse35 (< 43 ~a29~0)) (.cse24 (exists ((v_~a29~0_897 Int)) (let ((.cse36 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse36 (+ ~a29~0 14)) (not (= .cse36 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse1 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (and .cse4 .cse5 .cse6 .cse2)) (and .cse7 .cse1) (and .cse8 .cse5) (and .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse9 (and .cse13 .cse12) .cse14) (and (and .cse4 .cse6 .cse15 .cse2) .cse16) (and .cse0 .cse17 .cse1) (and (and (and .cse13 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse8) .cse15) .cse18) (and .cse19 .cse20 .cse21 .cse4 .cse22 .cse16) (and (and .cse4 .cse23) .cse19 .cse24) (and .cse18 (and .cse25 .cse15)) (and .cse18 (and .cse4 .cse11 .cse15 .cse17)) (and .cse13 (exists ((v_~a29~0_896 Int)) (let ((.cse26 (mod v_~a29~0_896 299928))) (and (= 0 .cse26) (<= (+ ~a29~0 173705) .cse26) (<= (+ v_~a29~0_896 144) 0)))) .cse1) (and .cse9 .cse27 .cse28 .cse29 .cse4 .cse6 .cse12) (and .cse30 .cse10 .cse29 .cse20) (and .cse30 .cse5 .cse6) (and (and .cse19 .cse4 .cse2) .cse14) (and .cse31 .cse1) (let ((.cse33 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse32 (<= 0 .cse33) .cse31 (<= .cse33 0))) (and .cse27 .cse20 .cse1 .cse4 (<= 0 (+ ~a0~0 97)) .cse22) (and .cse9 .cse10 (and .cse7 .cse12) .cse20) (and .cse10 .cse25 .cse20) (or (and .cse4 .cse6 .cse17 .cse16) (and .cse27 .cse11 .cse4 .cse17)) (and .cse9 .cse19 .cse4 .cse28 .cse29 .cse5 .cse12) (and (and .cse34 .cse27) .cse3 .cse2) (and .cse13 .cse17 .cse35) (and .cse34 .cse15 .cse2 .cse16) (and .cse0 .cse23 .cse1) (and .cse11 (and .cse23 .cse35)) (and .cse13 .cse24 .cse1)))))) [2019-11-15 21:49:27,263 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:49:27,263 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:49:27,263 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,263 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,263 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 21:49:27,264 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,265 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 21:49:27,265 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 21:49:27,265 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,265 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 21:49:27,265 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 21:49:27,265 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,266 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,267 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2019-11-15 21:49:27,267 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:49:27,267 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:49:27,267 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,267 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 21:49:27,268 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 21:49:27,268 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,268 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,268 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,268 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,269 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,269 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,270 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse40 (+ ~a4~0 86))) (let ((.cse37 (+ ~a0~0 147)) (.cse26 (<= .cse40 0)) (.cse33 (<= 0 (+ ~a0~0 44)))) (let ((.cse17 (= 3 ~a2~0)) (.cse0 (let ((.cse41 (not (= 5 ~a2~0)))) (or (and .cse26 .cse41) (and .cse41 .cse33)))) (.cse2 (= 4 ~a2~0)) (.cse7 (<= (+ ~a4~0 42) 0)) (.cse23 (= 1 ~a2~0)) (.cse38 (+ ~a29~0 144)) (.cse24 (= 2 ~a2~0)) (.cse22 (< 0 .cse37))) (let ((.cse3 (and .cse26 .cse22)) (.cse28 (not .cse24)) (.cse29 (< 0 .cse40)) (.cse31 (and .cse7 .cse23 (< 0 .cse38))) (.cse6 (<= 2 ~a2~0)) (.cse10 (not .cse2)) (.cse30 (or (and .cse23 .cse33) (and .cse26 .cse23))) (.cse15 (exists ((v_~a29~0_899 Int)) (let ((.cse39 (mod v_~a29~0_899 63))) (and (<= .cse39 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse39 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse5 (and .cse7 .cse0 .cse24)) (.cse18 (<= 0 (+ ~a29~0 600001))) (.cse8 (< 0 (+ ~a29~0 16))) (.cse19 (and .cse7 .cse0 .cse17)) (.cse21 (<= ~a29~0 43)) (.cse20 (<= (+ ~a0~0 98) 0)) (.cse32 (<= 48792 ~a29~0)) (.cse14 (and .cse7 .cse0)) (.cse12 (<= .cse38 0)) (.cse13 (<= 0 (+ ~a29~0 599991))) (.cse9 (<= .cse37 0)) (.cse35 (< 43 ~a29~0)) (.cse16 (<= ~a29~0 42)) (.cse4 (<= 0 (+ ~a29~0 140))) (.cse11 (<= (+ ~a0~0 148) 0)) (.cse25 (exists ((v_~a29~0_897 Int)) (let ((.cse36 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse36 (+ ~a29~0 14)) (not (= .cse36 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse1 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10) (and (and .cse7 .cse11 .cse12 .cse2) .cse13) (and (and .cse14 .cse15) .cse16 .cse2) (and (or (and .cse7 .cse11 .cse17) (and .cse15 .cse9 .cse7 .cse17)) .cse18) (and (and .cse19 .cse12) .cse18) (and .cse0 .cse17 .cse1) (and .cse20 .cse21 .cse22 .cse7 .cse23 .cse13) (and .cse18 (and .cse7 .cse9 .cse12 .cse17)) (and (and .cse7 .cse24) .cse20 .cse25) (and .cse8 (and .cse6 (and .cse3 .cse10) .cse21)) (and .cse26 (exists ((v_~a29~0_896 Int)) (let ((.cse27 (mod v_~a29~0_896 299928))) (and (= 0 .cse27) (<= (+ ~a29~0 173705) .cse27) (<= (+ v_~a29~0_896 144) 0)))) .cse1) (and .cse6 .cse15 .cse28 .cse29 .cse7 .cse11 .cse10) (and .cse6 .cse20 .cse7 .cse28 .cse29 .cse4 .cse10) (and .cse26 .cse30 .cse12) (and .cse31 .cse8 .cse29 .cse21) (and .cse31 .cse4 .cse11) (and .cse6 (and .cse26 .cse10) .cse32) (and .cse30 .cse1) (let ((.cse34 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse33 (<= 0 .cse34) .cse30 (<= .cse34 0))) (and .cse15 .cse21 .cse1 .cse7 (<= 0 (+ ~a0~0 97)) .cse23) (and (and (and .cse26 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5) .cse12) .cse18) (and .cse8 .cse19 .cse21) (and (and .cse20 .cse7 .cse2) .cse32) (and .cse26 .cse17 .cse35) (and .cse14 .cse12 .cse2 .cse13) (and .cse0 .cse24 .cse1) (and .cse9 (and .cse24 .cse35)) (and .cse16 (and .cse7 .cse4 .cse11 .cse2)) (and .cse26 .cse25 .cse1)))))) [2019-11-15 21:49:27,270 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,270 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:49:27,270 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:49:27,270 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,270 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:49:27,271 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,272 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,273 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,273 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,273 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,273 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:49:27,273 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,274 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,275 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,276 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,277 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,278 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,279 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,280 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,280 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,280 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,280 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,280 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse40 (+ ~a4~0 86))) (let ((.cse37 (+ ~a0~0 147)) (.cse26 (<= .cse40 0)) (.cse33 (<= 0 (+ ~a0~0 44)))) (let ((.cse17 (= 3 ~a2~0)) (.cse0 (let ((.cse41 (not (= 5 ~a2~0)))) (or (and .cse26 .cse41) (and .cse41 .cse33)))) (.cse2 (= 4 ~a2~0)) (.cse7 (<= (+ ~a4~0 42) 0)) (.cse23 (= 1 ~a2~0)) (.cse38 (+ ~a29~0 144)) (.cse24 (= 2 ~a2~0)) (.cse22 (< 0 .cse37))) (let ((.cse3 (and .cse26 .cse22)) (.cse28 (not .cse24)) (.cse29 (< 0 .cse40)) (.cse31 (and .cse7 .cse23 (< 0 .cse38))) (.cse6 (<= 2 ~a2~0)) (.cse10 (not .cse2)) (.cse30 (or (and .cse23 .cse33) (and .cse26 .cse23))) (.cse15 (exists ((v_~a29~0_899 Int)) (let ((.cse39 (mod v_~a29~0_899 63))) (and (<= .cse39 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse39 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse5 (and .cse7 .cse0 .cse24)) (.cse18 (<= 0 (+ ~a29~0 600001))) (.cse8 (< 0 (+ ~a29~0 16))) (.cse19 (and .cse7 .cse0 .cse17)) (.cse21 (<= ~a29~0 43)) (.cse20 (<= (+ ~a0~0 98) 0)) (.cse32 (<= 48792 ~a29~0)) (.cse14 (and .cse7 .cse0)) (.cse12 (<= .cse38 0)) (.cse13 (<= 0 (+ ~a29~0 599991))) (.cse9 (<= .cse37 0)) (.cse35 (< 43 ~a29~0)) (.cse16 (<= ~a29~0 42)) (.cse4 (<= 0 (+ ~a29~0 140))) (.cse11 (<= (+ ~a0~0 148) 0)) (.cse25 (exists ((v_~a29~0_897 Int)) (let ((.cse36 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse36 (+ ~a29~0 14)) (not (= .cse36 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse1 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse10) (and (and .cse7 .cse11 .cse12 .cse2) .cse13) (and (and .cse14 .cse15) .cse16 .cse2) (and (or (and .cse7 .cse11 .cse17) (and .cse15 .cse9 .cse7 .cse17)) .cse18) (and (and .cse19 .cse12) .cse18) (and .cse0 .cse17 .cse1) (and .cse20 .cse21 .cse22 .cse7 .cse23 .cse13) (and .cse18 (and .cse7 .cse9 .cse12 .cse17)) (and (and .cse7 .cse24) .cse20 .cse25) (and .cse8 (and .cse6 (and .cse3 .cse10) .cse21)) (and .cse26 (exists ((v_~a29~0_896 Int)) (let ((.cse27 (mod v_~a29~0_896 299928))) (and (= 0 .cse27) (<= (+ ~a29~0 173705) .cse27) (<= (+ v_~a29~0_896 144) 0)))) .cse1) (and .cse6 .cse15 .cse28 .cse29 .cse7 .cse11 .cse10) (and .cse6 .cse20 .cse7 .cse28 .cse29 .cse4 .cse10) (and .cse26 .cse30 .cse12) (and .cse31 .cse8 .cse29 .cse21) (and .cse31 .cse4 .cse11) (and .cse6 (and .cse26 .cse10) .cse32) (and .cse30 .cse1) (let ((.cse34 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse33 (<= 0 .cse34) .cse30 (<= .cse34 0))) (and .cse15 .cse21 .cse1 .cse7 (<= 0 (+ ~a0~0 97)) .cse23) (and (and (and .cse26 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5) .cse12) .cse18) (and .cse8 .cse19 .cse21) (and (and .cse20 .cse7 .cse2) .cse32) (and .cse26 .cse17 .cse35) (and .cse14 .cse12 .cse2 .cse13) (and .cse0 .cse24 .cse1) (and .cse9 (and .cse24 .cse35)) (and .cse16 (and .cse7 .cse4 .cse11 .cse2)) (and .cse26 .cse25 .cse1)))))) [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:49:27,281 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,282 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,283 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,284 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:49:27,285 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:49:27,286 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 21:49:27,287 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,288 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 21:49:27,289 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 21:49:27,289 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 21:49:27,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,398 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:49:27 BoogieIcfgContainer [2019-11-15 21:49:27,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:49:27,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:49:27,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:49:27,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:49:27,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:46:39" (3/4) ... [2019-11-15 21:49:27,409 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:49:27,458 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 21:49:27,462 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:49:27,508 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (0 <= a29 + 140 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 < a29 + 16 && (2 <= a2 && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) [2019-11-15 21:49:27,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (0 <= a29 + 140 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 < a29 + 16 && (2 <= a2 && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) [2019-11-15 21:49:27,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 140)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) && 0 <= a29 + 599991) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) [2019-11-15 21:49:27,732 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b703a737-c65d-453d-9b1c-57e859c01219/bin/uautomizer/witness.graphml [2019-11-15 21:49:27,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:49:27,734 INFO L168 Benchmark]: Toolchain (without parser) took 174678.84 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 944.7 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,734 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:49:27,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1413.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -129.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 248.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,735 INFO L168 Benchmark]: Boogie Preprocessor took 259.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,736 INFO L168 Benchmark]: RCFGBuilder took 4720.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.4 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,736 INFO L168 Benchmark]: TraceAbstraction took 167704.06 ms. Allocated memory was 1.3 GB in the beginning and 4.5 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,737 INFO L168 Benchmark]: Witness Printer took 328.03 ms. Allocated memory is still 4.5 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:27,739 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1413.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -129.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 248.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 259.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4720.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.4 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 167704.06 ms. Allocated memory was 1.3 GB in the beginning and 4.5 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 328.03 ms. Allocated memory is still 4.5 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 193]: 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: 1766]: Loop Invariant [2019-11-15 21:49:27,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (0 <= a29 + 140 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 < a29 + 16 && (2 <= a2 && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-15 21:49:27,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (0 <= a29 + 140 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 < a29 + 16 && (2 <= a2 && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-15 21:49:27,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-15 21:49:27,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-11-15 21:49:27,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-15 21:49:27,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2) || (a29 <= 42 && ((a4 + 42 <= 0 && 0 <= a29 + 140) && a0 + 148 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && 0 <= a29 + 140)) || ((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2))) || ((2 <= a2 && a4 + 86 <= 0 && !(4 == a2)) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && !(3 == input)) && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 2 == a2) && a29 + 144 <= 0) && 0 <= a29 + 600001)) || (((((a0 + 98 <= 0 && a29 <= 43) && 0 < a0 + 147) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599991)) || (((a4 + 42 <= 0 && 2 == a2) && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0))) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 + 144 <= 0)) || (0 <= a29 + 600001 && ((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && !(2 == a2)) && 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 148 <= 0) && !(4 == a2))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 < a29 + 16) && 0 < a4 + 86) && a29 <= 43)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && 0 <= a29 + 140) && a0 + 148 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 127 <= 0)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a29 <= 43) && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 97) && 1 == a2)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a0 + 147) && !(4 == a2)) && a29 <= 43)) || ((0 < a29 + 16 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 3 == a2) && a29 <= 43)) || (((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) && 0 <= a29 + 599991) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a0 + 147 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a29 <= 42) && 4 == a2)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 167.4s, OverallIterations: 20, TraceHistogramMax: 6, AutomataDifference: 114.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.4s, HoareTripleCheckerStatistics: 4396 SDtfs, 32517 SDslu, 1731 SDs, 0 SdLazy, 74248 SolverSat, 5733 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 94.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5600 GetRequests, 5415 SyntacticMatches, 21 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12039occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 36142 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 237 NumberOfFragments, 3044 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1228792 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1442942 FormulaSimplificationTreeSizeReductionInter, 16.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 17237 NumberOfCodeBlocks, 17237 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17209 ConstructedInterpolants, 461 QuantifiedInterpolants, 46122257 SizeOfPredicates, 14 NumberOfNonLiveVariables, 6356 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 20717/22748 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...