./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14831cf592bc13b54caac21143b5bc01f6bc3848 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:02:07,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:02:07,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:02:07,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:02:07,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:02:07,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:02:07,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:02:07,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:02:07,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:02:07,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:02:07,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:02:07,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:02:07,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:02:07,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:02:07,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:02:07,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:02:07,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:02:07,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:02:07,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:02:07,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:02:07,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:02:07,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:02:07,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:02:07,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:02:07,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:02:07,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:02:07,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:02:07,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:02:07,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:02:07,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:02:07,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:02:07,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:02:07,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:02:07,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:02:07,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:02:07,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:02:07,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:02:07,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:02:07,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:02:07,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:02:07,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:02:07,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:02:07,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:02:07,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:02:07,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:02:07,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:02:07,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:02:07,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:02:07,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:02:07,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:02:07,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:02:07,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:02:07,599 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_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14831cf592bc13b54caac21143b5bc01f6bc3848 [2019-12-07 11:02:07,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:02:07,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:02:07,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:02:07,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:02:07,714 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:02:07,715 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2019-12-07 11:02:07,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/data/5c5525b69/acc6ebcd622c49b983d058451eec1517/FLAG6c1bcf246 [2019-12-07 11:02:08,284 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:02:08,284 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/sv-benchmarks/c/eca-rers2012/Problem15_label27.c [2019-12-07 11:02:08,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/data/5c5525b69/acc6ebcd622c49b983d058451eec1517/FLAG6c1bcf246 [2019-12-07 11:02:08,786 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/data/5c5525b69/acc6ebcd622c49b983d058451eec1517 [2019-12-07 11:02:08,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:02:08,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:02:08,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:08,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:02:08,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:02:08,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:08" (1/1) ... [2019-12-07 11:02:08,796 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 11:02:08, skipping insertion in model container [2019-12-07 11:02:08,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:08" (1/1) ... [2019-12-07 11:02:08,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:02:08,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:02:09,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:09,307 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:02:09,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:09,478 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:02:09,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09 WrapperNode [2019-12-07 11:02:09,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:09,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:09,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:02:09,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:02:09,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:09,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:02:09,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:02:09,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:02:09,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... [2019-12-07 11:02:09,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:02:09,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:02:09,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:02:09,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:02:09,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:02:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:02:09,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:02:12,227 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:02:12,227 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 11:02:12,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:12 BoogieIcfgContainer [2019-12-07 11:02:12,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:02:12,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:02:12,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:02:12,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:02:12,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:02:08" (1/3) ... [2019-12-07 11:02:12,231 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 11:02:12, skipping insertion in model container [2019-12-07 11:02:12,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:09" (2/3) ... [2019-12-07 11:02:12,232 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 11:02:12, skipping insertion in model container [2019-12-07 11:02:12,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:12" (3/3) ... [2019-12-07 11:02:12,233 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label27.c [2019-12-07 11:02:12,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:02:12,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:02:12,252 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:02:12,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:02:12,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:02:12,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:02:12,272 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:02:12,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:02:12,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:02:12,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:02:12,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:02:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 11:02:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:02:12,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:12,294 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] [2019-12-07 11:02:12,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-12-07 11:02:12,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:12,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 11:02:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:12,454 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 11:02:12,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 11:02:12,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:12,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880546209] [2019-12-07 11:02:12,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:12,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:12,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:12,470 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 11:02:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:15,033 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-12-07 11:02:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:15,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 11:02:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:15,052 INFO L225 Difference]: With dead ends: 1514 [2019-12-07 11:02:15,052 INFO L226 Difference]: Without dead ends: 1008 [2019-12-07 11:02:15,056 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 11:02:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-07 11:02:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-12-07 11:02:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 11:02:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-12-07 11:02:15,117 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 37 [2019-12-07 11:02:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:15,117 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-12-07 11:02:15,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-12-07 11:02:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 11:02:15,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:15,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:15,121 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1560092623, now seen corresponding path program 1 times [2019-12-07 11:02:15,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:15,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978144094] [2019-12-07 11:02:15,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:15,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978144094] [2019-12-07 11:02:15,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:15,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:15,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625475903] [2019-12-07 11:02:15,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:15,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:15,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:15,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:15,274 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 4 states. [2019-12-07 11:02:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:17,553 INFO L93 Difference]: Finished difference Result 2561 states and 4453 transitions. [2019-12-07 11:02:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:17,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 11:02:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:17,561 INFO L225 Difference]: With dead ends: 2561 [2019-12-07 11:02:17,561 INFO L226 Difference]: Without dead ends: 1886 [2019-12-07 11:02:17,562 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 11:02:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-12-07 11:02:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1881. [2019-12-07 11:02:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-07 11:02:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2859 transitions. [2019-12-07 11:02:17,595 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2859 transitions. Word has length 102 [2019-12-07 11:02:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:17,596 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 2859 transitions. [2019-12-07 11:02:17,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2859 transitions. [2019-12-07 11:02:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:02:17,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:17,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:17,599 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash -600642833, now seen corresponding path program 1 times [2019-12-07 11:02:17,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:17,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295013719] [2019-12-07 11:02:17,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:17,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295013719] [2019-12-07 11:02:17,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:17,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:17,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384589455] [2019-12-07 11:02:17,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:17,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:17,714 INFO L87 Difference]: Start difference. First operand 1881 states and 2859 transitions. Second operand 4 states. [2019-12-07 11:02:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:19,643 INFO L93 Difference]: Finished difference Result 7055 states and 10676 transitions. [2019-12-07 11:02:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:19,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 11:02:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:19,669 INFO L225 Difference]: With dead ends: 7055 [2019-12-07 11:02:19,669 INFO L226 Difference]: Without dead ends: 5176 [2019-12-07 11:02:19,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2019-12-07 11:02:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3376. [2019-12-07 11:02:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2019-12-07 11:02:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4559 transitions. [2019-12-07 11:02:19,724 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4559 transitions. Word has length 156 [2019-12-07 11:02:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:19,725 INFO L462 AbstractCegarLoop]: Abstraction has 3376 states and 4559 transitions. [2019-12-07 11:02:19,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4559 transitions. [2019-12-07 11:02:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-12-07 11:02:19,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:19,730 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:19,730 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:19,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1266153403, now seen corresponding path program 1 times [2019-12-07 11:02:19,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:19,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655322746] [2019-12-07 11:02:19,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-12-07 11:02:20,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655322746] [2019-12-07 11:02:20,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:20,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:20,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018280172] [2019-12-07 11:02:20,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:20,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:20,175 INFO L87 Difference]: Start difference. First operand 3376 states and 4559 transitions. Second operand 5 states. [2019-12-07 11:02:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:23,156 INFO L93 Difference]: Finished difference Result 7649 states and 10094 transitions. [2019-12-07 11:02:23,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:23,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2019-12-07 11:02:23,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:23,171 INFO L225 Difference]: With dead ends: 7649 [2019-12-07 11:02:23,171 INFO L226 Difference]: Without dead ends: 4275 [2019-12-07 11:02:23,174 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 11:02:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-07 11:02:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3974. [2019-12-07 11:02:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-12-07 11:02:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5199 transitions. [2019-12-07 11:02:23,229 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5199 transitions. Word has length 393 [2019-12-07 11:02:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:23,230 INFO L462 AbstractCegarLoop]: Abstraction has 3974 states and 5199 transitions. [2019-12-07 11:02:23,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5199 transitions. [2019-12-07 11:02:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-12-07 11:02:23,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:23,235 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:23,235 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1517405968, now seen corresponding path program 1 times [2019-12-07 11:02:23,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:23,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901862265] [2019-12-07 11:02:23,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:23,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901862265] [2019-12-07 11:02:23,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519913150] [2019-12-07 11:02:23,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:02:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:23,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:02:23,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:02:23,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:23,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:02:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:24,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:02:24,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-07 11:02:24,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117497897] [2019-12-07 11:02:24,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:02:24,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:02:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:24,100 INFO L87 Difference]: Start difference. First operand 3974 states and 5199 transitions. Second operand 9 states. [2019-12-07 11:02:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:43,985 INFO L93 Difference]: Finished difference Result 28097 states and 38064 transitions. [2019-12-07 11:02:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:02:43,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 414 [2019-12-07 11:02:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:44,050 INFO L225 Difference]: With dead ends: 28097 [2019-12-07 11:02:44,050 INFO L226 Difference]: Without dead ends: 24125 [2019-12-07 11:02:44,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:02:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24125 states. [2019-12-07 11:02:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24125 to 17168. [2019-12-07 11:02:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17168 states. [2019-12-07 11:02:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 21683 transitions. [2019-12-07 11:02:44,302 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 21683 transitions. Word has length 414 [2019-12-07 11:02:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:44,303 INFO L462 AbstractCegarLoop]: Abstraction has 17168 states and 21683 transitions. [2019-12-07 11:02:44,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:02:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 21683 transitions. [2019-12-07 11:02:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-12-07 11:02:44,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:44,315 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:44,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:44,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1209658147, now seen corresponding path program 1 times [2019-12-07 11:02:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543077421] [2019-12-07 11:02:44,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-12-07 11:02:44,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543077421] [2019-12-07 11:02:44,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:44,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:44,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594397536] [2019-12-07 11:02:44,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:44,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:44,943 INFO L87 Difference]: Start difference. First operand 17168 states and 21683 transitions. Second operand 4 states. [2019-12-07 11:02:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:46,957 INFO L93 Difference]: Finished difference Result 35831 states and 45242 transitions. [2019-12-07 11:02:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:46,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 544 [2019-12-07 11:02:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:46,980 INFO L225 Difference]: With dead ends: 35831 [2019-12-07 11:02:46,980 INFO L226 Difference]: Without dead ends: 18665 [2019-12-07 11:02:46,992 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 11:02:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2019-12-07 11:02:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 18660. [2019-12-07 11:02:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18660 states. [2019-12-07 11:02:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18660 states to 18660 states and 22141 transitions. [2019-12-07 11:02:47,152 INFO L78 Accepts]: Start accepts. Automaton has 18660 states and 22141 transitions. Word has length 544 [2019-12-07 11:02:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:47,152 INFO L462 AbstractCegarLoop]: Abstraction has 18660 states and 22141 transitions. [2019-12-07 11:02:47,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18660 states and 22141 transitions. [2019-12-07 11:02:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-12-07 11:02:47,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:47,158 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:47,158 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1450074555, now seen corresponding path program 1 times [2019-12-07 11:02:47,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:47,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870155763] [2019-12-07 11:02:47,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 11:02:47,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870155763] [2019-12-07 11:02:47,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:47,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:47,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632979109] [2019-12-07 11:02:47,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:47,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:47,571 INFO L87 Difference]: Start difference. First operand 18660 states and 22141 transitions. Second operand 5 states. [2019-12-07 11:02:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:50,141 INFO L93 Difference]: Finished difference Result 48975 states and 58135 transitions. [2019-12-07 11:02:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:50,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 578 [2019-12-07 11:02:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:50,164 INFO L225 Difference]: With dead ends: 48975 [2019-12-07 11:02:50,164 INFO L226 Difference]: Without dead ends: 30317 [2019-12-07 11:02:50,179 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 11:02:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30317 states. [2019-12-07 11:02:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30317 to 23140. [2019-12-07 11:02:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23140 states. [2019-12-07 11:02:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23140 states to 23140 states and 27231 transitions. [2019-12-07 11:02:50,375 INFO L78 Accepts]: Start accepts. Automaton has 23140 states and 27231 transitions. Word has length 578 [2019-12-07 11:02:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:50,376 INFO L462 AbstractCegarLoop]: Abstraction has 23140 states and 27231 transitions. [2019-12-07 11:02:50,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23140 states and 27231 transitions. [2019-12-07 11:02:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-12-07 11:02:50,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:50,387 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:50,387 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -932104068, now seen corresponding path program 1 times [2019-12-07 11:02:50,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:50,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431816868] [2019-12-07 11:02:50,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-12-07 11:02:50,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431816868] [2019-12-07 11:02:50,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:50,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:50,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283841964] [2019-12-07 11:02:50,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:50,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:50,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:50,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:50,808 INFO L87 Difference]: Start difference. First operand 23140 states and 27231 transitions. Second operand 3 states. [2019-12-07 11:02:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:52,314 INFO L93 Difference]: Finished difference Result 46275 states and 54481 transitions. [2019-12-07 11:02:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:52,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-12-07 11:02:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:52,330 INFO L225 Difference]: With dead ends: 46275 [2019-12-07 11:02:52,330 INFO L226 Difference]: Without dead ends: 23137 [2019-12-07 11:02:52,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23137 states. [2019-12-07 11:02:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23137 to 22837. [2019-12-07 11:02:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22837 states. [2019-12-07 11:02:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22837 states to 22837 states and 26853 transitions. [2019-12-07 11:02:52,511 INFO L78 Accepts]: Start accepts. Automaton has 22837 states and 26853 transitions. Word has length 702 [2019-12-07 11:02:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:52,512 INFO L462 AbstractCegarLoop]: Abstraction has 22837 states and 26853 transitions. [2019-12-07 11:02:52,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22837 states and 26853 transitions. [2019-12-07 11:02:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-12-07 11:02:52,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:52,524 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:52,524 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash -528418340, now seen corresponding path program 1 times [2019-12-07 11:02:52,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:52,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971971871] [2019-12-07 11:02:52,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 803 proven. 3 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-12-07 11:02:53,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971971871] [2019-12-07 11:02:53,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275706431] [2019-12-07 11:02:53,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:02:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:53,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:02:53,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:53,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:02:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 767 proven. 39 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-12-07 11:02:54,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:02:54,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 11:02:54,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866747728] [2019-12-07 11:02:54,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:02:54,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:54,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:02:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:54,285 INFO L87 Difference]: Start difference. First operand 22837 states and 26853 transitions. Second operand 9 states. [2019-12-07 11:02:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:58,814 INFO L93 Difference]: Finished difference Result 50908 states and 59504 transitions. [2019-12-07 11:02:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:02:58,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 716 [2019-12-07 11:02:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:58,838 INFO L225 Difference]: With dead ends: 50908 [2019-12-07 11:02:58,838 INFO L226 Difference]: Without dead ends: 21339 [2019-12-07 11:02:58,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 714 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 11:02:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21339 states. [2019-12-07 11:02:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21339 to 20442. [2019-12-07 11:02:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20442 states. [2019-12-07 11:02:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20442 states to 20442 states and 21833 transitions. [2019-12-07 11:02:59,007 INFO L78 Accepts]: Start accepts. Automaton has 20442 states and 21833 transitions. Word has length 716 [2019-12-07 11:02:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:59,008 INFO L462 AbstractCegarLoop]: Abstraction has 20442 states and 21833 transitions. [2019-12-07 11:02:59,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:02:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20442 states and 21833 transitions. [2019-12-07 11:02:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-12-07 11:02:59,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:59,016 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:59,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:59,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1420352641, now seen corresponding path program 1 times [2019-12-07 11:02:59,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:59,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516654816] [2019-12-07 11:02:59,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 11:02:59,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516654816] [2019-12-07 11:02:59,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:59,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:59,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450821192] [2019-12-07 11:02:59,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:59,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:59,746 INFO L87 Difference]: Start difference. First operand 20442 states and 21833 transitions. Second operand 4 states. [2019-12-07 11:03:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:01,349 INFO L93 Difference]: Finished difference Result 40581 states and 43328 transitions. [2019-12-07 11:03:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:03:01,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 732 [2019-12-07 11:03:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:01,362 INFO L225 Difference]: With dead ends: 40581 [2019-12-07 11:03:01,362 INFO L226 Difference]: Without dead ends: 20141 [2019-12-07 11:03:01,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20141 states. [2019-12-07 11:03:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20141 to 19837. [2019-12-07 11:03:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19837 states. [2019-12-07 11:03:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 20993 transitions. [2019-12-07 11:03:01,512 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 20993 transitions. Word has length 732 [2019-12-07 11:03:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:01,512 INFO L462 AbstractCegarLoop]: Abstraction has 19837 states and 20993 transitions. [2019-12-07 11:03:01,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 20993 transitions. [2019-12-07 11:03:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-12-07 11:03:01,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:01,521 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:01,521 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -762005697, now seen corresponding path program 1 times [2019-12-07 11:03:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:01,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691305018] [2019-12-07 11:03:01,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 664 proven. 129 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 11:03:02,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691305018] [2019-12-07 11:03:02,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568060268] [2019-12-07 11:03:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:03:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:02,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:03:02,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:02,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:02,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 11:03:02,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:03:02,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-12-07 11:03:02,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169977572] [2019-12-07 11:03:02,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:02,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:02,661 INFO L87 Difference]: Start difference. First operand 19837 states and 20993 transitions. Second operand 3 states. [2019-12-07 11:03:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:03,533 INFO L93 Difference]: Finished difference Result 42974 states and 45555 transitions. [2019-12-07 11:03:03,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:03,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 734 [2019-12-07 11:03:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:03,547 INFO L225 Difference]: With dead ends: 42974 [2019-12-07 11:03:03,548 INFO L226 Difference]: Without dead ends: 23139 [2019-12-07 11:03:03,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 734 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23139 states. [2019-12-07 11:03:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23139 to 22840. [2019-12-07 11:03:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22840 states. [2019-12-07 11:03:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22840 states to 22840 states and 24049 transitions. [2019-12-07 11:03:03,717 INFO L78 Accepts]: Start accepts. Automaton has 22840 states and 24049 transitions. Word has length 734 [2019-12-07 11:03:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:03,718 INFO L462 AbstractCegarLoop]: Abstraction has 22840 states and 24049 transitions. [2019-12-07 11:03:03,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22840 states and 24049 transitions. [2019-12-07 11:03:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-12-07 11:03:03,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:03,727 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:03,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:03,928 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1777625518, now seen corresponding path program 1 times [2019-12-07 11:03:03,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:03,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63891531] [2019-12-07 11:03:03,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 349 proven. 390 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 11:03:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63891531] [2019-12-07 11:03:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786418224] [2019-12-07 11:03:05,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:03:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:05,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:03:05,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:03:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:03:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 667 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 11:03:06,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:03:06,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-12-07 11:03:06,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660698142] [2019-12-07 11:03:06,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:03:06,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:03:06,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:03:06,451 INFO L87 Difference]: Start difference. First operand 22840 states and 24049 transitions. Second operand 18 states. [2019-12-07 11:03:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:31,373 INFO L93 Difference]: Finished difference Result 58609 states and 61718 transitions. [2019-12-07 11:03:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-12-07 11:03:31,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 736 [2019-12-07 11:03:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:31,396 INFO L225 Difference]: With dead ends: 58609 [2019-12-07 11:03:31,396 INFO L226 Difference]: Without dead ends: 35771 [2019-12-07 11:03:31,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 789 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1578, Invalid=6612, Unknown=0, NotChecked=0, Total=8190 [2019-12-07 11:03:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35771 states. [2019-12-07 11:03:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35771 to 26133. [2019-12-07 11:03:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26133 states. [2019-12-07 11:03:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26133 states to 26133 states and 27124 transitions. [2019-12-07 11:03:31,662 INFO L78 Accepts]: Start accepts. Automaton has 26133 states and 27124 transitions. Word has length 736 [2019-12-07 11:03:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:31,662 INFO L462 AbstractCegarLoop]: Abstraction has 26133 states and 27124 transitions. [2019-12-07 11:03:31,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:03:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26133 states and 27124 transitions. [2019-12-07 11:03:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2019-12-07 11:03:31,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:31,671 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:31,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:31,873 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -624469570, now seen corresponding path program 1 times [2019-12-07 11:03:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:31,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210812822] [2019-12-07 11:03:31,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 387 proven. 267 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-12-07 11:03:33,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210812822] [2019-12-07 11:03:33,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700540595] [2019-12-07 11:03:33,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:03:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:33,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:03:33,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:33,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-12-07 11:03:33,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:03:33,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-12-07 11:03:33,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175911587] [2019-12-07 11:03:33,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:33,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:03:33,958 INFO L87 Difference]: Start difference. First operand 26133 states and 27124 transitions. Second operand 3 states. [2019-12-07 11:03:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:35,189 INFO L93 Difference]: Finished difference Result 54367 states and 56412 transitions. [2019-12-07 11:03:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:35,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 742 [2019-12-07 11:03:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:35,210 INFO L225 Difference]: With dead ends: 54367 [2019-12-07 11:03:35,210 INFO L226 Difference]: Without dead ends: 28236 [2019-12-07 11:03:35,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 743 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:03:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28236 states. [2019-12-07 11:03:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28236 to 27329. [2019-12-07 11:03:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27329 states. [2019-12-07 11:03:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27329 states to 27329 states and 28349 transitions. [2019-12-07 11:03:35,445 INFO L78 Accepts]: Start accepts. Automaton has 27329 states and 28349 transitions. Word has length 742 [2019-12-07 11:03:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:35,446 INFO L462 AbstractCegarLoop]: Abstraction has 27329 states and 28349 transitions. [2019-12-07 11:03:35,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27329 states and 28349 transitions. [2019-12-07 11:03:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-12-07 11:03:35,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:35,455 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:35,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:35,656 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1031991404, now seen corresponding path program 1 times [2019-12-07 11:03:35,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:35,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265037290] [2019-12-07 11:03:35,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 11:03:36,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265037290] [2019-12-07 11:03:36,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:36,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:36,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532214356] [2019-12-07 11:03:36,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:36,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:36,186 INFO L87 Difference]: Start difference. First operand 27329 states and 28349 transitions. Second operand 5 states. [2019-12-07 11:03:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:38,177 INFO L93 Difference]: Finished difference Result 35127 states and 36403 transitions. [2019-12-07 11:03:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:38,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 748 [2019-12-07 11:03:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:38,204 INFO L225 Difference]: With dead ends: 35127 [2019-12-07 11:03:38,204 INFO L226 Difference]: Without dead ends: 35125 [2019-12-07 11:03:38,210 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 11:03:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35125 states. [2019-12-07 11:03:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35125 to 28230. [2019-12-07 11:03:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28230 states. [2019-12-07 11:03:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28230 states to 28230 states and 29327 transitions. [2019-12-07 11:03:38,471 INFO L78 Accepts]: Start accepts. Automaton has 28230 states and 29327 transitions. Word has length 748 [2019-12-07 11:03:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:38,472 INFO L462 AbstractCegarLoop]: Abstraction has 28230 states and 29327 transitions. [2019-12-07 11:03:38,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28230 states and 29327 transitions. [2019-12-07 11:03:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2019-12-07 11:03:38,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:38,483 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:38,484 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash -530130051, now seen corresponding path program 1 times [2019-12-07 11:03:38,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209361255] [2019-12-07 11:03:38,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 698 proven. 129 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 11:03:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209361255] [2019-12-07 11:03:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385613791] [2019-12-07 11:03:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:03:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:39,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:03:39,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-12-07 11:03:39,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:03:39,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-12-07 11:03:39,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725162785] [2019-12-07 11:03:39,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:39,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:39,849 INFO L87 Difference]: Start difference. First operand 28230 states and 29327 transitions. Second operand 3 states. [2019-12-07 11:03:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:45,305 INFO L93 Difference]: Finished difference Result 58563 states and 60860 transitions. [2019-12-07 11:03:45,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:45,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 770 [2019-12-07 11:03:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:45,326 INFO L225 Difference]: With dead ends: 58563 [2019-12-07 11:03:45,326 INFO L226 Difference]: Without dead ends: 30335 [2019-12-07 11:03:45,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30335 states. [2019-12-07 11:03:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30335 to 27029. [2019-12-07 11:03:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27029 states. [2019-12-07 11:03:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27029 states to 27029 states and 28023 transitions. [2019-12-07 11:03:45,571 INFO L78 Accepts]: Start accepts. Automaton has 27029 states and 28023 transitions. Word has length 770 [2019-12-07 11:03:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:45,572 INFO L462 AbstractCegarLoop]: Abstraction has 27029 states and 28023 transitions. [2019-12-07 11:03:45,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27029 states and 28023 transitions. [2019-12-07 11:03:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-12-07 11:03:45,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:45,581 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:45,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:45,781 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:45,782 INFO L82 PathProgramCache]: Analyzing trace with hash 875199434, now seen corresponding path program 1 times [2019-12-07 11:03:45,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:45,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618461034] [2019-12-07 11:03:45,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-12-07 11:03:46,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618461034] [2019-12-07 11:03:46,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:46,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:46,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183842900] [2019-12-07 11:03:46,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:46,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:46,286 INFO L87 Difference]: Start difference. First operand 27029 states and 28023 transitions. Second operand 5 states. [2019-12-07 11:03:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:47,765 INFO L93 Difference]: Finished difference Result 45323 states and 47001 transitions. [2019-12-07 11:03:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:47,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 808 [2019-12-07 11:03:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:47,777 INFO L225 Difference]: With dead ends: 45323 [2019-12-07 11:03:47,777 INFO L226 Difference]: Without dead ends: 18296 [2019-12-07 11:03:47,786 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 11:03:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18296 states. [2019-12-07 11:03:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18296 to 16196. [2019-12-07 11:03:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16196 states. [2019-12-07 11:03:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16196 states to 16196 states and 16612 transitions. [2019-12-07 11:03:47,923 INFO L78 Accepts]: Start accepts. Automaton has 16196 states and 16612 transitions. Word has length 808 [2019-12-07 11:03:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:47,924 INFO L462 AbstractCegarLoop]: Abstraction has 16196 states and 16612 transitions. [2019-12-07 11:03:47,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16196 states and 16612 transitions. [2019-12-07 11:03:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2019-12-07 11:03:47,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:47,933 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:47,933 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash 279751055, now seen corresponding path program 1 times [2019-12-07 11:03:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:47,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120297546] [2019-12-07 11:03:47,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-12-07 11:03:48,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120297546] [2019-12-07 11:03:48,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:48,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:48,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800820337] [2019-12-07 11:03:48,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:03:48,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:03:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:48,609 INFO L87 Difference]: Start difference. First operand 16196 states and 16612 transitions. Second operand 4 states. [2019-12-07 11:03:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:49,893 INFO L93 Difference]: Finished difference Result 35092 states and 36030 transitions. [2019-12-07 11:03:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:03:49,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 960 [2019-12-07 11:03:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:49,904 INFO L225 Difference]: With dead ends: 35092 [2019-12-07 11:03:49,904 INFO L226 Difference]: Without dead ends: 19197 [2019-12-07 11:03:49,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19197 states. [2019-12-07 11:03:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19197 to 16495. [2019-12-07 11:03:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16495 states. [2019-12-07 11:03:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 16923 transitions. [2019-12-07 11:03:50,046 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 16923 transitions. Word has length 960 [2019-12-07 11:03:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:50,047 INFO L462 AbstractCegarLoop]: Abstraction has 16495 states and 16923 transitions. [2019-12-07 11:03:50,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 16923 transitions. [2019-12-07 11:03:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2019-12-07 11:03:50,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:50,057 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:50,057 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 736286035, now seen corresponding path program 1 times [2019-12-07 11:03:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235405453] [2019-12-07 11:03:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-12-07 11:03:50,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235405453] [2019-12-07 11:03:50,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:50,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:50,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454440919] [2019-12-07 11:03:50,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:50,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:50,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:50,865 INFO L87 Difference]: Start difference. First operand 16495 states and 16923 transitions. Second operand 3 states. [2019-12-07 11:03:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:51,508 INFO L93 Difference]: Finished difference Result 32689 states and 33543 transitions. [2019-12-07 11:03:51,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:51,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 969 [2019-12-07 11:03:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:51,519 INFO L225 Difference]: With dead ends: 32689 [2019-12-07 11:03:51,519 INFO L226 Difference]: Without dead ends: 16495 [2019-12-07 11:03:51,525 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 11:03:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16495 states. [2019-12-07 11:03:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16495 to 15897. [2019-12-07 11:03:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15897 states. [2019-12-07 11:03:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15897 states to 15897 states and 16311 transitions. [2019-12-07 11:03:51,646 INFO L78 Accepts]: Start accepts. Automaton has 15897 states and 16311 transitions. Word has length 969 [2019-12-07 11:03:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:51,646 INFO L462 AbstractCegarLoop]: Abstraction has 15897 states and 16311 transitions. [2019-12-07 11:03:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15897 states and 16311 transitions. [2019-12-07 11:03:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-12-07 11:03:51,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:51,656 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:51,656 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash -486561977, now seen corresponding path program 1 times [2019-12-07 11:03:51,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:51,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339868762] [2019-12-07 11:03:51,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-12-07 11:03:52,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339868762] [2019-12-07 11:03:52,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:52,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:52,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599171158] [2019-12-07 11:03:52,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:52,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:52,465 INFO L87 Difference]: Start difference. First operand 15897 states and 16311 transitions. Second operand 5 states. [2019-12-07 11:03:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:53,994 INFO L93 Difference]: Finished difference Result 22495 states and 23084 transitions. [2019-12-07 11:03:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:53,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 983 [2019-12-07 11:03:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:54,007 INFO L225 Difference]: With dead ends: 22495 [2019-12-07 11:03:54,007 INFO L226 Difference]: Without dead ends: 22493 [2019-12-07 11:03:54,009 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 11:03:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22493 states. [2019-12-07 11:03:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22493 to 16200. [2019-12-07 11:03:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-12-07 11:03:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 16639 transitions. [2019-12-07 11:03:54,148 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 16639 transitions. Word has length 983 [2019-12-07 11:03:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:54,149 INFO L462 AbstractCegarLoop]: Abstraction has 16200 states and 16639 transitions. [2019-12-07 11:03:54,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 16639 transitions. [2019-12-07 11:03:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2019-12-07 11:03:54,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:54,159 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:54,159 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -589632185, now seen corresponding path program 1 times [2019-12-07 11:03:54,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:54,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259130944] [2019-12-07 11:03:54,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-12-07 11:03:54,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259130944] [2019-12-07 11:03:54,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:54,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:54,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086278119] [2019-12-07 11:03:54,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:54,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:54,741 INFO L87 Difference]: Start difference. First operand 16200 states and 16639 transitions. Second operand 3 states. [2019-12-07 11:03:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:55,438 INFO L93 Difference]: Finished difference Result 32696 states and 33586 transitions. [2019-12-07 11:03:55,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:55,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 995 [2019-12-07 11:03:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:55,450 INFO L225 Difference]: With dead ends: 32696 [2019-12-07 11:03:55,450 INFO L226 Difference]: Without dead ends: 16797 [2019-12-07 11:03:55,456 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 11:03:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16797 states. [2019-12-07 11:03:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16797 to 16199. [2019-12-07 11:03:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16199 states. [2019-12-07 11:03:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16199 states to 16199 states and 16637 transitions. [2019-12-07 11:03:55,588 INFO L78 Accepts]: Start accepts. Automaton has 16199 states and 16637 transitions. Word has length 995 [2019-12-07 11:03:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 16199 states and 16637 transitions. [2019-12-07 11:03:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16199 states and 16637 transitions. [2019-12-07 11:03:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2019-12-07 11:03:55,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:55,607 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:55,607 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1310312419, now seen corresponding path program 1 times [2019-12-07 11:03:55,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:55,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858313704] [2019-12-07 11:03:55,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-12-07 11:03:57,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858313704] [2019-12-07 11:03:57,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001821130] [2019-12-07 11:03:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:03:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:57,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:03:57,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:58,722 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 99 DAG size of output: 27 [2019-12-07 11:04:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 35 proven. 746 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-12-07 11:04:01,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:04:01,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 11:04:01,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566006491] [2019-12-07 11:04:01,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:04:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:04:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:04:01,117 INFO L87 Difference]: Start difference. First operand 16199 states and 16637 transitions. Second operand 8 states. [2019-12-07 11:04:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:04,669 INFO L93 Difference]: Finished difference Result 25787 states and 26437 transitions. [2019-12-07 11:04:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:04:04,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1033 [2019-12-07 11:04:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:04,685 INFO L225 Difference]: With dead ends: 25787 [2019-12-07 11:04:04,685 INFO L226 Difference]: Without dead ends: 25785 [2019-12-07 11:04:04,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:04:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25785 states. [2019-12-07 11:04:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25785 to 18294. [2019-12-07 11:04:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18294 states. [2019-12-07 11:04:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18294 states to 18294 states and 18771 transitions. [2019-12-07 11:04:04,862 INFO L78 Accepts]: Start accepts. Automaton has 18294 states and 18771 transitions. Word has length 1033 [2019-12-07 11:04:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:04,862 INFO L462 AbstractCegarLoop]: Abstraction has 18294 states and 18771 transitions. [2019-12-07 11:04:04,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:04:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18294 states and 18771 transitions. [2019-12-07 11:04:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2019-12-07 11:04:04,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:04,876 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:05,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:05,077 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1356355674, now seen corresponding path program 1 times [2019-12-07 11:04:05,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:05,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559306931] [2019-12-07 11:04:05,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 90 proven. 922 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-12-07 11:04:06,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559306931] [2019-12-07 11:04:06,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932415254] [2019-12-07 11:04:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/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 11:04:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:06,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:04:06,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:04:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-12-07 11:04:07,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:04:07,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 11:04:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516408710] [2019-12-07 11:04:07,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:04:07,399 INFO L87 Difference]: Start difference. First operand 18294 states and 18771 transitions. Second operand 3 states. [2019-12-07 11:04:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:08,193 INFO L93 Difference]: Finished difference Result 35986 states and 36933 transitions. [2019-12-07 11:04:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:08,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1079 [2019-12-07 11:04:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:08,205 INFO L225 Difference]: With dead ends: 35986 [2019-12-07 11:04:08,205 INFO L226 Difference]: Without dead ends: 18292 [2019-12-07 11:04:08,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1078 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:04:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2019-12-07 11:04:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 16492. [2019-12-07 11:04:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-12-07 11:04:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 16781 transitions. [2019-12-07 11:04:08,348 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 16781 transitions. Word has length 1079 [2019-12-07 11:04:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:08,349 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 16781 transitions. [2019-12-07 11:04:08,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 16781 transitions. [2019-12-07 11:04:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1279 [2019-12-07 11:04:08,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:08,363 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:08,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:08,564 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2086685658, now seen corresponding path program 1 times [2019-12-07 11:04:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:08,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697674732] [2019-12-07 11:04:08,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 2280 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-12-07 11:04:10,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697674732] [2019-12-07 11:04:10,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:10,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:04:10,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092060561] [2019-12-07 11:04:10,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:04:10,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:04:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:04:10,243 INFO L87 Difference]: Start difference. First operand 16492 states and 16781 transitions. Second operand 5 states. [2019-12-07 11:04:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:11,885 INFO L93 Difference]: Finished difference Result 31803 states and 32366 transitions. [2019-12-07 11:04:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:04:11,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1278 [2019-12-07 11:04:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:11,898 INFO L225 Difference]: With dead ends: 31803 [2019-12-07 11:04:11,898 INFO L226 Difference]: Without dead ends: 17107 [2019-12-07 11:04:11,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:04:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-12-07 11:04:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 16492. [2019-12-07 11:04:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-12-07 11:04:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 16777 transitions. [2019-12-07 11:04:12,040 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 16777 transitions. Word has length 1278 [2019-12-07 11:04:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:12,041 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 16777 transitions. [2019-12-07 11:04:12,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:04:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 16777 transitions. [2019-12-07 11:04:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1449 [2019-12-07 11:04:12,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:12,059 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:12,059 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash 535903618, now seen corresponding path program 1 times [2019-12-07 11:04:12,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:12,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56592796] [2019-12-07 11:04:12,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 3161 proven. 132 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2019-12-07 11:04:14,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56592796] [2019-12-07 11:04:14,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145189950] [2019-12-07 11:04:14,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:14,255 INFO L264 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:04:14,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:04:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:16,423 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_829 Int)) (let ((.cse0 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse1 (div .cse0 5))) (and (<= 0 .cse0) (<= (div (+ (* .cse1 10) 3459790) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse1) 3459790)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse2 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse3 (div .cse2 5))) (and (= 0 (mod .cse2 5)) (<= (div (+ (* .cse3 10) 3459790) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse3) 3459790)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse5 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (<= (div (+ (* .cse4 10) 3459800) (- 9)) c_~a0~0) (not (= 0 (mod .cse5 5))) (< .cse5 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (= (mod (+ .cse4 2) (- 9)) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse6 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse7 (div .cse6 5))) (and (= 0 (mod .cse6 5)) (= 0 (mod (+ .cse7 1) (- 9))) (<= (div (+ (* .cse7 10) 3459790) (- 9)) c_~a0~0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse9 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (not (= 0 (mod (+ .cse8 1) (- 9)))) (= 0 (mod .cse9 5)) (< (+ (* 10 .cse8) 3459790) 0) (<= (div (+ (* .cse8 10) 3459790) (- 9)) (+ c_~a0~0 1)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse11 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< (+ (* 10 .cse10) 3459800) 0) (not (= 0 (mod .cse11 5))) (< .cse11 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (not (= (mod (+ .cse10 2) (- 9)) 0)) (< 0 (+ v_~a0~0_829 147)) (<= (div (+ (* .cse10 10) 3459800) (- 9)) (+ c_~a0~0 1)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse13 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (not (= 0 (mod (+ .cse12 1) (- 9)))) (<= 0 .cse13) (< (+ (* 10 .cse12) 3459790) 0) (<= (div (+ (* .cse12 10) 3459790) (- 9)) (+ c_~a0~0 1)) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse14 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse15 (div .cse14 5))) (and (<= 0 .cse14) (= 0 (mod (+ .cse15 1) (- 9))) (<= (div (+ (* .cse15 10) 3459790) (- 9)) c_~a0~0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147)))))) (exists ((v_~a0~0_829 Int)) (let ((.cse17 (div (* v_~a0~0_829 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (div (+ (* .cse16 10) 3459800) (- 9)) c_~a0~0) (<= 0 (+ (* 10 .cse16) 3459800)) (not (= 0 (mod .cse17 5))) (< .cse17 0) (<= (* 250 v_~a0~0_829) 0) (<= (+ v_~a0~0_829 98) 0) (< 0 (+ v_~a0~0_829 147))))))) is different from false [2019-12-07 11:04:17,317 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 32 [2019-12-07 11:04:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2437 proven. 558 refuted. 0 times theorem prover too weak. 1214 trivial. 4 not checked. [2019-12-07 11:04:23,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:04:23,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 11:04:23,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350244615] [2019-12-07 11:04:23,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:04:23,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:04:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2019-12-07 11:04:23,831 INFO L87 Difference]: Start difference. First operand 16492 states and 16777 transitions. Second operand 10 states. [2019-12-07 11:04:26,996 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 11:04:30,207 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-07 11:05:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:07,271 INFO L93 Difference]: Finished difference Result 37793 states and 38468 transitions. [2019-12-07 11:05:07,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:05:07,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1448 [2019-12-07 11:05:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:07,274 INFO L225 Difference]: With dead ends: 37793 [2019-12-07 11:05:07,274 INFO L226 Difference]: Without dead ends: 4199 [2019-12-07 11:05:07,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1485 GetRequests, 1459 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=161, Invalid=492, Unknown=1, NotChecked=48, Total=702 [2019-12-07 11:05:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2019-12-07 11:05:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3293. [2019-12-07 11:05:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-12-07 11:05:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3310 transitions. [2019-12-07 11:05:07,305 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3310 transitions. Word has length 1448 [2019-12-07 11:05:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:07,305 INFO L462 AbstractCegarLoop]: Abstraction has 3293 states and 3310 transitions. [2019-12-07 11:05:07,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:05:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3310 transitions. [2019-12-07 11:05:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2019-12-07 11:05:07,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:07,318 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:07,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:07,519 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1882290462, now seen corresponding path program 1 times [2019-12-07 11:05:07,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:07,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056054840] [2019-12-07 11:05:07,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5374 backedges. 3666 proven. 0 refuted. 0 times theorem prover too weak. 1708 trivial. 0 not checked. [2019-12-07 11:05:09,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056054840] [2019-12-07 11:05:09,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:09,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:05:09,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530882128] [2019-12-07 11:05:09,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:05:09,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:05:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:05:09,427 INFO L87 Difference]: Start difference. First operand 3293 states and 3310 transitions. Second operand 3 states. [2019-12-07 11:05:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:09,904 INFO L93 Difference]: Finished difference Result 5687 states and 5715 transitions. [2019-12-07 11:05:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:05:09,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1695 [2019-12-07 11:05:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:09,907 INFO L225 Difference]: With dead ends: 5687 [2019-12-07 11:05:09,907 INFO L226 Difference]: Without dead ends: 3293 [2019-12-07 11:05:09,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:05:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-12-07 11:05:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2019-12-07 11:05:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-12-07 11:05:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3308 transitions. [2019-12-07 11:05:09,929 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3308 transitions. Word has length 1695 [2019-12-07 11:05:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:09,930 INFO L462 AbstractCegarLoop]: Abstraction has 3293 states and 3308 transitions. [2019-12-07 11:05:09,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:05:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3308 transitions. [2019-12-07 11:05:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2019-12-07 11:05:09,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:09,944 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:09,944 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2019664079, now seen corresponding path program 1 times [2019-12-07 11:05:09,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:09,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508506875] [2019-12-07 11:05:09,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 792 proven. 3600 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-12-07 11:05:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508506875] [2019-12-07 11:05:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538915936] [2019-12-07 11:05:13,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:13,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:05:13,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:05:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:14,664 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 23 [2019-12-07 11:05:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-12-07 11:05:18,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:05:18,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-12-07 11:05:18,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155795653] [2019-12-07 11:05:18,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:05:18,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:05:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:05:18,029 INFO L87 Difference]: Start difference. First operand 3293 states and 3308 transitions. Second operand 11 states. [2019-12-07 11:05:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:21,077 INFO L93 Difference]: Finished difference Result 6283 states and 6313 transitions. [2019-12-07 11:05:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:05:21,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1791 [2019-12-07 11:05:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:21,079 INFO L225 Difference]: With dead ends: 6283 [2019-12-07 11:05:21,079 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:05:21,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1811 GetRequests, 1795 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:05:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:05:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:05:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:05:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:05:21,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1791 [2019-12-07 11:05:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:21,082 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:05:21,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:05:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:05:21,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:05:21,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:21,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:05:23,074 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 979 DAG size of output: 878 [2019-12-07 11:05:24,762 WARN L192 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 979 DAG size of output: 878 [2019-12-07 11:05:25,857 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 825 DAG size of output: 762 [2019-12-07 11:05:48,573 WARN L192 SmtUtils]: Spent 22.71 s on a formula simplification. DAG size of input: 840 DAG size of output: 236 [2019-12-07 11:06:09,067 WARN L192 SmtUtils]: Spent 20.49 s on a formula simplification. DAG size of input: 840 DAG size of output: 236 [2019-12-07 11:06:26,705 WARN L192 SmtUtils]: Spent 17.63 s on a formula simplification. DAG size of input: 740 DAG size of output: 228 [2019-12-07 11:06:26,708 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,708 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,708 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,708 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,708 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,709 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 11:06:26,710 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 11:06:26,711 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,712 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,713 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,714 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,715 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,716 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 11:06:26,717 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,718 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,719 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse42 (+ ~a4~0 86))) (let ((.cse7 (<= .cse42 0)) (.cse27 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse41 (+ ~a4~0 42)) (.cse31 (+ ~a0~0 98)) (.cse9 (= 3 ~a2~0)) (.cse40 (+ ~a0~0 147)) (.cse11 (= 4 ~a2~0)) (.cse17 (= 1 ~a2~0)) (.cse22 (+ ~a29~0 127)) (.cse21 (+ ~a0~0 44)) (.cse43 (+ ~a29~0 16))) (let ((.cse1 (< 0 .cse43)) (.cse23 (<= .cse21 0)) (.cse19 (<= 0 (+ ~a29~0 192415))) (.cse10 (<= .cse22 0)) (.cse20 (<= (+ ~a4~0 89) 0)) (.cse24 (<= 5 ~a2~0)) (.cse34 (not .cse17)) (.cse35 (not .cse11)) (.cse2 (<= .cse40 0)) (.cse3 (= 2 ~a2~0)) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse26 (<= .cse43 0)) (.cse16 (not .cse9)) (.cse4 (<= .cse31 0)) (.cse13 (< 0 .cse42)) (.cse18 (<= 0 (+ ~a0~0 146))) (.cse14 (<= (+ ~a0~0 366640) 0)) (.cse0 (<= ~a29~0 41)) (.cse6 (<= ~a0~0 599970)) (.cse8 (< 0 (+ ~a29~0 144))) (.cse36 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse5 (<= .cse41 0)) (.cse37 (or .cse7 (< 0 .cse40) (< 0 .cse41) .cse27)) (.cse30 (exists ((v_~a29~0_898 Int)) (let ((.cse39 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse39)) (<= (+ .cse39 43) ~a29~0))))) (.cse12 (<= 0 (+ ~a0~0 366694))) (.cse25 (<= (+ ~a0~0 104) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse3) (and .cse6 .cse7 .cse0 .cse8 .cse9) (and .cse5 .cse2 .cse10 .cse11 .cse12) (and .cse5 .cse13 .cse2 (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) .cse9) (and .cse14 .cse8 .cse3) (and .cse7 .cse15 .cse16) (and .cse4 .cse5 .cse17 .cse18 .cse19) (and .cse7 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse1 .cse8 .cse3 .cse16) (and .cse20 .cse17 (<= 0 .cse21) .cse10 (<= 0 .cse22) .cse23) (and .cse0 .cse5 .cse13 .cse17 .cse8 .cse23) (and .cse5 .cse2 .cse3 .cse12) (and .cse24 .cse4 .cse0 .cse5 .cse8) (and .cse24 .cse5 .cse18 .cse25 .cse10 .cse19) (and (<= 300109 ~a0~0) .cse7 .cse10 .cse11 .cse16) (and .cse24 .cse5 .cse2 .cse8) (and .cse6 .cse7 .cse26 .cse3 .cse16) (and .cse20 (<= (+ ~a29~0 145) 0) .cse27 (exists ((v_~a0~0_833 Int)) (let ((.cse29 (div v_~a0~0_833 5))) (let ((.cse28 (* 10 .cse29))) (and (<= 0 (+ .cse28 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse28 3459790)) (<= (+ (div (+ (* .cse29 10) 3459790) (- 9)) 600067) ~a0~0))))) .cse9) (and .cse2 .cse30 .cse3) (and .cse20 (or .cse2 (< 0 .cse31)) .cse15) (and .cse14 .cse5 (exists ((v_~a0~0_833 Int)) (let ((.cse33 (div v_~a0~0_833 5))) (let ((.cse32 (* 10 .cse33))) (and (<= 0 (+ .cse32 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse33 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse32 3459790)))))) .cse8 .cse9) (and .cse6 .cse7 .cse24 .cse34 .cse30 .cse8 .cse35 .cse16) (and .cse24 .cse4 .cse5 .cse36) (and .cse7 .cse24 .cse0 .cse34 .cse8 .cse35 .cse16) (and .cse5 .cse17 .cse2 .cse30 .cse12) (and (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse5 .cse2 .cse9 .cse12) (and .cse4 .cse5 .cse30 .cse3) (and .cse7 .cse8 .cse9 .cse15) (and .cse5 .cse13 .cse17 .cse26 .cse8) (and .cse7 (<= ~a29~0 42) .cse8 .cse11 .cse16) (and .cse4 .cse5 .cse13 .cse18 .cse9) (and .cse5 .cse37 (exists ((v_~a29~0_895 Int)) (let ((.cse38 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse38) (<= (+ .cse38 300022) ~a29~0)))) .cse25 .cse11) (and .cse14 .cse0 .cse5 .cse11 .cse12) (and .cse6 .cse7 .cse8 .cse30 .cse9) (and (or (and .cse5 .cse37 .cse36 .cse11) (and .cse5 .cse37 .cse30 .cse11 .cse12)) .cse25 (<= 0 (+ ~a0~0 459337))))))) [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 11:06:26,720 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,721 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse42 (+ ~a4~0 86)) (.cse14 (= 3 ~a2~0)) (.cse39 (+ ~a29~0 127))) (let ((.cse16 (= 4 ~a2~0)) (.cse9 (+ ~a0~0 147)) (.cse31 (+ ~a0~0 98)) (.cse38 (+ ~a0~0 44)) (.cse15 (<= .cse39 0)) (.cse20 (not .cse14)) (.cse12 (<= .cse42 0)) (.cse0 (= 1 ~a2~0)) (.cse41 (+ ~a29~0 144)) (.cse43 (+ ~a29~0 16))) (let ((.cse4 (< 0 .cse43)) (.cse10 (<= 0 (+ ~a29~0 192415))) (.cse27 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse1 (<= .cse41 0)) (.cse25 (<= (+ ~a0~0 104) 0)) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse2 (or (and .cse12 (<= ~a2~0 2) .cse15 .cse20) (and .cse12 .cse0))) (.cse6 (= 2 ~a2~0)) (.cse28 (<= (+ ~a4~0 89) 0)) (.cse22 (<= .cse38 0)) (.cse37 (<= .cse43 0)) (.cse7 (<= .cse31 0)) (.cse21 (< 0 .cse42)) (.cse24 (<= 0 (+ ~a0~0 146))) (.cse5 (<= .cse9 0)) (.cse18 (<= (+ ~a0~0 366640) 0)) (.cse3 (<= ~a29~0 41)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse17 (<= 0 (+ ~a0~0 366694))) (.cse11 (<= ~a0~0 599970)) (.cse23 (<= 5 ~a2~0)) (.cse35 (not .cse0)) (.cse13 (< 0 .cse41)) (.cse26 (exists ((v_~a29~0_898 Int)) (let ((.cse40 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse40)) (<= (+ .cse40 43) ~a29~0))))) (.cse36 (not .cse16))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse8 .cse0 (< 0 .cse9) .cse10) (and .cse11 .cse12 .cse3 .cse13 .cse14) (and .cse8 .cse5 .cse15 .cse16 .cse17) (and .cse18 .cse13 .cse6) (and .cse12 .cse19 .cse20) (and .cse12 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse4 .cse13 .cse6 .cse20) (and .cse3 .cse8 .cse21 .cse0 .cse13 .cse22) (and .cse8 .cse5 .cse6 .cse17) (and .cse23 .cse8 .cse24 .cse25 .cse15 .cse10) (and (<= 300109 ~a0~0) .cse12 .cse15 .cse16 .cse20) (and .cse23 .cse8 .cse5 .cse13) (and .cse5 .cse26 .cse6) (and (or (and .cse8 .cse27 .cse16) (and .cse8 .cse26 .cse16 .cse17)) .cse25 (<= 0 (+ ~a0~0 459337))) (and .cse28 (<= (+ ~a29~0 145) 0) (exists ((v_~a0~0_833 Int)) (let ((.cse30 (div v_~a0~0_833 5))) (let ((.cse29 (* 10 .cse30))) (and (<= 0 (+ .cse29 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse29 3459790)) (<= (+ (div (+ (* .cse30 10) 3459790) (- 9)) 600067) ~a0~0))))) .cse14) (and .cse8 .cse7 .cse26 .cse6) (and .cse23 .cse8 .cse7 .cse3 .cse13) (and .cse28 (or .cse5 (< 0 .cse31)) .cse19) (and .cse18 .cse8 (exists ((v_~a0~0_833 Int)) (let ((.cse33 (div v_~a0~0_833 5))) (let ((.cse32 (* 10 .cse33))) (and (<= 0 (+ .cse32 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse33 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse32 3459790)))))) .cse13 .cse14) (and .cse8 (exists ((v_~a29~0_895 Int)) (let ((.cse34 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse34) (<= (+ .cse34 300022) ~a29~0)))) .cse25 .cse16) (and .cse23 .cse7 .cse8 .cse27) (and .cse8 .cse21 .cse25 .cse1 .cse14) (and .cse12 .cse23 .cse3 .cse35 .cse13 .cse36 .cse20) (and .cse8 .cse0 .cse5 .cse26 .cse17) (and .cse8 .cse25 .cse13 (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) .cse14) (and .cse12 .cse13 .cse14 .cse19) (and .cse11 (or (and .cse6 .cse2) (and .cse12 .cse13 .cse6 .cse20)) .cse37) (and .cse12 .cse28 .cse0 (<= 0 .cse38) .cse15 (<= 0 .cse39) .cse22) (and .cse8 .cse21 .cse0 .cse37 .cse13) (and .cse12 (<= ~a29~0 42) .cse13 .cse16 .cse20) (and .cse7 .cse8 .cse21 .cse24 .cse14) (and .cse11 .cse12 .cse13 .cse26 .cse14) (and .cse8 (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse5 .cse14 .cse17) (and .cse18 .cse3 .cse8 .cse16 .cse17) (and .cse11 .cse12 .cse23 .cse35 .cse13 .cse26 .cse36 .cse20))))) [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,722 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 11:06:26,723 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,724 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 11:06:26,725 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse42 (+ ~a4~0 86)) (.cse14 (= 3 ~a2~0)) (.cse39 (+ ~a29~0 127))) (let ((.cse16 (= 4 ~a2~0)) (.cse9 (+ ~a0~0 147)) (.cse31 (+ ~a0~0 98)) (.cse38 (+ ~a0~0 44)) (.cse15 (<= .cse39 0)) (.cse20 (not .cse14)) (.cse12 (<= .cse42 0)) (.cse0 (= 1 ~a2~0)) (.cse41 (+ ~a29~0 144)) (.cse43 (+ ~a29~0 16))) (let ((.cse4 (< 0 .cse43)) (.cse10 (<= 0 (+ ~a29~0 192415))) (.cse27 (<= 96102 (+ ~a4~0 ~a29~0))) (.cse1 (<= .cse41 0)) (.cse25 (<= (+ ~a0~0 104) 0)) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse2 (or (and .cse12 (<= ~a2~0 2) .cse15 .cse20) (and .cse12 .cse0))) (.cse6 (= 2 ~a2~0)) (.cse28 (<= (+ ~a4~0 89) 0)) (.cse22 (<= .cse38 0)) (.cse37 (<= .cse43 0)) (.cse7 (<= .cse31 0)) (.cse21 (< 0 .cse42)) (.cse24 (<= 0 (+ ~a0~0 146))) (.cse5 (<= .cse9 0)) (.cse18 (<= (+ ~a0~0 366640) 0)) (.cse3 (<= ~a29~0 41)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse17 (<= 0 (+ ~a0~0 366694))) (.cse11 (<= ~a0~0 599970)) (.cse23 (<= 5 ~a2~0)) (.cse35 (not .cse0)) (.cse13 (< 0 .cse41)) (.cse26 (exists ((v_~a29~0_898 Int)) (let ((.cse40 (mod v_~a29~0_898 299978))) (and (< v_~a29~0_898 0) (not (= 0 .cse40)) (<= (+ .cse40 43) ~a29~0))))) (.cse36 (not .cse16))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse8 .cse0 (< 0 .cse9) .cse10) (and .cse11 .cse12 .cse3 .cse13 .cse14) (and .cse8 .cse5 .cse15 .cse16 .cse17) (and .cse18 .cse13 .cse6) (and .cse12 .cse19 .cse20) (and .cse12 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse4 .cse13 .cse6 .cse20) (and .cse3 .cse8 .cse21 .cse0 .cse13 .cse22) (and .cse8 .cse5 .cse6 .cse17) (and .cse23 .cse8 .cse24 .cse25 .cse15 .cse10) (and (<= 300109 ~a0~0) .cse12 .cse15 .cse16 .cse20) (and .cse23 .cse8 .cse5 .cse13) (and .cse5 .cse26 .cse6) (and (or (and .cse8 .cse27 .cse16) (and .cse8 .cse26 .cse16 .cse17)) .cse25 (<= 0 (+ ~a0~0 459337))) (and .cse28 (<= (+ ~a29~0 145) 0) (exists ((v_~a0~0_833 Int)) (let ((.cse30 (div v_~a0~0_833 5))) (let ((.cse29 (* 10 .cse30))) (and (<= 0 (+ .cse29 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= 0 (+ .cse29 3459790)) (<= (+ (div (+ (* .cse30 10) 3459790) (- 9)) 600067) ~a0~0))))) .cse14) (and .cse8 .cse7 .cse26 .cse6) (and .cse23 .cse8 .cse7 .cse3 .cse13) (and .cse28 (or .cse5 (< 0 .cse31)) .cse19) (and .cse18 .cse8 (exists ((v_~a0~0_833 Int)) (let ((.cse33 (div v_~a0~0_833 5))) (let ((.cse32 (* 10 .cse33))) (and (<= 0 (+ .cse32 3459800)) (<= 0 v_~a0~0_833) (<= v_~a0~0_833 599970) (<= (div (+ (* .cse33 10) 3459790) (- 9)) ~a0~0) (<= 0 (+ .cse32 3459790)))))) .cse13 .cse14) (and .cse8 (exists ((v_~a29~0_895 Int)) (let ((.cse34 (mod v_~a29~0_895 299978))) (and (< 43 v_~a29~0_895) (= 0 .cse34) (<= (+ .cse34 300022) ~a29~0)))) .cse25 .cse16) (and .cse23 .cse7 .cse8 .cse27) (and .cse8 .cse21 .cse25 .cse1 .cse14) (and .cse12 .cse23 .cse3 .cse35 .cse13 .cse36 .cse20) (and .cse8 .cse0 .cse5 .cse26 .cse17) (and .cse8 .cse25 .cse13 (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 371124)) (<= ~a29~0 (+ (mod (+ v_prenex_2 11) 29) 15)))) .cse14) (and .cse12 .cse13 .cse14 .cse19) (and .cse11 (or (and .cse6 .cse2) (and .cse12 .cse13 .cse6 .cse20)) .cse37) (and .cse12 .cse28 .cse0 (<= 0 .cse38) .cse15 (<= 0 .cse39) .cse22) (and .cse8 .cse21 .cse0 .cse37 .cse13) (and .cse12 (<= ~a29~0 42) .cse13 .cse16 .cse20) (and .cse7 .cse8 .cse21 .cse24 .cse14) (and .cse11 .cse12 .cse13 .cse26 .cse14) (and .cse8 (exists ((v_~a29~0_893 Int)) (and (< 0 (+ v_~a29~0_893 16)) (<= (+ (div v_~a29~0_893 5) 134659) ~a29~0) (= (mod v_~a29~0_893 5) 0) (<= v_~a29~0_893 43))) .cse5 .cse14 .cse17) (and .cse18 .cse3 .cse8 .cse16 .cse17) (and .cse11 .cse12 .cse23 .cse35 .cse13 .cse26 .cse36 .cse20))))) [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 11:06:26,726 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 11:06:26,727 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,728 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 11:06:26,729 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,730 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 11:06:26,731 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 11:06:26,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:06:26 BoogieIcfgContainer [2019-12-07 11:06:26,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:06:26,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:06:26,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:06:26,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:06:26,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:12" (3/4) ... [2019-12-07 11:06:26,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:06:26,823 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:06:26,826 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:06:26,847 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((1 == a2 && a29 + 144 <= 0) && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 192415)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((5 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a29 <= 41) && 0 < a29 + 144)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 104 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && 0 < a29 + 144) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((2 == a2 && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 2 == a2) && !(3 == a2)))) && a29 + 16 <= 0)) || ((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && !(4 == a2)) && !(3 == a2)) [2019-12-07 11:06:26,849 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((1 == a2 && a29 + 144 <= 0) && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 192415)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((5 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a29 <= 41) && 0 < a29 + 144)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 104 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && 0 < a29 + 144) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((2 == a2 && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 2 == a2) && !(3 == a2)))) && a29 + 16 <= 0)) || ((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && !(4 == a2)) && !(3 == a2)) [2019-12-07 11:06:26,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || ((((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 144)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(3 == a2))) || ((((a4 + 89 <= 0 && a29 + 145 <= 0) && !(1 == input)) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || (((((\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && 96102 <= a4 + a29) && 4 == a2) || ((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337) [2019-12-07 11:06:26,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0746784b-60d6-4667-bc0e-7beae0d33819/bin/uautomizer/witness.graphml [2019-12-07 11:06:26,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:06:26,947 INFO L168 Benchmark]: Toolchain (without parser) took 258158.10 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 932.7 MB in the beginning and 1.2 GB in the end (delta: -305.6 MB). Peak memory consumption was 778.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,947 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 932.7 MB in the beginning and 998.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.92 ms. Allocated memory is still 1.1 GB. Free memory was 998.8 MB in the beginning and 961.2 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: Boogie Preprocessor took 130.59 ms. Allocated memory is still 1.1 GB. Free memory was 961.2 MB in the beginning and 939.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: RCFGBuilder took 2508.33 ms. Allocated memory is still 1.1 GB. Free memory was 939.7 MB in the beginning and 876.0 MB in the end (delta: 63.7 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: TraceAbstraction took 254566.82 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 996.7 MB). Free memory was 870.9 MB in the beginning and 1.3 GB in the end (delta: -427.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,948 INFO L168 Benchmark]: Witness Printer took 150.44 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:26,950 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 932.7 MB in the beginning and 998.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.92 ms. Allocated memory is still 1.1 GB. Free memory was 998.8 MB in the beginning and 961.2 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.59 ms. Allocated memory is still 1.1 GB. Free memory was 961.2 MB in the beginning and 939.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2508.33 ms. Allocated memory is still 1.1 GB. Free memory was 939.7 MB in the beginning and 876.0 MB in the end (delta: 63.7 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 254566.82 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 996.7 MB). Free memory was 870.9 MB in the beginning and 1.3 GB in the end (delta: -427.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 150.44 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 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_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((1 == a2 && a29 + 144 <= 0) && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 192415)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((5 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a29 <= 41) && 0 < a29 + 144)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 104 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && 0 < a29 + 144) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((2 == a2 && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 2 == a2) && !(3 == a2)))) && a29 + 16 <= 0)) || ((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && !(4 == a2)) && !(3 == a2)) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((1 == a2 && a29 + 144 <= 0) && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 192415)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((((a4 + 42 <= 0 && 96102 <= a4 + a29) && 4 == a2) || (((a4 + 42 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337)) || (((a4 + 89 <= 0 && a29 + 145 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 98 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((((5 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a29 <= 41) && 0 < a29 + 144)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 104 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && 0 < a29 + 144) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((a0 <= 599970 && ((2 == a2 && ((((a4 + 86 <= 0 && a2 <= 2) && a29 + 127 <= 0) && !(3 == a2)) || (a4 + 86 <= 0 && 1 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 2 == a2) && !(3 == a2)))) && a29 + 16 <= 0)) || ((((((a4 + 86 <= 0 && a4 + 89 <= 0) && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((a4 + 42 <= 0 && (\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43)) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && !(4 == a2)) && !(3 == a2)) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_833,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] [2019-12-07 11:06:26,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_898,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((a29 <= 41 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2) || ((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 16) && 2 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 <= 41) && 0 < a29 + 144) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 127 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 147 <= 0) && (\exists v_prenex_2 : int :: 0 <= v_prenex_2 + 371124 && a29 <= (v_prenex_2 + 11) % 29 + 15)) && 3 == a2)) || ((a0 + 366640 <= 0 && 0 < a29 + 144) && 2 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) && 0 <= a29 + 192415)) || (((((a4 + 86 <= 0 && !(6 == input)) && 0 < a29 + 16) && 0 < a29 + 144) && 2 == a2) && !(3 == a2))) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 366694)) || ((((5 <= a2 && a0 + 98 <= 0) && a29 <= 41) && a4 + 42 <= 0) && 0 < a29 + 144)) || (((((5 <= a2 && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0) && a29 + 127 <= 0) && 0 <= a29 + 192415)) || ((((300109 <= a0 && a4 + 86 <= 0) && a29 + 127 <= 0) && 4 == a2) && !(3 == a2))) || (((5 <= a2 && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 < a29 + 144)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a29 + 16 <= 0) && 2 == a2) && !(3 == a2))) || ((((a4 + 89 <= 0 && a29 + 145 <= 0) && !(1 == input)) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 + 600067 <= a0)) && 3 == a2)) || ((a0 + 147 <= 0 && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || ((a4 + 89 <= 0 && (a0 + 147 <= 0 || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a0 + 366640 <= 0 && a4 + 42 <= 0) && (\exists v_~a0~0_833 : int :: (((0 <= 10 * (v_~a0~0_833 / 5) + 3459800 && 0 <= v_~a0~0_833) && v_~a0~0_833 <= 599970) && (v_~a0~0_833 / 5 * 10 + 3459790) / -9 <= a0) && 0 <= 10 * (v_~a0~0_833 / 5) + 3459790)) && 0 < a29 + 144) && 3 == a2)) || (((((((a0 <= 599970 && a4 + 86 <= 0) && 5 <= a2) && !(1 == a2)) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || (((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 96102 <= a4 + a29)) || ((((((a4 + 86 <= 0 && 5 <= a2) && a29 <= 41) && !(1 == a2)) && 0 < a29 + 144) && !(4 == a2)) && !(3 == a2))) || ((((a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 0 <= a0 + 366694)) || (((((\exists v_~a29~0_893 : int :: ((0 < v_~a29~0_893 + 16 && v_~a29~0_893 / 5 + 134659 <= a29) && v_~a29~0_893 % 5 == 0) && v_~a29~0_893 <= 43) && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2) && 0 <= a0 + 366694)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 2 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 + 16 <= 0) && 0 < a29 + 144)) || ((((a4 + 86 <= 0 && a29 <= 42) && 0 < a29 + 144) && 4 == a2) && !(3 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && 3 == a2)) || ((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_895 : int :: (43 < v_~a29~0_895 && 0 == v_~a29~0_895 % 299978) && v_~a29~0_895 % 299978 + 300022 <= a29)) && a0 + 104 <= 0) && 4 == a2)) || ((((a0 + 366640 <= 0 && a29 <= 41) && a4 + 42 <= 0) && 4 == a2) && 0 <= a0 + 366694)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 144) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 3 == a2)) || ((((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && 96102 <= a4 + a29) && 4 == a2) || ((((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && (\exists v_~a29~0_898 : int :: (v_~a29~0_898 < 0 && !(0 == v_~a29~0_898 % 299978)) && v_~a29~0_898 % 299978 + 43 <= a29)) && 4 == a2) && 0 <= a0 + 366694)) && a0 + 104 <= 0) && 0 <= a0 + 459337) - 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: 189.0s, OverallIterations: 26, TraceHistogramMax: 9, AutomataDifference: 135.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 65.4s, HoareTripleCheckerStatistics: 5129 SDtfs, 41870 SDslu, 2327 SDs, 0 SdLazy, 86670 SolverSat, 10511 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 110.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9841 GetRequests, 9580 SyntacticMatches, 21 SemanticMatches, 240 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3185 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28230occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 62225 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 322 NumberOfFragments, 3224 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2651209 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 57624104 FormulaSimplificationTreeSizeReductionInter, 60.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 30606 NumberOfCodeBlocks, 30606 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 30570 ConstructedInterpolants, 1511 QuantifiedInterpolants, 150121545 SizeOfPredicates, 16 NumberOfNonLiveVariables, 10941 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 48672/57110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...