./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f29aa323a0a92d5a9d9b59bc37634431cad4c2bd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:20:34,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:20:34,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:20:34,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:20:34,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:20:34,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:20:34,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:20:34,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:20:34,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:20:34,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:20:34,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:20:34,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:20:34,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:20:34,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:20:34,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:20:34,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:20:34,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:20:34,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:20:34,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:20:34,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:20:34,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:20:34,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:20:34,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:20:34,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:20:34,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:20:34,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:20:34,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:20:34,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:20:34,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:20:34,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:20:34,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:20:34,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:20:34,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:20:34,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:20:34,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:20:34,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:20:34,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:20:34,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:20:34,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:20:34,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:20:34,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:20:34,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:20:34,538 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:20:34,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:20:34,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:20:34,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:20:34,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:20:34,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:20:34,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:20:34,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:20:34,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:20:34,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:20:34,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:20:34,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:20:34,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:20:34,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:20:34,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:20:34,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:20:34,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:20:34,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:20:34,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:20:34,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:20:34,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:20:34,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:20:34,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:20:34,543 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_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f29aa323a0a92d5a9d9b59bc37634431cad4c2bd [2019-12-07 18:20:34,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:20:34,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:20:34,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:20:34,655 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:20:34,655 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:20:34,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2019-12-07 18:20:34,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/data/9fa6480c6/e8aa9d21a3db499cb5729fd04bcc8747/FLAGb647d177d [2019-12-07 18:20:35,207 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:20:35,208 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/sv-benchmarks/c/eca-rers2012/Problem15_label16.c [2019-12-07 18:20:35,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/data/9fa6480c6/e8aa9d21a3db499cb5729fd04bcc8747/FLAGb647d177d [2019-12-07 18:20:35,726 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/data/9fa6480c6/e8aa9d21a3db499cb5729fd04bcc8747 [2019-12-07 18:20:35,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:20:35,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:20:35,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:35,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:20:35,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:20:35,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:35" (1/1) ... [2019-12-07 18:20:35,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:35, skipping insertion in model container [2019-12-07 18:20:35,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:35" (1/1) ... [2019-12-07 18:20:35,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:20:35,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:20:36,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:36,259 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:20:36,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:36,432 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:20:36,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36 WrapperNode [2019-12-07 18:20:36,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:36,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:36,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:20:36,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:20:36,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:36,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:20:36,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:20:36,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:20:36,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... [2019-12-07 18:20:36,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:20:36,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:20:36,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:20:36,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:20:36,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:20:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:20:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:20:39,110 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:20:39,111 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:20:39,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:39 BoogieIcfgContainer [2019-12-07 18:20:39,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:20:39,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:20:39,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:20:39,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:20:39,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:20:35" (1/3) ... [2019-12-07 18:20:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eae59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:39, skipping insertion in model container [2019-12-07 18:20:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:36" (2/3) ... [2019-12-07 18:20:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eae59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:39, skipping insertion in model container [2019-12-07 18:20:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:39" (3/3) ... [2019-12-07 18:20:39,116 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label16.c [2019-12-07 18:20:39,122 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:20:39,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:20:39,134 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:20:39,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:20:39,155 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:20:39,155 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:20:39,155 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:20:39,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:20:39,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:20:39,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:20:39,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:20:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:20:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:20:39,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:39,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:39,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2019-12-07 18:20:39,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:39,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 18:20:39,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:39,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 18:20:39,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:39,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:39,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880546209] [2019-12-07 18:20:39,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:39,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:39,405 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:20:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:43,527 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-12-07 18:20:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:43,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 18:20:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:43,547 INFO L225 Difference]: With dead ends: 1470 [2019-12-07 18:20:43,547 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 18:20:43,551 INFO L630 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-12-07 18:20:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 18:20:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-12-07 18:20:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 18:20:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-12-07 18:20:43,621 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 62 [2019-12-07 18:20:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:43,622 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-12-07 18:20:43,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-12-07 18:20:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 18:20:43,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:43,627 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:43,628 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2081040869, now seen corresponding path program 1 times [2019-12-07 18:20:43,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:43,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675460787] [2019-12-07 18:20:43,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675460787] [2019-12-07 18:20:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236767768] [2019-12-07 18:20:43,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:43,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:43,763 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-12-07 18:20:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:47,426 INFO L93 Difference]: Finished difference Result 3755 states and 5687 transitions. [2019-12-07 18:20:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:47,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-12-07 18:20:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:47,441 INFO L225 Difference]: With dead ends: 3755 [2019-12-07 18:20:47,441 INFO L226 Difference]: Without dead ends: 2781 [2019-12-07 18:20:47,443 INFO L630 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-12-07 18:20:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-12-07 18:20:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2779. [2019-12-07 18:20:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-12-07 18:20:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3749 transitions. [2019-12-07 18:20:47,484 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3749 transitions. Word has length 127 [2019-12-07 18:20:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:47,484 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3749 transitions. [2019-12-07 18:20:47,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3749 transitions. [2019-12-07 18:20:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 18:20:47,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:47,489 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:47,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 146795855, now seen corresponding path program 1 times [2019-12-07 18:20:47,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:47,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856604354] [2019-12-07 18:20:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 119 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:20:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856604354] [2019-12-07 18:20:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392858165] [2019-12-07 18:20:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:20:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:47,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:20:47,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:20:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:47,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:20:47,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 18:20:47,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599923900] [2019-12-07 18:20:47,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:47,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:47,778 INFO L87 Difference]: Start difference. First operand 2779 states and 3749 transitions. Second operand 3 states. [2019-12-07 18:20:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:49,198 INFO L93 Difference]: Finished difference Result 7949 states and 10778 transitions. [2019-12-07 18:20:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:49,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-12-07 18:20:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:49,219 INFO L225 Difference]: With dead ends: 7949 [2019-12-07 18:20:49,219 INFO L226 Difference]: Without dead ends: 5172 [2019-12-07 18:20:49,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-12-07 18:20:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 3077. [2019-12-07 18:20:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-12-07 18:20:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4101 transitions. [2019-12-07 18:20:49,292 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4101 transitions. Word has length 232 [2019-12-07 18:20:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:49,292 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 4101 transitions. [2019-12-07 18:20:49,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4101 transitions. [2019-12-07 18:20:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-12-07 18:20:49,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:49,297 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:49,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:20:49,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -966314421, now seen corresponding path program 1 times [2019-12-07 18:20:49,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:49,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038648475] [2019-12-07 18:20:49,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-12-07 18:20:49,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038648475] [2019-12-07 18:20:49,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:49,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:49,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905174725] [2019-12-07 18:20:49,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:49,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:49,943 INFO L87 Difference]: Start difference. First operand 3077 states and 4101 transitions. Second operand 5 states. [2019-12-07 18:20:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:52,790 INFO L93 Difference]: Finished difference Result 7350 states and 9514 transitions. [2019-12-07 18:20:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:52,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 412 [2019-12-07 18:20:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:52,804 INFO L225 Difference]: With dead ends: 7350 [2019-12-07 18:20:52,804 INFO L226 Difference]: Without dead ends: 4275 [2019-12-07 18:20:52,806 INFO L630 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-12-07 18:20:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-07 18:20:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3975. [2019-12-07 18:20:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3975 states. [2019-12-07 18:20:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 5065 transitions. [2019-12-07 18:20:52,855 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 5065 transitions. Word has length 412 [2019-12-07 18:20:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:52,855 INFO L462 AbstractCegarLoop]: Abstraction has 3975 states and 5065 transitions. [2019-12-07 18:20:52,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 5065 transitions. [2019-12-07 18:20:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-12-07 18:20:52,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:52,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:52,863 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash 478727325, now seen corresponding path program 1 times [2019-12-07 18:20:52,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:52,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826495515] [2019-12-07 18:20:52,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:20:53,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826495515] [2019-12-07 18:20:53,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:53,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:53,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952031970] [2019-12-07 18:20:53,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:53,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:53,120 INFO L87 Difference]: Start difference. First operand 3975 states and 5065 transitions. Second operand 4 states. [2019-12-07 18:20:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:56,781 INFO L93 Difference]: Finished difference Result 9748 states and 12676 transitions. [2019-12-07 18:20:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:56,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 486 [2019-12-07 18:20:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:56,800 INFO L225 Difference]: With dead ends: 9748 [2019-12-07 18:20:56,800 INFO L226 Difference]: Without dead ends: 5775 [2019-12-07 18:20:56,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-12-07 18:20:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5472. [2019-12-07 18:20:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5472 states. [2019-12-07 18:20:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 6856 transitions. [2019-12-07 18:20:56,876 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 6856 transitions. Word has length 486 [2019-12-07 18:20:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:56,876 INFO L462 AbstractCegarLoop]: Abstraction has 5472 states and 6856 transitions. [2019-12-07 18:20:56,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 6856 transitions. [2019-12-07 18:20:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-12-07 18:20:56,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:56,881 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:56,881 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1964567663, now seen corresponding path program 1 times [2019-12-07 18:20:56,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:56,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416991474] [2019-12-07 18:20:56,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 18:20:57,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416991474] [2019-12-07 18:20:57,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:57,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:57,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494669] [2019-12-07 18:20:57,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:57,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:57,130 INFO L87 Difference]: Start difference. First operand 5472 states and 6856 transitions. Second operand 4 states. [2019-12-07 18:21:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:00,069 INFO L93 Difference]: Finished difference Result 11240 states and 14054 transitions. [2019-12-07 18:21:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:21:00,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 492 [2019-12-07 18:21:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:00,089 INFO L225 Difference]: With dead ends: 11240 [2019-12-07 18:21:00,089 INFO L226 Difference]: Without dead ends: 5770 [2019-12-07 18:21:00,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-07 18:21:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2019-12-07 18:21:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-12-07 18:21:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6798 transitions. [2019-12-07 18:21:00,142 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6798 transitions. Word has length 492 [2019-12-07 18:21:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6798 transitions. [2019-12-07 18:21:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6798 transitions. [2019-12-07 18:21:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2019-12-07 18:21:00,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:00,147 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:00,148 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1761323282, now seen corresponding path program 1 times [2019-12-07 18:21:00,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:00,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28725325] [2019-12-07 18:21:00,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 536 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-12-07 18:21:00,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28725325] [2019-12-07 18:21:00,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552464212] [2019-12-07 18:21:00,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:01,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:21:01,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 18:21:01,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:21:01,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 18:21:01,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490779019] [2019-12-07 18:21:01,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:01,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:01,193 INFO L87 Difference]: Start difference. First operand 5767 states and 6798 transitions. Second operand 3 states. [2019-12-07 18:21:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:02,370 INFO L93 Difference]: Finished difference Result 11532 states and 13594 transitions. [2019-12-07 18:21:02,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:02,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 515 [2019-12-07 18:21:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:02,386 INFO L225 Difference]: With dead ends: 11532 [2019-12-07 18:21:02,386 INFO L226 Difference]: Without dead ends: 5767 [2019-12-07 18:21:02,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 514 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-12-07 18:21:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-12-07 18:21:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-12-07 18:21:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6780 transitions. [2019-12-07 18:21:02,436 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6780 transitions. Word has length 515 [2019-12-07 18:21:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:02,436 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6780 transitions. [2019-12-07 18:21:02,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6780 transitions. [2019-12-07 18:21:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-12-07 18:21:02,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:02,442 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:02,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:21:02,643 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2049638368, now seen corresponding path program 1 times [2019-12-07 18:21:02,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:02,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939416082] [2019-12-07 18:21:02,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:21:02,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939416082] [2019-12-07 18:21:02,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:02,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:02,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402091504] [2019-12-07 18:21:02,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:02,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:02,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:02,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:02,892 INFO L87 Difference]: Start difference. First operand 5767 states and 6780 transitions. Second operand 4 states. [2019-12-07 18:21:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:05,193 INFO L93 Difference]: Finished difference Result 11534 states and 13564 transitions. [2019-12-07 18:21:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:21:05,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2019-12-07 18:21:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:05,200 INFO L225 Difference]: With dead ends: 11534 [2019-12-07 18:21:05,200 INFO L226 Difference]: Without dead ends: 5769 [2019-12-07 18:21:05,204 INFO L630 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-12-07 18:21:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-12-07 18:21:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5764. [2019-12-07 18:21:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-12-07 18:21:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6601 transitions. [2019-12-07 18:21:05,243 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6601 transitions. Word has length 518 [2019-12-07 18:21:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:05,243 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6601 transitions. [2019-12-07 18:21:05,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6601 transitions. [2019-12-07 18:21:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2019-12-07 18:21:05,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:05,247 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:05,247 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash 703199593, now seen corresponding path program 1 times [2019-12-07 18:21:05,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:05,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321404255] [2019-12-07 18:21:05,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 573 proven. 3 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 18:21:06,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321404255] [2019-12-07 18:21:06,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161042075] [2019-12-07 18:21:06,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:06,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:21:06,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 18:21:06,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:21:06,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 18:21:06,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659394735] [2019-12-07 18:21:06,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:06,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:06,422 INFO L87 Difference]: Start difference. First operand 5764 states and 6601 transitions. Second operand 3 states. [2019-12-07 18:21:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:08,089 INFO L93 Difference]: Finished difference Result 16022 states and 18422 transitions. [2019-12-07 18:21:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:08,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 550 [2019-12-07 18:21:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:08,100 INFO L225 Difference]: With dead ends: 16022 [2019-12-07 18:21:08,101 INFO L226 Difference]: Without dead ends: 10260 [2019-12-07 18:21:08,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2019-12-07 18:21:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9953. [2019-12-07 18:21:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9953 states. [2019-12-07 18:21:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9953 states to 9953 states and 11216 transitions. [2019-12-07 18:21:08,179 INFO L78 Accepts]: Start accepts. Automaton has 9953 states and 11216 transitions. Word has length 550 [2019-12-07 18:21:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:08,180 INFO L462 AbstractCegarLoop]: Abstraction has 9953 states and 11216 transitions. [2019-12-07 18:21:08,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9953 states and 11216 transitions. [2019-12-07 18:21:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-12-07 18:21:08,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:08,184 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:08,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:21:08,385 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1248358995, now seen corresponding path program 1 times [2019-12-07 18:21:08,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563500136] [2019-12-07 18:21:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-12-07 18:21:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563500136] [2019-12-07 18:21:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:08,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484070319] [2019-12-07 18:21:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:08,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:08,632 INFO L87 Difference]: Start difference. First operand 9953 states and 11216 transitions. Second operand 3 states. [2019-12-07 18:21:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:11,077 INFO L93 Difference]: Finished difference Result 20201 states and 22769 transitions. [2019-12-07 18:21:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:11,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 563 [2019-12-07 18:21:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:11,089 INFO L225 Difference]: With dead ends: 20201 [2019-12-07 18:21:11,089 INFO L226 Difference]: Without dead ends: 10250 [2019-12-07 18:21:11,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2019-12-07 18:21:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 9951. [2019-12-07 18:21:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9951 states. [2019-12-07 18:21:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9951 states to 9951 states and 11212 transitions. [2019-12-07 18:21:11,167 INFO L78 Accepts]: Start accepts. Automaton has 9951 states and 11212 transitions. Word has length 563 [2019-12-07 18:21:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:11,167 INFO L462 AbstractCegarLoop]: Abstraction has 9951 states and 11212 transitions. [2019-12-07 18:21:11,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9951 states and 11212 transitions. [2019-12-07 18:21:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-12-07 18:21:11,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:11,174 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:11,174 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash -939629100, now seen corresponding path program 1 times [2019-12-07 18:21:11,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:11,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630746748] [2019-12-07 18:21:11,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 649 proven. 3 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 18:21:12,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630746748] [2019-12-07 18:21:12,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293669087] [2019-12-07 18:21:12,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:12,214 INFO L264 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:21:12,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:21:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 613 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 18:21:12,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:21:12,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 18:21:12,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878214496] [2019-12-07 18:21:12,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:21:12,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:21:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:21:12,744 INFO L87 Difference]: Start difference. First operand 9951 states and 11212 transitions. Second operand 9 states. [2019-12-07 18:21:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:21,335 INFO L93 Difference]: Finished difference Result 25735 states and 28732 transitions. [2019-12-07 18:21:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:21:21,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 626 [2019-12-07 18:21:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:21,347 INFO L225 Difference]: With dead ends: 25735 [2019-12-07 18:21:21,347 INFO L226 Difference]: Without dead ends: 11145 [2019-12-07 18:21:21,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 624 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:21:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11145 states. [2019-12-07 18:21:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11145 to 10846. [2019-12-07 18:21:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10846 states. [2019-12-07 18:21:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 11342 transitions. [2019-12-07 18:21:21,429 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 11342 transitions. Word has length 626 [2019-12-07 18:21:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:21,429 INFO L462 AbstractCegarLoop]: Abstraction has 10846 states and 11342 transitions. [2019-12-07 18:21:21,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:21:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 11342 transitions. [2019-12-07 18:21:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-12-07 18:21:21,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:21,435 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:21,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:21:21,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash 543791112, now seen corresponding path program 1 times [2019-12-07 18:21:21,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:21,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460645906] [2019-12-07 18:21:21,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-12-07 18:21:22,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460645906] [2019-12-07 18:21:22,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:22,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:22,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937126309] [2019-12-07 18:21:22,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:22,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:22,015 INFO L87 Difference]: Start difference. First operand 10846 states and 11342 transitions. Second operand 5 states. [2019-12-07 18:21:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:23,789 INFO L93 Difference]: Finished difference Result 28270 states and 29565 transitions. [2019-12-07 18:21:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:23,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 687 [2019-12-07 18:21:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:23,807 INFO L225 Difference]: With dead ends: 28270 [2019-12-07 18:21:23,807 INFO L226 Difference]: Without dead ends: 17426 [2019-12-07 18:21:23,815 INFO L630 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-12-07 18:21:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17426 states. [2019-12-07 18:21:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17426 to 12039. [2019-12-07 18:21:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12039 states. [2019-12-07 18:21:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 12553 transitions. [2019-12-07 18:21:23,923 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 12553 transitions. Word has length 687 [2019-12-07 18:21:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:23,923 INFO L462 AbstractCegarLoop]: Abstraction has 12039 states and 12553 transitions. [2019-12-07 18:21:23,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 12553 transitions. [2019-12-07 18:21:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-12-07 18:21:23,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:23,931 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:23,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1908358813, now seen corresponding path program 1 times [2019-12-07 18:21:23,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:23,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417153034] [2019-12-07 18:21:23,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-12-07 18:21:24,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417153034] [2019-12-07 18:21:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:24,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088312689] [2019-12-07 18:21:24,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:24,323 INFO L87 Difference]: Start difference. First operand 12039 states and 12553 transitions. Second operand 3 states. [2019-12-07 18:21:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:25,350 INFO L93 Difference]: Finished difference Result 26467 states and 27614 transitions. [2019-12-07 18:21:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:25,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 692 [2019-12-07 18:21:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:25,359 INFO L225 Difference]: With dead ends: 26467 [2019-12-07 18:21:25,360 INFO L226 Difference]: Without dead ends: 14430 [2019-12-07 18:21:25,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14430 states. [2019-12-07 18:21:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14430 to 11440. [2019-12-07 18:21:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2019-12-07 18:21:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 11904 transitions. [2019-12-07 18:21:25,448 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 11904 transitions. Word has length 692 [2019-12-07 18:21:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:25,449 INFO L462 AbstractCegarLoop]: Abstraction has 11440 states and 11904 transitions. [2019-12-07 18:21:25,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 11904 transitions. [2019-12-07 18:21:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-12-07 18:21:25,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:25,457 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:25,458 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1116494967, now seen corresponding path program 1 times [2019-12-07 18:21:25,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:25,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504719556] [2019-12-07 18:21:25,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-12-07 18:21:25,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504719556] [2019-12-07 18:21:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:25,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:25,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694647296] [2019-12-07 18:21:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:25,872 INFO L87 Difference]: Start difference. First operand 11440 states and 11904 transitions. Second operand 3 states. [2019-12-07 18:21:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:26,519 INFO L93 Difference]: Finished difference Result 21044 states and 21901 transitions. [2019-12-07 18:21:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:26,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 752 [2019-12-07 18:21:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:26,525 INFO L225 Difference]: With dead ends: 21044 [2019-12-07 18:21:26,525 INFO L226 Difference]: Without dead ends: 9606 [2019-12-07 18:21:26,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-12-07 18:21:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 8709. [2019-12-07 18:21:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8709 states. [2019-12-07 18:21:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 8969 transitions. [2019-12-07 18:21:26,585 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 8969 transitions. Word has length 752 [2019-12-07 18:21:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:26,585 INFO L462 AbstractCegarLoop]: Abstraction has 8709 states and 8969 transitions. [2019-12-07 18:21:26,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 8969 transitions. [2019-12-07 18:21:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-12-07 18:21:26,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:26,594 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:26,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1610032020, now seen corresponding path program 1 times [2019-12-07 18:21:26,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:26,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737515230] [2019-12-07 18:21:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 424 proven. 60 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-12-07 18:21:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737515230] [2019-12-07 18:21:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45371741] [2019-12-07 18:21:27,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:27,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:21:27,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:27,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-12-07 18:21:27,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:21:27,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-12-07 18:21:27,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537206743] [2019-12-07 18:21:27,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:27,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:27,999 INFO L87 Difference]: Start difference. First operand 8709 states and 8969 transitions. Second operand 3 states. [2019-12-07 18:21:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:28,859 INFO L93 Difference]: Finished difference Result 18016 states and 18545 transitions. [2019-12-07 18:21:28,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:28,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 808 [2019-12-07 18:21:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:28,865 INFO L225 Difference]: With dead ends: 18016 [2019-12-07 18:21:28,865 INFO L226 Difference]: Without dead ends: 9309 [2019-12-07 18:21:28,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9309 states. [2019-12-07 18:21:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9309 to 9009. [2019-12-07 18:21:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2019-12-07 18:21:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 9271 transitions. [2019-12-07 18:21:28,925 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 9271 transitions. Word has length 808 [2019-12-07 18:21:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:28,926 INFO L462 AbstractCegarLoop]: Abstraction has 9009 states and 9271 transitions. [2019-12-07 18:21:28,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 9271 transitions. [2019-12-07 18:21:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2019-12-07 18:21:28,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:28,935 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:29,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:21:29,136 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash -116249522, now seen corresponding path program 1 times [2019-12-07 18:21:29,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:29,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232098498] [2019-12-07 18:21:29,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 163 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232098498] [2019-12-07 18:21:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646498498] [2019-12-07 18:21:31,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:31,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:21:31,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:21:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 677 proven. 54 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-12-07 18:21:32,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:21:32,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 15 [2019-12-07 18:21:32,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359995359] [2019-12-07 18:21:32,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:21:32,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:32,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:21:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:21:32,577 INFO L87 Difference]: Start difference. First operand 9009 states and 9271 transitions. Second operand 15 states. [2019-12-07 18:21:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:49,142 INFO L93 Difference]: Finished difference Result 28538 states and 29396 transitions. [2019-12-07 18:21:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:21:49,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 827 [2019-12-07 18:21:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:49,155 INFO L225 Difference]: With dead ends: 28538 [2019-12-07 18:21:49,155 INFO L226 Difference]: Without dead ends: 18921 [2019-12-07 18:21:49,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 842 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:21:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-12-07 18:21:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 10802. [2019-12-07 18:21:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10802 states. [2019-12-07 18:21:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10802 states to 10802 states and 11091 transitions. [2019-12-07 18:21:49,272 INFO L78 Accepts]: Start accepts. Automaton has 10802 states and 11091 transitions. Word has length 827 [2019-12-07 18:21:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:49,272 INFO L462 AbstractCegarLoop]: Abstraction has 10802 states and 11091 transitions. [2019-12-07 18:21:49,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:21:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10802 states and 11091 transitions. [2019-12-07 18:21:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-12-07 18:21:49,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:49,284 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:49,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:21:49,484 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2066422329, now seen corresponding path program 1 times [2019-12-07 18:21:49,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:49,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379664081] [2019-12-07 18:21:49,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 796 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-12-07 18:21:49,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379664081] [2019-12-07 18:21:49,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:49,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:49,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544143598] [2019-12-07 18:21:49,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:49,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:49,997 INFO L87 Difference]: Start difference. First operand 10802 states and 11091 transitions. Second operand 3 states. [2019-12-07 18:21:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:50,700 INFO L93 Difference]: Finished difference Result 22805 states and 23442 transitions. [2019-12-07 18:21:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:50,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2019-12-07 18:21:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:50,708 INFO L225 Difference]: With dead ends: 22805 [2019-12-07 18:21:50,708 INFO L226 Difference]: Without dead ends: 12304 [2019-12-07 18:21:50,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12304 states. [2019-12-07 18:21:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12304 to 10800. [2019-12-07 18:21:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10800 states. [2019-12-07 18:21:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10800 states to 10800 states and 11096 transitions. [2019-12-07 18:21:50,792 INFO L78 Accepts]: Start accepts. Automaton has 10800 states and 11096 transitions. Word has length 847 [2019-12-07 18:21:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:50,792 INFO L462 AbstractCegarLoop]: Abstraction has 10800 states and 11096 transitions. [2019-12-07 18:21:50,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 10800 states and 11096 transitions. [2019-12-07 18:21:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-12-07 18:21:50,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:50,804 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:50,804 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1095195449, now seen corresponding path program 1 times [2019-12-07 18:21:50,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298506877] [2019-12-07 18:21:50,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 871 proven. 139 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 18:21:51,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298506877] [2019-12-07 18:21:51,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351849952] [2019-12-07 18:21:51,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:21:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:51,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:21:51,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:21:51,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:21:51,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:51,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:51,825 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-12-07 18:21:51,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:51,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:21:51,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:21:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 823 proven. 187 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 18:21:52,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:21:52,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 18:21:52,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13505605] [2019-12-07 18:21:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:21:52,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:21:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:21:52,673 INFO L87 Difference]: Start difference. First operand 10800 states and 11096 transitions. Second operand 12 states. [2019-12-07 18:22:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:08,602 INFO L93 Difference]: Finished difference Result 29705 states and 30534 transitions. [2019-12-07 18:22:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 18:22:08,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 860 [2019-12-07 18:22:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:08,613 INFO L225 Difference]: With dead ends: 29705 [2019-12-07 18:22:08,613 INFO L226 Difference]: Without dead ends: 18303 [2019-12-07 18:22:08,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 18:22:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-07 18:22:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 10199. [2019-12-07 18:22:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10199 states. [2019-12-07 18:22:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 10369 transitions. [2019-12-07 18:22:08,720 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 10369 transitions. Word has length 860 [2019-12-07 18:22:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:08,721 INFO L462 AbstractCegarLoop]: Abstraction has 10199 states and 10369 transitions. [2019-12-07 18:22:08,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:22:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 10369 transitions. [2019-12-07 18:22:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2019-12-07 18:22:08,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:08,732 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:08,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:08,934 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:08,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1796046328, now seen corresponding path program 1 times [2019-12-07 18:22:08,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:08,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314359916] [2019-12-07 18:22:08,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 786 proven. 549 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 18:22:10,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314359916] [2019-12-07 18:22:10,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678607901] [2019-12-07 18:22:10,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/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-12-07 18:22:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:10,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:22:10,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:10,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1129 proven. 76 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 18:22:11,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:11,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-12-07 18:22:11,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530808534] [2019-12-07 18:22:11,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:22:11,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:22:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:11,159 INFO L87 Difference]: Start difference. First operand 10199 states and 10369 transitions. Second operand 14 states. [2019-12-07 18:22:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,089 INFO L93 Difference]: Finished difference Result 27119 states and 27548 transitions. [2019-12-07 18:22:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:22:21,090 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 917 [2019-12-07 18:22:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,099 INFO L225 Difference]: With dead ends: 27119 [2019-12-07 18:22:21,100 INFO L226 Difference]: Without dead ends: 16919 [2019-12-07 18:22:21,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 937 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:22:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16919 states. [2019-12-07 18:22:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16919 to 11992. [2019-12-07 18:22:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11992 states. [2019-12-07 18:22:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11992 states to 11992 states and 12172 transitions. [2019-12-07 18:22:21,218 INFO L78 Accepts]: Start accepts. Automaton has 11992 states and 12172 transitions. Word has length 917 [2019-12-07 18:22:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,218 INFO L462 AbstractCegarLoop]: Abstraction has 11992 states and 12172 transitions. [2019-12-07 18:22:21,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:22:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11992 states and 12172 transitions. [2019-12-07 18:22:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2019-12-07 18:22:21,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:21,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:21,428 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1966924578, now seen corresponding path program 1 times [2019-12-07 18:22:21,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088885645] [2019-12-07 18:22:21,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-12-07 18:22:22,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088885645] [2019-12-07 18:22:22,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:22,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856298967] [2019-12-07 18:22:22,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:22,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:22,204 INFO L87 Difference]: Start difference. First operand 11992 states and 12172 transitions. Second operand 5 states. [2019-12-07 18:22:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:23,434 INFO L93 Difference]: Finished difference Result 14697 states and 14911 transitions. [2019-12-07 18:22:23,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:23,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 929 [2019-12-07 18:22:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:23,436 INFO L225 Difference]: With dead ends: 14697 [2019-12-07 18:22:23,436 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:22:23,439 INFO L630 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-12-07 18:22:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:22:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:22:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:22:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:22:23,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 929 [2019-12-07 18:22:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:23,440 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:22:23,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:22:23,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:22:23,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:22:23,988 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 519 [2019-12-07 18:22:24,498 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 519 [2019-12-07 18:22:24,798 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 508 DAG size of output: 441 [2019-12-07 18:22:29,349 WARN L192 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 493 DAG size of output: 171 [2019-12-07 18:22:33,972 WARN L192 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 493 DAG size of output: 171 [2019-12-07 18:22:38,032 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 422 DAG size of output: 168 [2019-12-07 18:22:38,035 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,035 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,035 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,036 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,037 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,038 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,039 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:22:38,040 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,041 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,042 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,043 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,044 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:22:38,045 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,046 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse32 (+ ~a4~0 86))) (let ((.cse15 (= 4 ~a2~0)) (.cse18 (= 1 ~a2~0)) (.cse8 (<= .cse32 0)) (.cse27 (<= 0 (+ ~a0~0 44))) (.cse7 (= 2 ~a2~0)) (.cse31 (+ ~a0~0 147))) (let ((.cse24 (<= 48792 ~a29~0)) (.cse3 (<= .cse31 0)) (.cse12 (< 43 ~a29~0)) (.cse23 (exists ((v_~a29~0_897 Int)) (let ((.cse35 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse35 (+ ~a29~0 14)) (not (= .cse35 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse22 (<= (+ ~a0~0 98) 0)) (.cse17 (exists ((v_~a29~0_899 Int)) (let ((.cse34 (mod v_~a29~0_899 63))) (and (<= .cse34 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse34 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse29 (not .cse7)) (.cse5 (let ((.cse33 (not (= 5 ~a2~0)))) (or (and .cse8 .cse33) (and .cse33 .cse27)))) (.cse14 (<= 0 (+ ~a29~0 600001))) (.cse11 (= 3 ~a2~0)) (.cse13 (<= (+ ~a29~0 144) 0)) (.cse16 (<= 0 (+ ~a29~0 599991))) (.cse30 (< 0 .cse32)) (.cse26 (or (and .cse18 .cse27) (and .cse8 .cse18))) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse6 (<= 0 (+ ~a29~0 140))) (.cse25 (<= ~a29~0 42)) (.cse21 (<= (+ ~a0~0 148) 0)) (.cse0 (<= 2 ~a2~0)) (.cse2 (< 0 (+ ~a29~0 16))) (.cse19 (< 0 .cse31)) (.cse20 (<= ~a29~0 43)) (.cse4 (not .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse7) (and .cse8 (exists ((v_~a29~0_896 Int)) (let ((.cse9 (mod v_~a29~0_896 299928))) (and (= 0 .cse9) (<= (+ ~a29~0 173705) .cse9) (<= (+ v_~a29~0_896 144) 0)))) .cse10) (and .cse8 .cse11 .cse12) (and .cse1 .cse3 .cse13 .cse14 .cse11) (and .cse1 .cse5 .cse13 .cse15 .cse16) (and .cse17 .cse1 .cse18 .cse19 .cse20 .cse10) (and .cse1 .cse18 .cse6 .cse21) (and .cse1 .cse22 .cse23 .cse7) (and .cse17 .cse1 .cse3 .cse11) (and .cse5 .cse10 .cse15) (and .cse22 .cse1 .cse18 .cse20 .cse19 .cse16) (and .cse22 .cse1 .cse15 .cse24) (and .cse1 .cse5 .cse2 .cse20 .cse11) (and .cse1 .cse17 .cse5 .cse25 .cse15) (and .cse1 .cse21 .cse11 .cse16) (and .cse0 .cse8 .cse4 .cse24) (and .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse1 .cse5 .cse13 .cse7 .cse14) (and .cse5 .cse7 .cse10) (and .cse3 .cse7 .cse12) (and .cse8 .cse19 .cse10) (let ((.cse28 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse26 .cse27 (<= .cse28 0) (<= 0 .cse28))) (and .cse8 .cse23 .cse10) (and .cse0 .cse22 .cse1 .cse29 .cse30 .cse6 .cse4) (and .cse0 .cse17 .cse1 .cse29 .cse30 .cse21 .cse4) (and .cse5 .cse11 .cse10) (and .cse1 .cse5 .cse13 .cse14 .cse11) (and .cse1 .cse21 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse30 .cse18 .cse20) (and .cse26 .cse10) (and .cse1 .cse6 .cse25 .cse21 .cse15) (and .cse0 .cse8 .cse2 .cse19 .cse20 .cse4))))) [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:22:38,047 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:22:38,048 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,049 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse33 (+ ~a4~0 86))) (let ((.cse14 (= 4 ~a2~0)) (.cse17 (= 1 ~a2~0)) (.cse8 (<= .cse33 0)) (.cse28 (<= 0 (+ ~a0~0 44))) (.cse7 (= 2 ~a2~0)) (.cse31 (+ ~a0~0 147))) (let ((.cse26 (<= 48792 ~a29~0)) (.cse22 (<= 0 (+ ~a29~0 600001))) (.cse3 (<= .cse31 0)) (.cse12 (< 43 ~a29~0)) (.cse24 (exists ((v_~a29~0_897 Int)) (let ((.cse35 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse35 (+ ~a29~0 14)) (not (= .cse35 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse23 (<= (+ ~a0~0 98) 0)) (.cse16 (exists ((v_~a29~0_899 Int)) (let ((.cse34 (mod v_~a29~0_899 63))) (and (<= .cse34 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse34 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse30 (not .cse7)) (.cse21 (< 0 .cse33)) (.cse5 (let ((.cse32 (not (= 5 ~a2~0)))) (or (and .cse8 .cse32) (and .cse32 .cse28)))) (.cse11 (= 3 ~a2~0)) (.cse13 (<= (+ ~a29~0 144) 0)) (.cse15 (<= 0 (+ ~a29~0 599991))) (.cse27 (or (and .cse17 .cse28) (and .cse8 .cse17))) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse6 (<= 0 (+ ~a29~0 140))) (.cse25 (<= ~a29~0 42)) (.cse20 (<= (+ ~a0~0 148) 0)) (.cse0 (<= 2 ~a2~0)) (.cse2 (< 0 (+ ~a29~0 16))) (.cse18 (< 0 .cse31)) (.cse19 (<= ~a29~0 43)) (.cse4 (not .cse14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse7) (and .cse8 (exists ((v_~a29~0_896 Int)) (let ((.cse9 (mod v_~a29~0_896 299928))) (and (= 0 .cse9) (<= (+ ~a29~0 173705) .cse9) (<= (+ v_~a29~0_896 144) 0)))) .cse10) (and .cse8 .cse11 .cse12) (and .cse1 .cse5 .cse13 .cse14 .cse15) (and .cse16 .cse1 .cse17 .cse18 .cse19 .cse10) (and .cse1 .cse17 .cse6 .cse20) (and .cse1 .cse21 .cse2 .cse17 .cse19) (and .cse1 .cse5 .cse13 .cse11 .cse22) (and .cse1 .cse23 .cse24 .cse7) (and .cse5 .cse10 .cse14) (and .cse23 .cse1 .cse17 .cse19 .cse18 .cse15) (and .cse1 .cse16 .cse5 .cse25 .cse14) (and .cse1 .cse5 .cse2 .cse19 .cse11) (and .cse23 .cse1 .cse14 .cse26) (and .cse1 .cse3 .cse13 .cse11 .cse22) (and .cse0 .cse8 .cse4 .cse26) (and (or (and .cse16 .cse1 .cse3 .cse11) (and .cse1 .cse20 .cse11)) .cse22) (and .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse1 .cse5 .cse13 .cse7 .cse22) (and .cse5 .cse7 .cse10) (and .cse8 .cse27 .cse13) (and .cse3 .cse7 .cse12) (and .cse8 .cse18 .cse10) (let ((.cse29 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse27 .cse28 (<= .cse29 0) (<= 0 .cse29))) (and .cse8 .cse24 .cse10) (and .cse0 .cse23 .cse1 .cse30 .cse21 .cse6 .cse4) (and .cse0 .cse16 .cse1 .cse30 .cse21 .cse20 .cse4) (and .cse5 .cse11 .cse10) (and .cse1 .cse20 .cse13 .cse14 .cse15) (and .cse27 .cse10) (and .cse1 .cse6 .cse25 .cse20 .cse14) (and .cse0 .cse8 .cse2 .cse18 .cse19 .cse4))))) [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:22:38,050 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,051 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,052 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,053 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse33 (+ ~a4~0 86))) (let ((.cse14 (= 4 ~a2~0)) (.cse17 (= 1 ~a2~0)) (.cse8 (<= .cse33 0)) (.cse28 (<= 0 (+ ~a0~0 44))) (.cse7 (= 2 ~a2~0)) (.cse31 (+ ~a0~0 147))) (let ((.cse26 (<= 48792 ~a29~0)) (.cse22 (<= 0 (+ ~a29~0 600001))) (.cse3 (<= .cse31 0)) (.cse12 (< 43 ~a29~0)) (.cse24 (exists ((v_~a29~0_897 Int)) (let ((.cse35 (mod (+ v_~a29~0_897 11) 29))) (and (<= .cse35 (+ ~a29~0 14)) (not (= .cse35 0)) (< (+ v_~a29~0_897 371124) 0))))) (.cse23 (<= (+ ~a0~0 98) 0)) (.cse16 (exists ((v_~a29~0_899 Int)) (let ((.cse34 (mod v_~a29~0_899 63))) (and (<= .cse34 (+ ~a29~0 143)) (< v_~a29~0_899 0) (not (= .cse34 0)) (<= (+ v_~a29~0_899 144) 0))))) (.cse30 (not .cse7)) (.cse21 (< 0 .cse33)) (.cse5 (let ((.cse32 (not (= 5 ~a2~0)))) (or (and .cse8 .cse32) (and .cse32 .cse28)))) (.cse11 (= 3 ~a2~0)) (.cse13 (<= (+ ~a29~0 144) 0)) (.cse15 (<= 0 (+ ~a29~0 599991))) (.cse27 (or (and .cse17 .cse28) (and .cse8 .cse17))) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse6 (<= 0 (+ ~a29~0 140))) (.cse25 (<= ~a29~0 42)) (.cse20 (<= (+ ~a0~0 148) 0)) (.cse0 (<= 2 ~a2~0)) (.cse2 (< 0 (+ ~a29~0 16))) (.cse18 (< 0 .cse31)) (.cse19 (<= ~a29~0 43)) (.cse4 (not .cse14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse7) (and .cse8 (exists ((v_~a29~0_896 Int)) (let ((.cse9 (mod v_~a29~0_896 299928))) (and (= 0 .cse9) (<= (+ ~a29~0 173705) .cse9) (<= (+ v_~a29~0_896 144) 0)))) .cse10) (and .cse8 .cse11 .cse12) (and .cse1 .cse5 .cse13 .cse14 .cse15) (and .cse16 .cse1 .cse17 .cse18 .cse19 .cse10) (and .cse1 .cse17 .cse6 .cse20) (and .cse1 .cse21 .cse2 .cse17 .cse19) (and .cse1 .cse5 .cse13 .cse11 .cse22) (and .cse1 .cse23 .cse24 .cse7) (and .cse5 .cse10 .cse14) (and .cse23 .cse1 .cse17 .cse19 .cse18 .cse15) (and .cse1 .cse16 .cse5 .cse25 .cse14) (and .cse1 .cse5 .cse2 .cse19 .cse11) (and .cse23 .cse1 .cse14 .cse26) (and .cse1 .cse3 .cse13 .cse11 .cse22) (and .cse0 .cse8 .cse4 .cse26) (and (or (and .cse16 .cse1 .cse3 .cse11) (and .cse1 .cse20 .cse11)) .cse22) (and .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse1 .cse5 .cse13 .cse7 .cse22) (and .cse5 .cse7 .cse10) (and .cse8 .cse27 .cse13) (and .cse3 .cse7 .cse12) (and .cse8 .cse18 .cse10) (let ((.cse29 (+ ~a29~0 127))) (and (<= (+ ~a4~0 89) 0) .cse27 .cse28 (<= .cse29 0) (<= 0 .cse29))) (and .cse8 .cse24 .cse10) (and .cse0 .cse23 .cse1 .cse30 .cse21 .cse6 .cse4) (and .cse0 .cse16 .cse1 .cse30 .cse21 .cse20 .cse4) (and .cse5 .cse11 .cse10) (and .cse1 .cse20 .cse13 .cse14 .cse15) (and .cse27 .cse10) (and .cse1 .cse6 .cse25 .cse20 .cse14) (and .cse0 .cse8 .cse2 .cse18 .cse19 .cse4))))) [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,054 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:22:38,055 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,056 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,057 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,058 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,059 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:22:38,059 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:22:38,059 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 18:22:38,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:38 BoogieIcfgContainer [2019-12-07 18:22:38,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:38,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:38,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:38,133 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:38,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:39" (3/4) ... [2019-12-07 18:22:38,137 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:22:38,167 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 18:22:38,169 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:22:38,193 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) || ((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) [2019-12-07 18:22:38,196 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) || ((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) [2019-12-07 18:22:38,206 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 0 <= a29 + 600001) && 3 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) && 0 <= a29 + 599991)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 0 <= a29 + 600001) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) [2019-12-07 18:22:38,327 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d96598a8-6f40-47e2-8d25-85a99a274d4b/bin/uautomizer/witness.graphml [2019-12-07 18:22:38,327 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:38,328 INFO L168 Benchmark]: Toolchain (without parser) took 122599.77 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 939.9 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 394.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,328 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:38,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 939.9 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.0 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,329 INFO L168 Benchmark]: Boogie Preprocessor took 142.78 ms. Allocated memory is still 1.1 GB. Free memory was 985.0 MB in the beginning and 963.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,329 INFO L168 Benchmark]: RCFGBuilder took 2406.75 ms. Allocated memory is still 1.1 GB. Free memory was 963.5 MB in the beginning and 899.9 MB in the end (delta: 63.6 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,329 INFO L168 Benchmark]: TraceAbstraction took 119020.47 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 899.9 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,329 INFO L168 Benchmark]: Witness Printer took 194.01 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:38,330 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 939.9 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.0 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 142.78 ms. Allocated memory is still 1.1 GB. Free memory was 985.0 MB in the beginning and 963.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2406.75 ms. Allocated memory is still 1.1 GB. Free memory was 963.5 MB in the beginning and 899.9 MB in the end (delta: 63.6 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119020.47 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 899.9 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 194.01 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 193]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 18:22:38,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) || ((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 18:22:38,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 600001)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) || ((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2)) && 0 <= a29 + 600001)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 18:22:38,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 18:22:38,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2019-12-07 18:22:38,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && 0 < a29 + 16) && a0 + 147 <= 0) && !(4 == a2)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 <= a29 + 140) && 2 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_896 : int :: (0 == v_~a29~0_896 % 299928 && a29 + 173705 <= v_~a29~0_896 % 299928) && v_~a29~0_896 + 144 <= 0)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 144 <= 0) && 0 <= a29 + 600001) && 3 == a2)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 1 == a2) && 0 <= a29 + 140) && a0 + 148 <= 0)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && 2 == a2)) || ((((\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a0 + 61 <= 0) && 4 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 599991)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 == a2) && 48792 <= a29)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && 0 < a29 + 16) && a29 <= 43) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 <= 42) && 4 == a2)) || (((a4 + 42 <= 0 && a0 + 148 <= 0) && 3 == a2) && 0 <= a29 + 599991)) || (((2 <= a2 && a4 + 86 <= 0) && !(4 == a2)) && 48792 <= a29)) || ((((((a4 + 86 <= 0 && !(3 == input)) && a4 + 42 <= 0) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 2 == a2) && 0 <= a29 + 600001)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 2 == a2) && a0 + 61 <= 0)) || ((a0 + 147 <= 0 && 2 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_897 : int :: ((v_~a29~0_897 + 11) % 29 <= a29 + 14 && !((v_~a29~0_897 + 11) % 29 == 0)) && v_~a29~0_897 + 371124 < 0)) && a0 + 61 <= 0)) || ((((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && 0 <= a29 + 140) && !(4 == a2))) || ((((((2 <= a2 && (\exists v_~a29~0_899 : int :: ((v_~a29~0_899 % 63 <= a29 + 143 && v_~a29~0_899 < 0) && !(v_~a29~0_899 % 63 == 0)) && v_~a29~0_899 + 144 <= 0)) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a4 + 86) && a0 + 148 <= 0) && !(4 == a2))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && a29 + 144 <= 0) && 0 <= a29 + 600001) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 148 <= 0) && a29 + 144 <= 0) && 4 == a2) && 0 <= a29 + 599991)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 < a4 + 86) && 1 == a2) && a29 <= 43)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 140) && a29 <= 42) && a0 + 148 <= 0) && 4 == a2)) || (((((2 <= a2 && a4 + 86 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && a29 <= 43) && !(4 == a2)) - 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: 104.2s, OverallIterations: 20, TraceHistogramMax: 6, AutomataDifference: 83.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.5s, HoareTripleCheckerStatistics: 4396 SDtfs, 31534 SDslu, 1754 SDs, 0 SdLazy, 76800 SolverSat, 5500 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 68.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5601 GetRequests, 5416 SyntacticMatches, 21 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12039occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 35843 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 237 NumberOfFragments, 2945 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1231781 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1441416 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 17237 NumberOfCodeBlocks, 17237 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17209 ConstructedInterpolants, 461 QuantifiedInterpolants, 46089360 SizeOfPredicates, 14 NumberOfNonLiveVariables, 6356 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 20717/22748 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...