./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label27.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_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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 14831cf592bc13b54caac21143b5bc01f6bc3848 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:05:04,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:05:04,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:05:04,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:05:04,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:05:04,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:05:04,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:05:04,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:05:04,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:05:04,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:05:04,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:05:04,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:05:04,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:05:04,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:05:04,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:05:04,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:05:04,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:05:04,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:05:04,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:05:04,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:05:04,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:05:04,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:05:04,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:05:04,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:05:04,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:05:04,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:05:04,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:05:04,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:05:04,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:05:04,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:05:04,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:05:04,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:05:04,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:05:04,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:05:04,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:05:04,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:05:04,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:05:04,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:05:04,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:05:04,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:05:04,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:05:04,395 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:05:04,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:05:04,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:05:04,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:05:04,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:05:04,421 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:05:04,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:05:04,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:05:04,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:05:04,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:05:04,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:05:04,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:05:04,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:05:04,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:05:04,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:05:04,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:05:04,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:05:04,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:05:04,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:05:04,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:05:04,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:05:04,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:05:04,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:05:04,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:05:04,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:05:04,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:05:04,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:05:04,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:05:04,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:05:04,425 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_a7505243-6bf0-4907-b734-de788e7b037a/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 -> 14831cf592bc13b54caac21143b5bc01f6bc3848 [2019-11-16 00:05:04,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:05:04,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:05:04,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:05:04,488 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:05:04,488 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:05:04,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2019-11-16 00:05:04,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/data/53c2321c7/f9cf3bad312c4818aa63a36b79dc3315/FLAGcc56686df [2019-11-16 00:05:05,134 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:05:05,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2019-11-16 00:05:05,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/data/53c2321c7/f9cf3bad312c4818aa63a36b79dc3315/FLAGcc56686df [2019-11-16 00:05:05,558 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/data/53c2321c7/f9cf3bad312c4818aa63a36b79dc3315 [2019-11-16 00:05:05,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:05:05,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:05:05,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:05,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:05:05,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:05:05,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:05" (1/1) ... [2019-11-16 00:05:05,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277e830e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:05, skipping insertion in model container [2019-11-16 00:05:05,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:05" (1/1) ... [2019-11-16 00:05:05,576 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:05:05,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:05:06,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:06,353 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:05:06,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:06,935 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:05:06,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06 WrapperNode [2019-11-16 00:05:06,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:06,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:06,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:05:06,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:05:06,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:06,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:07,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:05:07,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:05:07,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:05:07,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... [2019-11-16 00:05:07,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:05:07,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:05:07,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:05:07,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:05:07,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:05:07,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:05:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:05:11,410 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:05:11,410 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:05:11,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:11 BoogieIcfgContainer [2019-11-16 00:05:11,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:05:11,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:05:11,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:05:11,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:05:11,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:05:05" (1/3) ... [2019-11-16 00:05:11,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b6709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:11, skipping insertion in model container [2019-11-16 00:05:11,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:06" (2/3) ... [2019-11-16 00:05:11,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b6709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:11, skipping insertion in model container [2019-11-16 00:05:11,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:11" (3/3) ... [2019-11-16 00:05:11,422 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label27.c [2019-11-16 00:05:11,431 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:05:11,439 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:05:11,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:05:11,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:05:11,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:05:11,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:05:11,486 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:05:11,486 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:05:11,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:05:11,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:05:11,488 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:05:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:05:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:05:11,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:11,523 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] [2019-11-16 00:05:11,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-11-16 00:05:11,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:11,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912032901] [2019-11-16 00:05:11,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:11,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:11,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:11,840 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-16 00:05:11,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912032901] [2019-11-16 00:05:11,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:11,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:11,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304222353] [2019-11-16 00:05:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:11,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:11,862 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:05:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:15,659 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-16 00:05:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:15,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-16 00:05:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:15,683 INFO L225 Difference]: With dead ends: 1514 [2019-11-16 00:05:15,683 INFO L226 Difference]: Without dead ends: 1008 [2019-11-16 00:05:15,689 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-16 00:05:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-16 00:05:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-16 00:05:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-16 00:05:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-16 00:05:15,842 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 37 [2019-11-16 00:05:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:15,843 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-16 00:05:15,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-16 00:05:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:05:15,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:15,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:05:15,848 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:15,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1560092623, now seen corresponding path program 1 times [2019-11-16 00:05:15,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:15,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047653792] [2019-11-16 00:05:15,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:15,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:15,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:16,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047653792] [2019-11-16 00:05:16,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:16,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:05:16,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520055130] [2019-11-16 00:05:16,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:16,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:16,010 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 4 states. [2019-11-16 00:05:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:19,350 INFO L93 Difference]: Finished difference Result 2561 states and 4453 transitions. [2019-11-16 00:05:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:19,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-16 00:05:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:19,363 INFO L225 Difference]: With dead ends: 2561 [2019-11-16 00:05:19,364 INFO L226 Difference]: Without dead ends: 1886 [2019-11-16 00:05:19,370 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-16 00:05:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-11-16 00:05:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1881. [2019-11-16 00:05:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-11-16 00:05:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2859 transitions. [2019-11-16 00:05:19,442 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2859 transitions. Word has length 102 [2019-11-16 00:05:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:19,443 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 2859 transitions. [2019-11-16 00:05:19,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2859 transitions. [2019-11-16 00:05:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:05:19,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:19,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:05:19,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -600642833, now seen corresponding path program 1 times [2019-11-16 00:05:19,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:19,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83304633] [2019-11-16 00:05:19,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:19,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:19,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:19,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83304633] [2019-11-16 00:05:19,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:19,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:19,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033752114] [2019-11-16 00:05:19,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:19,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:19,698 INFO L87 Difference]: Start difference. First operand 1881 states and 2859 transitions. Second operand 4 states. [2019-11-16 00:05:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:22,431 INFO L93 Difference]: Finished difference Result 7055 states and 10676 transitions. [2019-11-16 00:05:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:22,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-16 00:05:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:22,460 INFO L225 Difference]: With dead ends: 7055 [2019-11-16 00:05:22,460 INFO L226 Difference]: Without dead ends: 5176 [2019-11-16 00:05:22,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2019-11-16 00:05:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3376. [2019-11-16 00:05:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2019-11-16 00:05:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4559 transitions. [2019-11-16 00:05:22,544 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4559 transitions. Word has length 156 [2019-11-16 00:05:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:22,545 INFO L462 AbstractCegarLoop]: Abstraction has 3376 states and 4559 transitions. [2019-11-16 00:05:22,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4559 transitions. [2019-11-16 00:05:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-16 00:05:22,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:22,553 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:05:22,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1266153403, now seen corresponding path program 1 times [2019-11-16 00:05:22,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:22,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994644862] [2019-11-16 00:05:22,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:22,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:22,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-16 00:05:23,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994644862] [2019-11-16 00:05:23,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:23,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:05:23,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274795976] [2019-11-16 00:05:23,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:23,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:23,271 INFO L87 Difference]: Start difference. First operand 3376 states and 4559 transitions. Second operand 5 states. [2019-11-16 00:05:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:26,537 INFO L93 Difference]: Finished difference Result 7649 states and 10094 transitions. [2019-11-16 00:05:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:26,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2019-11-16 00:05:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:26,564 INFO L225 Difference]: With dead ends: 7649 [2019-11-16 00:05:26,564 INFO L226 Difference]: Without dead ends: 4275 [2019-11-16 00:05:26,568 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-16 00:05:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-11-16 00:05:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3974. [2019-11-16 00:05:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-11-16 00:05:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5199 transitions. [2019-11-16 00:05:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5199 transitions. Word has length 393 [2019-11-16 00:05:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:26,654 INFO L462 AbstractCegarLoop]: Abstraction has 3974 states and 5199 transitions. [2019-11-16 00:05:26,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5199 transitions. [2019-11-16 00:05:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-16 00:05:26,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:26,664 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:05:26,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1517405968, now seen corresponding path program 1 times [2019-11-16 00:05:26,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:26,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106174369] [2019-11-16 00:05:26,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:26,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:26,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:27,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106174369] [2019-11-16 00:05:27,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225224772] [2019-11-16 00:05:27,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:05:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:27,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:05:27,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:27,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:05:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:27,915 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:27,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-16 00:05:27,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873834381] [2019-11-16 00:05:27,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:05:27,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:05:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:05:27,919 INFO L87 Difference]: Start difference. First operand 3974 states and 5199 transitions. Second operand 9 states. [2019-11-16 00:05:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:47,295 INFO L93 Difference]: Finished difference Result 28097 states and 38064 transitions. [2019-11-16 00:05:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:05:47,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 414 [2019-11-16 00:05:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:47,387 INFO L225 Difference]: With dead ends: 28097 [2019-11-16 00:05:47,387 INFO L226 Difference]: Without dead ends: 24125 [2019-11-16 00:05:47,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:05:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24125 states. [2019-11-16 00:05:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24125 to 17168. [2019-11-16 00:05:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17168 states. [2019-11-16 00:05:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 21683 transitions. [2019-11-16 00:05:47,843 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 21683 transitions. Word has length 414 [2019-11-16 00:05:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:47,844 INFO L462 AbstractCegarLoop]: Abstraction has 17168 states and 21683 transitions. [2019-11-16 00:05:47,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:05:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 21683 transitions. [2019-11-16 00:05:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-11-16 00:05:47,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:47,861 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:05:48,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:48,075 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1209658147, now seen corresponding path program 1 times [2019-11-16 00:05:48,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:48,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951336386] [2019-11-16 00:05:48,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:48,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-16 00:05:48,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951336386] [2019-11-16 00:05:48,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:48,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:05:48,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325395843] [2019-11-16 00:05:48,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:48,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:48,639 INFO L87 Difference]: Start difference. First operand 17168 states and 21683 transitions. Second operand 4 states. [2019-11-16 00:05:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:51,602 INFO L93 Difference]: Finished difference Result 35831 states and 45242 transitions. [2019-11-16 00:05:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:51,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 544 [2019-11-16 00:05:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:51,644 INFO L225 Difference]: With dead ends: 35831 [2019-11-16 00:05:51,644 INFO L226 Difference]: Without dead ends: 18665 [2019-11-16 00:05:51,661 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-16 00:05:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2019-11-16 00:05:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 18660. [2019-11-16 00:05:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18660 states. [2019-11-16 00:05:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18660 states to 18660 states and 22141 transitions. [2019-11-16 00:05:51,932 INFO L78 Accepts]: Start accepts. Automaton has 18660 states and 22141 transitions. Word has length 544 [2019-11-16 00:05:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:51,933 INFO L462 AbstractCegarLoop]: Abstraction has 18660 states and 22141 transitions. [2019-11-16 00:05:51,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18660 states and 22141 transitions. [2019-11-16 00:05:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-11-16 00:05:51,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:51,952 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:05:51,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1450074555, now seen corresponding path program 1 times [2019-11-16 00:05:51,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:51,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946939231] [2019-11-16 00:05:51,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:51,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:05:52,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946939231] [2019-11-16 00:05:52,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:52,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:52,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817377453] [2019-11-16 00:05:52,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:52,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:52,608 INFO L87 Difference]: Start difference. First operand 18660 states and 22141 transitions. Second operand 5 states. [2019-11-16 00:05:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:56,099 INFO L93 Difference]: Finished difference Result 48975 states and 58135 transitions. [2019-11-16 00:05:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:56,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 578 [2019-11-16 00:05:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:56,139 INFO L225 Difference]: With dead ends: 48975 [2019-11-16 00:05:56,139 INFO L226 Difference]: Without dead ends: 30317 [2019-11-16 00:05:56,162 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-16 00:05:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30317 states. [2019-11-16 00:05:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30317 to 23140. [2019-11-16 00:05:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23140 states. [2019-11-16 00:05:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23140 states to 23140 states and 27231 transitions. [2019-11-16 00:05:56,534 INFO L78 Accepts]: Start accepts. Automaton has 23140 states and 27231 transitions. Word has length 578 [2019-11-16 00:05:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:56,535 INFO L462 AbstractCegarLoop]: Abstraction has 23140 states and 27231 transitions. [2019-11-16 00:05:56,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 23140 states and 27231 transitions. [2019-11-16 00:05:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-11-16 00:05:56,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:56,574 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, 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, 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, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:05:56,575 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash -932104068, now seen corresponding path program 1 times [2019-11-16 00:05:56,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:56,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851666417] [2019-11-16 00:05:56,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:56,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:56,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-16 00:05:57,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851666417] [2019-11-16 00:05:57,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:57,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:57,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038453987] [2019-11-16 00:05:57,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:05:57,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:05:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:57,207 INFO L87 Difference]: Start difference. First operand 23140 states and 27231 transitions. Second operand 3 states. [2019-11-16 00:05:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:59,335 INFO L93 Difference]: Finished difference Result 46275 states and 54481 transitions. [2019-11-16 00:05:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:05:59,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-11-16 00:05:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:59,353 INFO L225 Difference]: With dead ends: 46275 [2019-11-16 00:05:59,353 INFO L226 Difference]: Without dead ends: 23137 [2019-11-16 00:05:59,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23137 states. [2019-11-16 00:05:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23137 to 22837. [2019-11-16 00:05:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22837 states. [2019-11-16 00:05:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22837 states to 22837 states and 26853 transitions. [2019-11-16 00:05:59,634 INFO L78 Accepts]: Start accepts. Automaton has 22837 states and 26853 transitions. Word has length 702 [2019-11-16 00:05:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:59,635 INFO L462 AbstractCegarLoop]: Abstraction has 22837 states and 26853 transitions. [2019-11-16 00:05:59,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:05:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22837 states and 26853 transitions. [2019-11-16 00:05:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-11-16 00:05:59,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:59,656 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:05:59,656 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash -528418340, now seen corresponding path program 1 times [2019-11-16 00:05:59,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:59,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821029609] [2019-11-16 00:05:59,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:59,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:59,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 803 proven. 3 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-11-16 00:06:01,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821029609] [2019-11-16 00:06:01,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922082247] [2019-11-16 00:06:01,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:06:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:01,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:06:01,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:06:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 767 proven. 39 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-11-16 00:06:01,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:01,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-16 00:06:01,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513595] [2019-11-16 00:06:01,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:06:01,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:06:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:01,791 INFO L87 Difference]: Start difference. First operand 22837 states and 26853 transitions. Second operand 9 states. [2019-11-16 00:06:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:09,037 INFO L93 Difference]: Finished difference Result 50908 states and 59504 transitions. [2019-11-16 00:06:09,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:06:09,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 716 [2019-11-16 00:06:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:09,058 INFO L225 Difference]: With dead ends: 50908 [2019-11-16 00:06:09,058 INFO L226 Difference]: Without dead ends: 21339 [2019-11-16 00:06:09,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 713 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-16 00:06:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21339 states. [2019-11-16 00:06:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21339 to 20442. [2019-11-16 00:06:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20442 states. [2019-11-16 00:06:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20442 states to 20442 states and 21833 transitions. [2019-11-16 00:06:09,310 INFO L78 Accepts]: Start accepts. Automaton has 20442 states and 21833 transitions. Word has length 716 [2019-11-16 00:06:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:09,311 INFO L462 AbstractCegarLoop]: Abstraction has 20442 states and 21833 transitions. [2019-11-16 00:06:09,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:06:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 20442 states and 21833 transitions. [2019-11-16 00:06:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-16 00:06:09,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:09,326 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:09,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:09,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1420352641, now seen corresponding path program 1 times [2019-11-16 00:06:09,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:09,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883360854] [2019-11-16 00:06:09,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:09,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:09,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:06:10,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883360854] [2019-11-16 00:06:10,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:10,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:10,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274165613] [2019-11-16 00:06:10,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:10,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:10,184 INFO L87 Difference]: Start difference. First operand 20442 states and 21833 transitions. Second operand 4 states. [2019-11-16 00:06:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:11,604 INFO L93 Difference]: Finished difference Result 40581 states and 43328 transitions. [2019-11-16 00:06:11,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:11,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 732 [2019-11-16 00:06:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:11,629 INFO L225 Difference]: With dead ends: 40581 [2019-11-16 00:06:11,629 INFO L226 Difference]: Without dead ends: 20141 [2019-11-16 00:06:11,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 00:06:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20141 states. [2019-11-16 00:06:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20141 to 19837. [2019-11-16 00:06:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19837 states. [2019-11-16 00:06:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 20993 transitions. [2019-11-16 00:06:11,832 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 20993 transitions. Word has length 732 [2019-11-16 00:06:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:11,833 INFO L462 AbstractCegarLoop]: Abstraction has 19837 states and 20993 transitions. [2019-11-16 00:06:11,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 20993 transitions. [2019-11-16 00:06:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-11-16 00:06:11,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:11,853 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:11,853 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash -762005697, now seen corresponding path program 1 times [2019-11-16 00:06:11,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:11,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862028519] [2019-11-16 00:06:11,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:11,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:11,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 664 proven. 129 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:06:12,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862028519] [2019-11-16 00:06:12,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356954835] [2019-11-16 00:06:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:06:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:12,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:06:12,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:12,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:12,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-16 00:06:13,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:13,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-11-16 00:06:13,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101643058] [2019-11-16 00:06:13,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:13,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:13,335 INFO L87 Difference]: Start difference. First operand 19837 states and 20993 transitions. Second operand 3 states. [2019-11-16 00:06:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:14,410 INFO L93 Difference]: Finished difference Result 42974 states and 45555 transitions. [2019-11-16 00:06:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:14,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 734 [2019-11-16 00:06:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:14,435 INFO L225 Difference]: With dead ends: 42974 [2019-11-16 00:06:14,436 INFO L226 Difference]: Without dead ends: 23139 [2019-11-16 00:06:14,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 734 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23139 states. [2019-11-16 00:06:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23139 to 22840. [2019-11-16 00:06:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22840 states. [2019-11-16 00:06:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22840 states to 22840 states and 24049 transitions. [2019-11-16 00:06:14,646 INFO L78 Accepts]: Start accepts. Automaton has 22840 states and 24049 transitions. Word has length 734 [2019-11-16 00:06:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:14,647 INFO L462 AbstractCegarLoop]: Abstraction has 22840 states and 24049 transitions. [2019-11-16 00:06:14,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22840 states and 24049 transitions. [2019-11-16 00:06:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-11-16 00:06:14,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:14,660 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:14,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:14,863 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1777625518, now seen corresponding path program 1 times [2019-11-16 00:06:14,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:14,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605449986] [2019-11-16 00:06:14,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:15,576 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-11-16 00:06:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 349 proven. 390 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-16 00:06:16,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605449986] [2019-11-16 00:06:16,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165590890] [2019-11-16 00:06:16,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:06:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:17,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:06:17,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:17,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:06:17,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:06:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 667 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:06:18,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:18,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-11-16 00:06:18,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106190687] [2019-11-16 00:06:18,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:06:18,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:06:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:06:18,130 INFO L87 Difference]: Start difference. First operand 22840 states and 24049 transitions. Second operand 18 states. [2019-11-16 00:06:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:39,387 INFO L93 Difference]: Finished difference Result 58609 states and 61718 transitions. [2019-11-16 00:06:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-11-16 00:06:39,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 736 [2019-11-16 00:06:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:39,414 INFO L225 Difference]: With dead ends: 58609 [2019-11-16 00:06:39,414 INFO L226 Difference]: Without dead ends: 35771 [2019-11-16 00:06:39,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 789 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1578, Invalid=6612, Unknown=0, NotChecked=0, Total=8190 [2019-11-16 00:06:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35771 states. [2019-11-16 00:06:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35771 to 26133. [2019-11-16 00:06:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26133 states. [2019-11-16 00:06:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26133 states to 26133 states and 27124 transitions. [2019-11-16 00:06:39,700 INFO L78 Accepts]: Start accepts. Automaton has 26133 states and 27124 transitions. Word has length 736 [2019-11-16 00:06:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:39,700 INFO L462 AbstractCegarLoop]: Abstraction has 26133 states and 27124 transitions. [2019-11-16 00:06:39,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:06:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26133 states and 27124 transitions. [2019-11-16 00:06:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2019-11-16 00:06:39,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:39,714 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:39,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:39,917 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash -624469570, now seen corresponding path program 1 times [2019-11-16 00:06:39,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:39,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731357990] [2019-11-16 00:06:39,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:39,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:39,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 387 proven. 267 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-16 00:06:41,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731357990] [2019-11-16 00:06:41,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916295600] [2019-11-16 00:06:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:06:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:41,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:06:41,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:41,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-16 00:06:42,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:42,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-11-16 00:06:42,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819743984] [2019-11-16 00:06:42,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:42,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:42,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:42,280 INFO L87 Difference]: Start difference. First operand 26133 states and 27124 transitions. Second operand 3 states. [2019-11-16 00:06:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:43,629 INFO L93 Difference]: Finished difference Result 54367 states and 56412 transitions. [2019-11-16 00:06:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:43,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 742 [2019-11-16 00:06:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:43,651 INFO L225 Difference]: With dead ends: 54367 [2019-11-16 00:06:43,651 INFO L226 Difference]: Without dead ends: 28236 [2019-11-16 00:06:43,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 743 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28236 states. [2019-11-16 00:06:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28236 to 27329. [2019-11-16 00:06:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27329 states. [2019-11-16 00:06:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27329 states to 27329 states and 28349 transitions. [2019-11-16 00:06:43,915 INFO L78 Accepts]: Start accepts. Automaton has 27329 states and 28349 transitions. Word has length 742 [2019-11-16 00:06:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:43,916 INFO L462 AbstractCegarLoop]: Abstraction has 27329 states and 28349 transitions. [2019-11-16 00:06:43,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 27329 states and 28349 transitions. [2019-11-16 00:06:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-11-16 00:06:43,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:43,928 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, 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, 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, 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] [2019-11-16 00:06:44,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:44,130 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1031991404, now seen corresponding path program 1 times [2019-11-16 00:06:44,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019723066] [2019-11-16 00:06:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-16 00:06:44,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019723066] [2019-11-16 00:06:44,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:44,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:44,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702561824] [2019-11-16 00:06:44,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:44,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:44,961 INFO L87 Difference]: Start difference. First operand 27329 states and 28349 transitions. Second operand 5 states. [2019-11-16 00:06:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:47,028 INFO L93 Difference]: Finished difference Result 35127 states and 36403 transitions. [2019-11-16 00:06:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:47,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 748 [2019-11-16 00:06:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:47,056 INFO L225 Difference]: With dead ends: 35127 [2019-11-16 00:06:47,056 INFO L226 Difference]: Without dead ends: 35125 [2019-11-16 00:06:47,062 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-16 00:06:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35125 states. [2019-11-16 00:06:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35125 to 28230. [2019-11-16 00:06:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28230 states. [2019-11-16 00:06:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28230 states to 28230 states and 29327 transitions. [2019-11-16 00:06:47,360 INFO L78 Accepts]: Start accepts. Automaton has 28230 states and 29327 transitions. Word has length 748 [2019-11-16 00:06:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:47,361 INFO L462 AbstractCegarLoop]: Abstraction has 28230 states and 29327 transitions. [2019-11-16 00:06:47,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28230 states and 29327 transitions. [2019-11-16 00:06:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2019-11-16 00:06:47,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:47,372 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:47,372 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash -530130051, now seen corresponding path program 1 times [2019-11-16 00:06:47,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:47,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228317193] [2019-11-16 00:06:47,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:47,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 698 proven. 129 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:06:48,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228317193] [2019-11-16 00:06:48,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11203876] [2019-11-16 00:06:48,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:06:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:48,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:48,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-16 00:06:49,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:06:49,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-16 00:06:49,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940665219] [2019-11-16 00:06:49,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:49,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:49,138 INFO L87 Difference]: Start difference. First operand 28230 states and 29327 transitions. Second operand 3 states. [2019-11-16 00:06:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:56,104 INFO L93 Difference]: Finished difference Result 58563 states and 60860 transitions. [2019-11-16 00:06:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:56,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 770 [2019-11-16 00:06:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:56,125 INFO L225 Difference]: With dead ends: 58563 [2019-11-16 00:06:56,125 INFO L226 Difference]: Without dead ends: 30335 [2019-11-16 00:06:56,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30335 states. [2019-11-16 00:06:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30335 to 27029. [2019-11-16 00:06:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27029 states. [2019-11-16 00:06:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27029 states to 27029 states and 28023 transitions. [2019-11-16 00:06:56,374 INFO L78 Accepts]: Start accepts. Automaton has 27029 states and 28023 transitions. Word has length 770 [2019-11-16 00:06:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:56,375 INFO L462 AbstractCegarLoop]: Abstraction has 27029 states and 28023 transitions. [2019-11-16 00:06:56,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27029 states and 28023 transitions. [2019-11-16 00:06:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-11-16 00:06:56,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:56,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, 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, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:06:56,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:56,585 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash 875199434, now seen corresponding path program 1 times [2019-11-16 00:06:56,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:56,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823804595] [2019-11-16 00:06:56,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:56,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-16 00:06:57,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823804595] [2019-11-16 00:06:57,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:57,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:57,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354730480] [2019-11-16 00:06:57,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:57,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:57,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:57,157 INFO L87 Difference]: Start difference. First operand 27029 states and 28023 transitions. Second operand 5 states. [2019-11-16 00:06:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:58,839 INFO L93 Difference]: Finished difference Result 45323 states and 47001 transitions. [2019-11-16 00:06:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:58,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 808 [2019-11-16 00:06:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:58,856 INFO L225 Difference]: With dead ends: 45323 [2019-11-16 00:06:58,856 INFO L226 Difference]: Without dead ends: 18296 [2019-11-16 00:06:58,867 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-16 00:06:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18296 states. [2019-11-16 00:06:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18296 to 16196. [2019-11-16 00:06:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16196 states. [2019-11-16 00:06:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16196 states to 16196 states and 16612 transitions. [2019-11-16 00:06:59,011 INFO L78 Accepts]: Start accepts. Automaton has 16196 states and 16612 transitions. Word has length 808 [2019-11-16 00:06:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:59,011 INFO L462 AbstractCegarLoop]: Abstraction has 16196 states and 16612 transitions. [2019-11-16 00:06:59,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 16196 states and 16612 transitions. [2019-11-16 00:06:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2019-11-16 00:06:59,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:59,022 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:06:59,022 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 279751055, now seen corresponding path program 1 times [2019-11-16 00:06:59,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:59,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730732338] [2019-11-16 00:06:59,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:59,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:59,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-11-16 00:07:00,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730732338] [2019-11-16 00:07:00,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:00,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:00,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429635034] [2019-11-16 00:07:00,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:00,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:00,157 INFO L87 Difference]: Start difference. First operand 16196 states and 16612 transitions. Second operand 4 states. [2019-11-16 00:07:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:01,527 INFO L93 Difference]: Finished difference Result 35092 states and 36030 transitions. [2019-11-16 00:07:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:01,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 960 [2019-11-16 00:07:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:01,541 INFO L225 Difference]: With dead ends: 35092 [2019-11-16 00:07:01,541 INFO L226 Difference]: Without dead ends: 19197 [2019-11-16 00:07:01,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19197 states. [2019-11-16 00:07:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19197 to 16495. [2019-11-16 00:07:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16495 states. [2019-11-16 00:07:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 16923 transitions. [2019-11-16 00:07:01,686 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 16923 transitions. Word has length 960 [2019-11-16 00:07:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:01,687 INFO L462 AbstractCegarLoop]: Abstraction has 16495 states and 16923 transitions. [2019-11-16 00:07:01,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 16923 transitions. [2019-11-16 00:07:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2019-11-16 00:07:01,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:01,698 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-16 00:07:01,698 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 736286035, now seen corresponding path program 1 times [2019-11-16 00:07:01,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:01,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73221549] [2019-11-16 00:07:01,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:01,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:01,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-11-16 00:07:02,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73221549] [2019-11-16 00:07:02,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:02,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:02,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244600195] [2019-11-16 00:07:02,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:02,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:02,590 INFO L87 Difference]: Start difference. First operand 16495 states and 16923 transitions. Second operand 3 states. [2019-11-16 00:07:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:03,379 INFO L93 Difference]: Finished difference Result 32689 states and 33543 transitions. [2019-11-16 00:07:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:03,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 969 [2019-11-16 00:07:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:03,389 INFO L225 Difference]: With dead ends: 32689 [2019-11-16 00:07:03,389 INFO L226 Difference]: Without dead ends: 16495 [2019-11-16 00:07:03,395 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-16 00:07:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16495 states. [2019-11-16 00:07:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16495 to 15897. [2019-11-16 00:07:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15897 states. [2019-11-16 00:07:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15897 states to 15897 states and 16311 transitions. [2019-11-16 00:07:03,529 INFO L78 Accepts]: Start accepts. Automaton has 15897 states and 16311 transitions. Word has length 969 [2019-11-16 00:07:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:03,530 INFO L462 AbstractCegarLoop]: Abstraction has 15897 states and 16311 transitions. [2019-11-16 00:07:03,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15897 states and 16311 transitions. [2019-11-16 00:07:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-11-16 00:07:03,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:03,543 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, 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:03,543 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash -486561977, now seen corresponding path program 1 times [2019-11-16 00:07:03,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:03,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956158237] [2019-11-16 00:07:03,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:03,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-11-16 00:07:04,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956158237] [2019-11-16 00:07:04,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:04,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:04,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132647282] [2019-11-16 00:07:04,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:04,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:04,770 INFO L87 Difference]: Start difference. First operand 15897 states and 16311 transitions. Second operand 5 states. [2019-11-16 00:07:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:06,503 INFO L93 Difference]: Finished difference Result 22495 states and 23084 transitions. [2019-11-16 00:07:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:06,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 983 [2019-11-16 00:07:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:06,517 INFO L225 Difference]: With dead ends: 22495 [2019-11-16 00:07:06,517 INFO L226 Difference]: Without dead ends: 22493 [2019-11-16 00:07:06,521 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-16 00:07:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22493 states. [2019-11-16 00:07:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22493 to 16200. [2019-11-16 00:07:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-11-16 00:07:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 16639 transitions. [2019-11-16 00:07:06,673 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 16639 transitions. Word has length 983 [2019-11-16 00:07:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:06,674 INFO L462 AbstractCegarLoop]: Abstraction has 16200 states and 16639 transitions. [2019-11-16 00:07:06,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 16639 transitions. [2019-11-16 00:07:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2019-11-16 00:07:06,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:06,690 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:07:06,690 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash -589632185, now seen corresponding path program 1 times [2019-11-16 00:07:06,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:06,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127121331] [2019-11-16 00:07:06,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:06,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:06,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-11-16 00:07:07,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127121331] [2019-11-16 00:07:07,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:07,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:07,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131813665] [2019-11-16 00:07:07,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:07,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:07,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:07,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:07,425 INFO L87 Difference]: Start difference. First operand 16200 states and 16639 transitions. Second operand 3 states. [2019-11-16 00:07:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:08,307 INFO L93 Difference]: Finished difference Result 32696 states and 33586 transitions. [2019-11-16 00:07:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:08,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 995 [2019-11-16 00:07:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:08,319 INFO L225 Difference]: With dead ends: 32696 [2019-11-16 00:07:08,319 INFO L226 Difference]: Without dead ends: 16797 [2019-11-16 00:07:08,324 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-16 00:07:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16797 states. [2019-11-16 00:07:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16797 to 16199. [2019-11-16 00:07:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16199 states. [2019-11-16 00:07:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16199 states to 16199 states and 16637 transitions. [2019-11-16 00:07:08,468 INFO L78 Accepts]: Start accepts. Automaton has 16199 states and 16637 transitions. Word has length 995 [2019-11-16 00:07:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:08,469 INFO L462 AbstractCegarLoop]: Abstraction has 16199 states and 16637 transitions. [2019-11-16 00:07:08,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 16199 states and 16637 transitions. [2019-11-16 00:07:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2019-11-16 00:07:08,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:08,488 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, 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, 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, 5, 5, 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, 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] [2019-11-16 00:07:08,488 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1310312419, now seen corresponding path program 1 times [2019-11-16 00:07:08,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:08,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511140690] [2019-11-16 00:07:08,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:08,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-11-16 00:07:10,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511140690] [2019-11-16 00:07:10,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116232800] [2019-11-16 00:07:10,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:07:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:10,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:07:10,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:10,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:10,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:12,026 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 99 DAG size of output: 27 [2019-11-16 00:07:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-11-16 00:07:14,423 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:14,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-16 00:07:14,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562721661] [2019-11-16 00:07:14,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:07:14,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:07:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:14,425 INFO L87 Difference]: Start difference. First operand 16199 states and 16637 transitions. Second operand 8 states. [2019-11-16 00:07:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,905 INFO L93 Difference]: Finished difference Result 25787 states and 26437 transitions. [2019-11-16 00:07:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:17,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1033 [2019-11-16 00:07:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,926 INFO L225 Difference]: With dead ends: 25787 [2019-11-16 00:07:17,926 INFO L226 Difference]: Without dead ends: 25785 [2019-11-16 00:07:17,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:07:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25785 states. [2019-11-16 00:07:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25785 to 18294. [2019-11-16 00:07:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18294 states. [2019-11-16 00:07:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18294 states to 18294 states and 18771 transitions. [2019-11-16 00:07:18,134 INFO L78 Accepts]: Start accepts. Automaton has 18294 states and 18771 transitions. Word has length 1033 [2019-11-16 00:07:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:18,135 INFO L462 AbstractCegarLoop]: Abstraction has 18294 states and 18771 transitions. [2019-11-16 00:07:18,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:07:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18294 states and 18771 transitions. [2019-11-16 00:07:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2019-11-16 00:07:18,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:18,150 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, 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, 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, 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, 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] [2019-11-16 00:07:18,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:18,351 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1356355674, now seen corresponding path program 1 times [2019-11-16 00:07:18,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:18,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525967679] [2019-11-16 00:07:18,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 90 proven. 922 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-11-16 00:07:19,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525967679] [2019-11-16 00:07:19,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223896414] [2019-11-16 00:07:19,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/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-16 00:07:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:07:20,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-11-16 00:07:20,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:20,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:07:20,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071979583] [2019-11-16 00:07:20,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:20,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:20,929 INFO L87 Difference]: Start difference. First operand 18294 states and 18771 transitions. Second operand 3 states. [2019-11-16 00:07:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:21,752 INFO L93 Difference]: Finished difference Result 35986 states and 36933 transitions. [2019-11-16 00:07:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:21,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1079 [2019-11-16 00:07:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:21,766 INFO L225 Difference]: With dead ends: 35986 [2019-11-16 00:07:21,766 INFO L226 Difference]: Without dead ends: 18292 [2019-11-16 00:07:21,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1078 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2019-11-16 00:07:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 16492. [2019-11-16 00:07:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-11-16 00:07:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 16781 transitions. [2019-11-16 00:07:21,922 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 16781 transitions. Word has length 1079 [2019-11-16 00:07:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:21,922 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 16781 transitions. [2019-11-16 00:07:21,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 16781 transitions. [2019-11-16 00:07:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1279 [2019-11-16 00:07:21,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:21,939 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:07:22,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:22,139 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2086685658, now seen corresponding path program 1 times [2019-11-16 00:07:22,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:22,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236230679] [2019-11-16 00:07:22,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 2280 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-16 00:07:23,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236230679] [2019-11-16 00:07:23,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:23,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:23,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778736152] [2019-11-16 00:07:23,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:23,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:23,843 INFO L87 Difference]: Start difference. First operand 16492 states and 16781 transitions. Second operand 5 states. [2019-11-16 00:07:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:25,428 INFO L93 Difference]: Finished difference Result 31803 states and 32366 transitions. [2019-11-16 00:07:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:25,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1278 [2019-11-16 00:07:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:25,439 INFO L225 Difference]: With dead ends: 31803 [2019-11-16 00:07:25,439 INFO L226 Difference]: Without dead ends: 17107 [2019-11-16 00:07:25,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-11-16 00:07:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 16492. [2019-11-16 00:07:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-11-16 00:07:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 16777 transitions. [2019-11-16 00:07:25,582 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 16777 transitions. Word has length 1278 [2019-11-16 00:07:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:25,582 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 16777 transitions. [2019-11-16 00:07:25,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 16777 transitions. [2019-11-16 00:07:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1449 [2019-11-16 00:07:25,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:25,602 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-11-16 00:07:25,602 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 535903618, now seen corresponding path program 1 times [2019-11-16 00:07:25,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749800424] [2019-11-16 00:07:25,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 3161 proven. 132 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2019-11-16 00:07:27,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749800424] [2019-11-16 00:07:27,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178139686] [2019-11-16 00:07:27,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:27,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:07:27,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:27,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:27,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:30,248 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_829 Int)) (let ((.cse0 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse1 (div .cse0 5))) (and (<= 0 .cse0) (<= (div (+ (* .cse1 10) 3459790) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse1) 3459790)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse2 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse3 (div .cse2 5))) (and (= 0 (mod .cse2 5)) (<= (div (+ (* .cse3 10) 3459790) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse3) 3459790)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse5 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (<= (div (+ (* .cse4 10) 3459800) (- 9)) c_~a0~0) (not (= 0 (mod .cse5 5))) (< .cse5 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (= (mod (+ .cse4 2) (- 9)) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse6 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse7 (div .cse6 5))) (and (= 0 (mod .cse6 5)) (= 0 (mod (+ .cse7 1) (- 9))) (<= (div (+ (* .cse7 10) 3459790) (- 9)) c_~a0~0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse9 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (not (= 0 (mod (+ .cse8 1) (- 9)))) (= 0 (mod .cse9 5)) (< (+ (* 10 .cse8) 3459790) 0) (<= (div (+ (* .cse8 10) 3459790) (- 9)) (+ c_~a0~0 1)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse11 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< (+ (* 10 .cse10) 3459800) 0) (not (= 0 (mod .cse11 5))) (< .cse11 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (not (= (mod (+ .cse10 2) (- 9)) 0)) (< 0 (+ v_~a0~0_829 147)) (<= (div (+ (* .cse10 10) 3459800) (- 9)) (+ c_~a0~0 1)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse13 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (not (= 0 (mod (+ .cse12 1) (- 9)))) (<= 0 .cse13) (< (+ (* 10 .cse12) 3459790) 0) (<= (div (+ (* .cse12 10) 3459790) (- 9)) (+ c_~a0~0 1)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse14 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse15 (div .cse14 5))) (and (<= 0 .cse14) (= 0 (mod (+ .cse15 1) (- 9))) (<= (div (+ (* .cse15 10) 3459790) (- 9)) c_~a0~0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse17 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (div (+ (* .cse16 10) 3459800) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse16) 3459800)) (not (= 0 (mod .cse17 5))) (< .cse17 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147))))))) is different from false [2019-11-16 00:07:33,149 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 32 [2019-11-16 00:07:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2437 proven. 558 refuted. 0 times theorem prover too weak. 1214 trivial. 4 not checked. [2019-11-16 00:07:39,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:39,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-16 00:07:39,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299305120] [2019-11-16 00:07:39,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:07:39,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:07:39,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2019-11-16 00:07:39,626 INFO L87 Difference]: Start difference. First operand 16492 states and 16777 transitions. Second operand 10 states. [2019-11-16 00:07:45,619 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-16 00:08:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:19,415 INFO L93 Difference]: Finished difference Result 37793 states and 38468 transitions. [2019-11-16 00:08:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:08:19,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1448 [2019-11-16 00:08:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:19,418 INFO L225 Difference]: With dead ends: 37793 [2019-11-16 00:08:19,419 INFO L226 Difference]: Without dead ends: 4199 [2019-11-16 00:08:19,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1485 GetRequests, 1459 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=161, Invalid=492, Unknown=1, NotChecked=48, Total=702 [2019-11-16 00:08:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2019-11-16 00:08:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3293. [2019-11-16 00:08:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-11-16 00:08:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3310 transitions. [2019-11-16 00:08:19,452 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3310 transitions. Word has length 1448 [2019-11-16 00:08:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:19,453 INFO L462 AbstractCegarLoop]: Abstraction has 3293 states and 3310 transitions. [2019-11-16 00:08:19,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3310 transitions. [2019-11-16 00:08:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2019-11-16 00:08:19,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:19,466 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:19,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:19,667 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1882290462, now seen corresponding path program 1 times [2019-11-16 00:08:19,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:19,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4549713] [2019-11-16 00:08:19,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5374 backedges. 3666 proven. 0 refuted. 0 times theorem prover too weak. 1708 trivial. 0 not checked. [2019-11-16 00:08:21,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4549713] [2019-11-16 00:08:21,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:21,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:21,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820956944] [2019-11-16 00:08:21,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:21,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:21,602 INFO L87 Difference]: Start difference. First operand 3293 states and 3310 transitions. Second operand 3 states. [2019-11-16 00:08:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:22,158 INFO L93 Difference]: Finished difference Result 5687 states and 5715 transitions. [2019-11-16 00:08:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:22,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1695 [2019-11-16 00:08:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:22,161 INFO L225 Difference]: With dead ends: 5687 [2019-11-16 00:08:22,161 INFO L226 Difference]: Without dead ends: 3293 [2019-11-16 00:08:22,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 00:08:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-11-16 00:08:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2019-11-16 00:08:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-11-16 00:08:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3308 transitions. [2019-11-16 00:08:22,185 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3308 transitions. Word has length 1695 [2019-11-16 00:08:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:22,185 INFO L462 AbstractCegarLoop]: Abstraction has 3293 states and 3308 transitions. [2019-11-16 00:08:22,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3308 transitions. [2019-11-16 00:08:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2019-11-16 00:08:22,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:22,201 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-11-16 00:08:22,201 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2019664079, now seen corresponding path program 1 times [2019-11-16 00:08:22,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:22,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978329718] [2019-11-16 00:08:22,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:22,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:22,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 792 proven. 3600 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-11-16 00:08:25,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978329718] [2019-11-16 00:08:25,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049864787] [2019-11-16 00:08:25,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:26,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:08:26,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:26,872 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 23 [2019-11-16 00:08:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-11-16 00:08:30,228 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:30,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-16 00:08:30,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399378375] [2019-11-16 00:08:30,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:08:30,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:08:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:30,232 INFO L87 Difference]: Start difference. First operand 3293 states and 3308 transitions. Second operand 11 states. [2019-11-16 00:08:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:33,649 INFO L93 Difference]: Finished difference Result 6283 states and 6313 transitions. [2019-11-16 00:08:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:33,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1791 [2019-11-16 00:08:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:33,650 INFO L225 Difference]: With dead ends: 6283 [2019-11-16 00:08:33,650 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:08:33,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1811 GetRequests, 1795 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:08:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:08:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:08:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:08:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:08:33,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1791 [2019-11-16 00:08:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:33,653 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:08:33,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:08:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:08:33,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:08:33,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:33,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:08:36,267 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 979 DAG size of output: 872 [2019-11-16 00:08:37,954 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 979 DAG size of output: 872 [2019-11-16 00:08:39,055 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 825 DAG size of output: 762 [2019-11-16 00:08:57,997 WARN L191 SmtUtils]: Spent 18.93 s on a formula simplification. DAG size of input: 838 DAG size of output: 234 [2019-11-16 00:09:21,079 WARN L191 SmtUtils]: Spent 23.08 s on a formula simplification. DAG size of input: 838 DAG size of output: 234 [2019-11-16 00:09:36,397 WARN L191 SmtUtils]: Spent 15.31 s on a formula simplification. DAG size of input: 741 DAG size of output: 227 [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,399 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,400 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,401 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,402 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,403 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:09:36,404 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:09:36,405 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,406 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:09:36,407 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,408 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,409 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:09:36,410 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,411 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:09:36,412 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,413 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,416 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,417 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse1 (= 3 ~a2~0)) (.cse45 (+ ~a4~0 86))) (let ((.cse43 (<= .cse45 0)) (.cse16 (< 0 (+ ~a29~0 144))) (.cse44 (not .cse1))) (let ((.cse42 (+ ~a29~0 16)) (.cse26 (+ ~a0~0 98)) (.cse18 (= 1 ~a2~0)) (.cse35 (and .cse43 .cse16 .cse44)) (.cse6 (= 4 ~a2~0)) (.cse32 (+ ~a29~0 127)) (.cse31 (+ ~a0~0 44)) (.cse41 (+ ~a0~0 147)) (.cse40 (+ ~a4~0 42)) (.cse36 (not (= 1 ULTIMATE.start_calculate_output_~input)))) (let ((.cse9 (or (< 0 .cse41) (< 0 .cse40) .cse36)) (.cse10 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse8 (<= (+ ~a0~0 104) 0)) (.cse24 (<= (+ ~a0~0 61) 0)) (.cse23 (<= .cse31 0)) (.cse5 (<= .cse32 0)) (.cse29 (and (and .cse43 .cse16) .cse1)) (.cse28 (<= 0 (+ ~a29~0 192415))) (.cse13 (<= 5 ~a2~0)) (.cse22 (and (not .cse18) (and .cse35 (not .cse6)))) (.cse30 (<= (+ ~a0~0 366640) 0)) (.cse14 (<= .cse26 0)) (.cse7 (< 0 .cse45)) (.cse27 (<= 0 (+ ~a0~0 146))) (.cse21 (<= ~a0~0 599970)) (.cse17 (<= .cse42 0)) (.cse4 (and .cse43 .cse44)) (.cse25 (<= (+ ~a4~0 89) 0)) (.cse19 (< 0 .cse42)) (.cse20 (= 2 ~a2~0)) (.cse15 (<= ~a29~0 41)) (.cse0 (<= .cse41 0)) (.cse2 (<= .cse40 0)) (.cse11 (exists ((v_~a29~0_898 Int)) (let ((.cse39 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse39)) (<= (+ .cse39 43) ~a29~0))))) (.cse3 (<= 0 (+ ~a0~0 366694)))) (or (and .cse0 (and (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse1) .cse2 .cse3) (and (<= 300109 ~a0~0) (and .cse4 .cse5) .cse6) (and (and .cse2 .cse7 (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) .cse1) .cse0) (and .cse8 (or (and .cse2 .cse9 .cse10 .cse6) (and .cse2 .cse9 .cse11 .cse6 .cse3)) (<= 0 (+ ~a0~0 459337))) (and (and .cse2 .cse9 (exists ((v_~a29~0_895 Int)) (let ((.cse12 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse12) (<= (+ .cse12 300022) ~a29~0)))) .cse6) .cse0) (or (and .cse13 .cse14 .cse15 (and .cse2 .cse16)) (and .cse14 .cse10 .cse13 .cse2)) (and .cse7 .cse17 .cse2 .cse18 .cse16) (and .cse14 .cse15 .cse19 .cse20 .cse2) (and .cse0 (and .cse13 .cse2 .cse16)) (and .cse21 .cse13 (and .cse11 .cse22)) (and (and .cse14 (and .cse2 .cse11)) .cse20) (and .cse15 .cse7 .cse2 .cse18 .cse16 .cse23) (and .cse4 .cse24) (and .cse25 (or .cse0 (< 0 .cse26)) .cse24) (and .cse8 .cse13 .cse2 .cse27 .cse5 .cse28) (and .cse21 (and .cse29 .cse15)) (and .cse29 .cse24) (and .cse30 .cse15 .cse6 .cse2 .cse3) (and .cse0 (and .cse20 .cse11)) (and (and .cse25 (<= 0 .cse31) .cse18 .cse5 (<= 0 .cse32)) .cse23) (and (exists ((v_~a0~0_833 Int)) (let ((.cse34 (div v_~a0~0_833 5))) (let ((.cse33 (* 10 .cse34))) (and (<= 0 (+ .cse33 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse34 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse33 3459790)))))) (and .cse30 .cse2 .cse16 .cse1)) (and .cse0 .cse6 .cse2 .cse5 .cse3) (and .cse21 (and .cse29 .cse11)) (and .cse19 (and .cse35 .cse20) (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse14 .cse2 .cse18 .cse27 .cse28) (and .cse13 (and .cse15 .cse22)) (and (and .cse30 .cse16) .cse20) (and .cse14 .cse7 .cse2 .cse27 .cse1) (and (<= ~a29~0 42) .cse6 .cse35) (and .cse0 .cse20 .cse2 .cse3) (and .cse21 .cse17 (and .cse4 .cse20)) (and .cse25 .cse36 (<= (+ ~a29~0 145) 0) (exists ((v_~a0~0_833 Int)) (let ((.cse38 (div v_~a0~0_833 5))) (let ((.cse37 (* 10 .cse38))) (and (<= 0 (+ .cse37 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse37 3459790)) (<= (+ (div (+ (* .cse38 10) 3459790) (- 9)) 600067) ~a0~0))))) .cse1) (and .cse19 .cse0 .cse20 .cse15) (and .cse0 .cse2 .cse18 .cse11 .cse3)))))) [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,418 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:09:36,419 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:09:36,420 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,421 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,422 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse20 (= 3 ~a2~0)) (.cse45 (+ ~a4~0 86)) (.cse1 (+ ~a29~0 144))) (let ((.cse11 (< 0 .cse1)) (.cse17 (= 1 ~a2~0)) (.cse31 (+ ~a29~0 127)) (.cse44 (<= .cse45 0)) (.cse46 (not .cse20))) (let ((.cse24 (+ ~a0~0 98)) (.cse6 (= 2 ~a2~0)) (.cse7 (and .cse44 .cse46)) (.cse8 (<= .cse31 0)) (.cse30 (and .cse44 .cse17)) (.cse43 (+ ~a29~0 16)) (.cse39 (and .cse44 .cse11 .cse46)) (.cse9 (= 4 ~a2~0)) (.cse29 (+ ~a0~0 44)) (.cse4 (<= (+ ~a4~0 42) 0))) (let ((.cse14 (and .cse4 .cse11)) (.cse23 (<= (+ ~a0~0 61) 0)) (.cse19 (<= (+ ~a4~0 89) 0)) (.cse18 (<= .cse29 0)) (.cse15 (< 0 .cse45)) (.cse36 (and (not .cse17) (and .cse39 (not .cse9)))) (.cse26 (and (and .cse44 .cse11) .cse20)) (.cse25 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse5 (< 0 .cse43)) (.cse3 (<= ~a29~0 41)) (.cse27 (<= (+ ~a0~0 104) 0)) (.cse13 (<= 5 ~a2~0)) (.cse34 (<= 0 (+ ~a0~0 146))) (.cse35 (<= 0 (+ ~a29~0 192415))) (.cse10 (<= (+ ~a0~0 366640) 0)) (.cse28 (<= ~a0~0 599970)) (.cse0 (or (and .cse7 (<= ~a2~0 2) .cse8) .cse30)) (.cse37 (and .cse39 .cse6)) (.cse16 (<= .cse43 0)) (.cse2 (<= .cse24 0)) (.cse12 (<= (+ ~a0~0 147) 0)) (.cse38 (exists ((v_~a29~0_898 Int)) (let ((.cse42 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse42)) (<= (+ .cse42 43) ~a29~0))))) (.cse33 (<= 0 (+ ~a0~0 366694)))) (or (and (= ~a2~0 1) .cse0 (<= .cse1 0)) (and (and .cse2 .cse3 .cse4) .cse5 .cse6) (and (<= 300109 ~a0~0) (and .cse7 .cse8) .cse9) (and .cse6 (and .cse10 .cse11)) (and .cse12 (and .cse13 .cse14)) (and .cse15 .cse16 .cse4 .cse17 .cse11) (and .cse3 .cse15 .cse4 .cse17 .cse11 .cse18) (and .cse19 (<= (+ ~a29~0 145) 0) .cse20 (exists ((v_~a0~0_833 Int)) (let ((.cse22 (div v_~a0~0_833 5))) (let ((.cse21 (* 10 .cse22))) (and (<= 0 (+ .cse21 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse21 3459790)) (<= (+ (div (+ (* .cse22 10) 3459790) (- 9)) 600067) ~a0~0)))))) (and .cse7 .cse23) (and .cse19 (or .cse12 (< 0 .cse24)) .cse23) (or (and .cse13 .cse2 .cse3 .cse14) (and .cse13 .cse2 (and .cse4 .cse25))) (and .cse26 .cse23) (and (and .cse27 (and (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) (and .cse4 .cse20))) .cse15) (and .cse28 (and .cse3 .cse26)) (and (and .cse19 (<= 0 .cse29) .cse30 .cse8 (<= 0 .cse31)) .cse18) (and (and .cse4 (exists ((v_~a29~0_895 Int)) (let ((.cse32 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse32) (<= (+ .cse32 300022) ~a29~0)))) .cse9) .cse12) (and .cse12 .cse4 (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse20 .cse33) (and .cse2 (and .cse4 .cse17 .cse34 .cse35)) (and .cse2 .cse15 .cse4 .cse34 .cse20) (and .cse13 (and .cse3 .cse36)) (and .cse5 .cse37 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse28 .cse13 (and .cse38 .cse36)) (and .cse3 (and .cse10 .cse4 .cse9) .cse33) (and .cse12 .cse9 .cse4 .cse8 .cse33) (and .cse12 .cse6 .cse4 .cse33) (and .cse28 (and .cse38 .cse26)) (and .cse27 (<= 0 (+ ~a0~0 459337)) (or (and .cse4 .cse25 .cse9) (and (and .cse4 .cse9) .cse38 .cse33))) (and (<= ~a29~0 42) .cse9 .cse39) (and .cse38 .cse12 .cse6) (and .cse5 .cse12 .cse3 .cse6) (and .cse27 .cse13 .cse4 .cse34 .cse8 .cse35) (and (and .cse10 .cse4 .cse11 .cse20) (exists ((v_~a0~0_833 Int)) (let ((.cse41 (div v_~a0~0_833 5))) (let ((.cse40 (* 10 .cse41))) (and (<= 0 (+ .cse40 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse41 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse40 3459790))))))) (and .cse28 (or (and .cse0 .cse6) .cse37) .cse16) (and (and .cse2 .cse4 .cse38) .cse6) (and .cse12 .cse4 .cse17 .cse38 .cse33)))))) [2019-11-16 00:09:36,422 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,422 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,423 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,424 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,425 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:09:36,426 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,427 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,428 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,429 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:09:36,430 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,431 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,432 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse20 (= 3 ~a2~0)) (.cse45 (+ ~a4~0 86)) (.cse1 (+ ~a29~0 144))) (let ((.cse11 (< 0 .cse1)) (.cse17 (= 1 ~a2~0)) (.cse31 (+ ~a29~0 127)) (.cse44 (<= .cse45 0)) (.cse46 (not .cse20))) (let ((.cse24 (+ ~a0~0 98)) (.cse6 (= 2 ~a2~0)) (.cse7 (and .cse44 .cse46)) (.cse8 (<= .cse31 0)) (.cse30 (and .cse44 .cse17)) (.cse43 (+ ~a29~0 16)) (.cse39 (and .cse44 .cse11 .cse46)) (.cse9 (= 4 ~a2~0)) (.cse29 (+ ~a0~0 44)) (.cse4 (<= (+ ~a4~0 42) 0))) (let ((.cse14 (and .cse4 .cse11)) (.cse23 (<= (+ ~a0~0 61) 0)) (.cse19 (<= (+ ~a4~0 89) 0)) (.cse18 (<= .cse29 0)) (.cse15 (< 0 .cse45)) (.cse36 (and (not .cse17) (and .cse39 (not .cse9)))) (.cse26 (and (and .cse44 .cse11) .cse20)) (.cse25 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse5 (< 0 .cse43)) (.cse3 (<= ~a29~0 41)) (.cse27 (<= (+ ~a0~0 104) 0)) (.cse13 (<= 5 ~a2~0)) (.cse34 (<= 0 (+ ~a0~0 146))) (.cse35 (<= 0 (+ ~a29~0 192415))) (.cse10 (<= (+ ~a0~0 366640) 0)) (.cse28 (<= ~a0~0 599970)) (.cse0 (or (and .cse7 (<= ~a2~0 2) .cse8) .cse30)) (.cse37 (and .cse39 .cse6)) (.cse16 (<= .cse43 0)) (.cse2 (<= .cse24 0)) (.cse12 (<= (+ ~a0~0 147) 0)) (.cse38 (exists ((v_~a29~0_898 Int)) (let ((.cse42 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse42)) (<= (+ .cse42 43) ~a29~0))))) (.cse33 (<= 0 (+ ~a0~0 366694)))) (or (and (= ~a2~0 1) .cse0 (<= .cse1 0)) (and (and .cse2 .cse3 .cse4) .cse5 .cse6) (and (<= 300109 ~a0~0) (and .cse7 .cse8) .cse9) (and .cse6 (and .cse10 .cse11)) (and .cse12 (and .cse13 .cse14)) (and .cse15 .cse16 .cse4 .cse17 .cse11) (and .cse3 .cse15 .cse4 .cse17 .cse11 .cse18) (and .cse19 (<= (+ ~a29~0 145) 0) .cse20 (exists ((v_~a0~0_833 Int)) (let ((.cse22 (div v_~a0~0_833 5))) (let ((.cse21 (* 10 .cse22))) (and (<= 0 (+ .cse21 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse21 3459790)) (<= (+ (div (+ (* .cse22 10) 3459790) (- 9)) 600067) ~a0~0)))))) (and .cse7 .cse23) (and .cse19 (or .cse12 (< 0 .cse24)) .cse23) (or (and .cse13 .cse2 .cse3 .cse14) (and .cse13 .cse2 (and .cse4 .cse25))) (and .cse26 .cse23) (and (and .cse27 (and (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) (and .cse4 .cse20))) .cse15) (and .cse28 (and .cse3 .cse26)) (and (and .cse19 (<= 0 .cse29) .cse30 .cse8 (<= 0 .cse31)) .cse18) (and (and .cse4 (exists ((v_~a29~0_895 Int)) (let ((.cse32 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse32) (<= (+ .cse32 300022) ~a29~0)))) .cse9) .cse12) (and .cse12 .cse4 (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse20 .cse33) (and .cse2 (and .cse4 .cse17 .cse34 .cse35)) (and .cse2 .cse15 .cse4 .cse34 .cse20) (and .cse13 (and .cse3 .cse36)) (and .cse5 .cse37 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse28 .cse13 (and .cse38 .cse36)) (and .cse3 (and .cse10 .cse4 .cse9) .cse33) (and .cse12 .cse9 .cse4 .cse8 .cse33) (and .cse12 .cse6 .cse4 .cse33) (and .cse28 (and .cse38 .cse26)) (and .cse27 (<= 0 (+ ~a0~0 459337)) (or (and .cse4 .cse25 .cse9) (and (and .cse4 .cse9) .cse38 .cse33))) (and (<= ~a29~0 42) .cse9 .cse39) (and .cse38 .cse12 .cse6) (and .cse5 .cse12 .cse3 .cse6) (and .cse27 .cse13 .cse4 .cse34 .cse8 .cse35) (and (and .cse10 .cse4 .cse11 .cse20) (exists ((v_~a0~0_833 Int)) (let ((.cse41 (div v_~a0~0_833 5))) (let ((.cse40 (* 10 .cse41))) (and (<= 0 (+ .cse40 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse41 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse40 3459790))))))) (and .cse28 (or (and .cse0 .cse6) .cse37) .cse16) (and (and .cse2 .cse4 .cse38) .cse6) (and .cse12 .cse4 .cse17 .cse38 .cse33)))))) [2019-11-16 00:09:36,432 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:09:36,432 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:09:36,432 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,433 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,434 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,435 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:09:36,436 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:09:36,437 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,438 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,439 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,440 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,441 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,442 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:09:36,443 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:09:36,444 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,445 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,445 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:09:36,445 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:09:36,445 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:09:36,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:09:36 BoogieIcfgContainer [2019-11-16 00:09:36,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:09:36,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:09:36,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:09:36,555 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:09:36,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:11" (3/4) ... [2019-11-16 00:09:36,559 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:09:36,587 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:09:36,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:09:36,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a2 == 1 && ((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || (2 == a2 && a0 + 366640 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && 5 <= a2 && a4 + 42 <= 0 && 0 < a29 + 144)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0))) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || ((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0 && 96102 <= a4 + a29)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 + 104 <= 0 && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15) && a4 + 42 <= 0 && 3 == a2) && 0 < a4 + 86)) || (a0 <= 599970 && a29 <= 41 && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && a4 + 86 <= 0 && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && 3 == a2) && 0 <= a0 + 366694)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a29 <= 41 && (a0 + 366640 <= 0 && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || ((a0 + 104 <= 0 && 0 <= a0 + 459337) && (((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && 4 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)))) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && a0 + 147 <= 0) && 2 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 41) && 2 == a2)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790))) || ((a0 <= 599970 && ((((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2)) && 2 == a2) || (((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2))) && a29 + 16 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) [2019-11-16 00:09:36,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a2 == 1 && ((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || (2 == a2 && a0 + 366640 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && 5 <= a2 && a4 + 42 <= 0 && 0 < a29 + 144)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0))) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || ((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0 && 96102 <= a4 + a29)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 + 104 <= 0 && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15) && a4 + 42 <= 0 && 3 == a2) && 0 < a4 + 86)) || (a0 <= 599970 && a29 <= 41 && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && a4 + 86 <= 0 && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && 3 == a2) && 0 <= a0 + 366694)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a29 <= 41 && (a0 + 366640 <= 0 && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || ((a0 + 104 <= 0 && 0 <= a0 + 459337) && (((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && 4 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)))) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && a0 + 147 <= 0) && 2 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 41) && 2 == a2)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790))) || ((a0 <= 599970 && ((((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2)) && 2 == a2) || (((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2))) && a29 + 16 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) [2019-11-16 00:09:36,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a0 + 147 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43) && 3 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2) && a0 + 147 <= 0)) || ((a0 + 104 <= 0 && ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && 96102 <= a4 + a29) && 4 == a2) || ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694))) && 0 <= a0 + 459337)) || ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || (((a0 + 98 <= 0 && 96102 <= a4 + a29) && 5 <= a2) && a4 + 42 <= 0)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 + 147 <= 0 && (5 <= a2 && a4 + 42 <= 0) && 0 < a29 + 144)) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a0 + 98 <= 0 && a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || (a0 <= 599970 && ((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a29 <= 41)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a29 <= 41) && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 + 147 <= 0 && 2 == a2 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29))) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && ((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && ((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || ((a0 <= 599970 && a29 + 16 <= 0) && (a4 + 86 <= 0 && !(3 == a2)) && 2 == a2)) || ((((a4 + 89 <= 0 && !(1 == input)) && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && 2 == a2) && a29 <= 41)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) [2019-11-16 00:09:36,805 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7505243-6bf0-4907-b734-de788e7b037a/bin/uautomizer/witness.graphml [2019-11-16 00:09:36,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:09:36,807 INFO L168 Benchmark]: Toolchain (without parser) took 271246.18 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 940.8 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,807 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:36,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1374.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 224.38 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,808 INFO L168 Benchmark]: Boogie Preprocessor took 208.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,809 INFO L168 Benchmark]: RCFGBuilder took 4042.04 ms. Allocated memory is still 1.2 GB. Free memory was 995.5 MB in the beginning and 924.9 MB in the end (delta: 70.6 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,809 INFO L168 Benchmark]: TraceAbstraction took 265141.60 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 924.9 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,809 INFO L168 Benchmark]: Witness Printer took 251.13 ms. Allocated memory is still 4.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:36,811 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1374.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 224.38 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 208.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4042.04 ms. Allocated memory is still 1.2 GB. Free memory was 995.5 MB in the beginning and 924.9 MB in the end (delta: 70.6 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 265141.60 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 924.9 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 251.13 ms. Allocated memory is still 4.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 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_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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-16 00:09:36,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a2 == 1 && ((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || (2 == a2 && a0 + 366640 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && 5 <= a2 && a4 + 42 <= 0 && 0 < a29 + 144)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0))) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || ((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0 && 96102 <= a4 + a29)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 + 104 <= 0 && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15) && a4 + 42 <= 0 && 3 == a2) && 0 < a4 + 86)) || (a0 <= 599970 && a29 <= 41 && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && a4 + 86 <= 0 && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && 3 == a2) && 0 <= a0 + 366694)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a29 <= 41 && (a0 + 366640 <= 0 && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || ((a0 + 104 <= 0 && 0 <= a0 + 459337) && (((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && 4 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)))) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && a0 + 147 <= 0) && 2 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 41) && 2 == a2)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790))) || ((a0 <= 599970 && ((((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2)) && 2 == a2) || (((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2))) && a29 + 16 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:09:36,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a2 == 1 && ((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || (2 == a2 && a0 + 366640 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && 5 <= a2 && a4 + 42 <= 0 && 0 < a29 + 144)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0))) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || ((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0 && 96102 <= a4 + a29)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 + 104 <= 0 && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15) && a4 + 42 <= 0 && 3 == a2) && 0 < a4 + 86)) || (a0 <= 599970 && a29 <= 41 && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && a4 + 86 <= 0 && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && 3 == a2) && 0 <= a0 + 366694)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a29 <= 41 && (a0 + 366640 <= 0 && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && (a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2)) || ((a0 + 104 <= 0 && 0 <= a0 + 459337) && (((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && 4 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)))) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && a0 + 147 <= 0) && 2 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 41) && 2 == a2)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790))) || ((a0 <= 599970 && ((((((a4 + 86 <= 0 && !(3 == a2)) && a2 <= 2) && a29 + 127 <= 0) || (a4 + 86 <= 0 && 1 == a2)) && 2 == a2) || (((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2))) && a29 + 16 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:09:36,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:09:36,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:09:36,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-16 00:09:36,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-11-16 00:09:36,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-11-16 00:09:36,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a0 + 147 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43) && 3 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694) || ((300109 <= a0 && (a4 + 86 <= 0 && !(3 == a2)) && a29 + 127 <= 0) && 4 == a2)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2) && a0 + 147 <= 0)) || ((a0 + 104 <= 0 && ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && 96102 <= a4 + a29) && 4 == a2) || ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694))) && 0 <= a0 + 459337)) || ((((a4 + 42 <= 0 && ((0 < a0 + 147 || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && 4 == a2) && a0 + 147 <= 0)) || (((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0 && 0 < a29 + 144) || (((a0 + 98 <= 0 && 96102 <= a4 + a29) && 5 <= a2) && a4 + 42 <= 0)) || ((((0 < a4 + 86 && a29 + 16 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 + 147 <= 0 && (5 <= a2 && a4 + 42 <= 0) && 0 < a29 + 144)) || ((a0 <= 599970 && 5 <= a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29) && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a0 + 98 <= 0 && a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a29 <= 41 && 0 < a4 + 86) && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(3 == a2)) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((((a0 + 104 <= 0 && 5 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || (a0 <= 599970 && ((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a29 <= 41)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a29 <= 41) && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || (a0 + 147 <= 0 && 2 == a2 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29))) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 1 == a2) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && ((a0 + 366640 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144) && 3 == a2)) || ((((a0 + 147 <= 0 && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0) && 0 <= a0 + 366694)) || (a0 <= 599970 && ((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29))) || ((0 < a29 + 16 && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && 2 == a2) && !(6 == input))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || (5 <= a2 && a29 <= 41 && !(1 == a2) && ((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && !(4 == a2))) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 146) && 3 == a2)) || ((a29 <= 42 && 4 == a2) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || (((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0) && 0 <= a0 + 366694)) || ((a0 <= 599970 && a29 + 16 <= 0) && (a4 + 86 <= 0 && !(3 == a2)) && 2 == a2)) || ((((a4 + 89 <= 0 && !(1 == input)) && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((0 < a29 + 16 && a0 + 147 <= 0) && 2 == a2) && a29 <= 41)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && 1 == a2) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694) - 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: 264.9s, OverallIterations: 26, TraceHistogramMax: 9, AutomataDifference: 139.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.5s, HoareTripleCheckerStatistics: 5129 SDtfs, 41870 SDslu, 2327 SDs, 0 SdLazy, 86670 SolverSat, 10511 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 114.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9841 GetRequests, 9579 SyntacticMatches, 22 SemanticMatches, 240 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3190 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28230occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 62225 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 322 NumberOfFragments, 3283 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2485238 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 57507676 FormulaSimplificationTreeSizeReductionInter, 57.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 30606 NumberOfCodeBlocks, 30606 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 30570 ConstructedInterpolants, 1511 QuantifiedInterpolants, 150121545 SizeOfPredicates, 16 NumberOfNonLiveVariables, 10941 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 48672/57110 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...