./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/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 470b628433c20f1f4cfd605e13f92536d937b372 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:12,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:12,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:12,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:12,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:12,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:12,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:12,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:12,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:12,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:12,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:12,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:12,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:12,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:12,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:12,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:12,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:12,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:12,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:12,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:12,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:12,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:12,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:12,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:12,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:12,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:12,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:12,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:12,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:12,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:12,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:12,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:12,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:12,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:12,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:12,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:12,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:12,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:12,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:12,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:12,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:12,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:40:12,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:12,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:12,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:12,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:12,876 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:12,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:12,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:40:12,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:40:12,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:40:12,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:12,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:40:12,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:40:12,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:40:12,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:40:12,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:40:12,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:12,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:40:12,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:12,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:12,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:40:12,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:40:12,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:12,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:12,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:40:12,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:40:12,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:40:12,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:40:12,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:40:12,881 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_7c14a6d0-cb23-48dc-a2e3-e9b459043519/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 -> 470b628433c20f1f4cfd605e13f92536d937b372 [2019-11-16 00:40:12,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:12,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:12,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:12,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:12,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:12,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-11-16 00:40:12,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/data/46ab773df/010cea31d29d48b3bddd6d102635109d/FLAG620880b7a [2019-11-16 00:40:13,555 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:13,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-11-16 00:40:13,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/data/46ab773df/010cea31d29d48b3bddd6d102635109d/FLAG620880b7a [2019-11-16 00:40:13,699 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/data/46ab773df/010cea31d29d48b3bddd6d102635109d [2019-11-16 00:40:13,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:13,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:40:13,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:13,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:13,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:13,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d47d737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:13, skipping insertion in model container [2019-11-16 00:40:13,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:13" (1/1) ... [2019-11-16 00:40:13,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:13,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:14,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:14,690 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:14,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:15,017 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15 WrapperNode [2019-11-16 00:40:15,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:15,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:15,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:40:15,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:40:15,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:15,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:15,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:15,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:15,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... [2019-11-16 00:40:15,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:15,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:15,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:15,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:15,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:15,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:15,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:18,782 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:18,783 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:40:18,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:18 BoogieIcfgContainer [2019-11-16 00:40:18,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:18,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:40:18,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:40:18,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:40:18,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:13" (1/3) ... [2019-11-16 00:40:18,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f53f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:18, skipping insertion in model container [2019-11-16 00:40:18,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:15" (2/3) ... [2019-11-16 00:40:18,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f53f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:18, skipping insertion in model container [2019-11-16 00:40:18,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:18" (3/3) ... [2019-11-16 00:40:18,796 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2019-11-16 00:40:18,807 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:40:18,816 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:40:18,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:40:18,864 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:40:18,864 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:40:18,864 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:40:18,864 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:18,864 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:18,865 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:40:18,865 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:18,865 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:40:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:40:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:40:18,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:18,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:18,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-16 00:40:18,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:18,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979746668] [2019-11-16 00:40:18,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:18,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:19,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979746668] [2019-11-16 00:40:19,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:19,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:19,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943113818] [2019-11-16 00:40:19,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:19,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:19,173 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:40:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:23,826 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-16 00:40:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:23,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-16 00:40:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:23,848 INFO L225 Difference]: With dead ends: 1466 [2019-11-16 00:40:23,848 INFO L226 Difference]: Without dead ends: 974 [2019-11-16 00:40:23,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-16 00:40:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-16 00:40:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-16 00:40:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-16 00:40:23,973 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 53 [2019-11-16 00:40:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:23,974 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-16 00:40:23,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-16 00:40:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-16 00:40:23,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:23,982 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:23,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1371805199, now seen corresponding path program 1 times [2019-11-16 00:40:23,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:23,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035396253] [2019-11-16 00:40:23,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:23,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:23,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:24,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035396253] [2019-11-16 00:40:24,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:24,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:24,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803121227] [2019-11-16 00:40:24,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:24,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:24,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:24,261 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-11-16 00:40:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:27,827 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2019-11-16 00:40:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:27,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-16 00:40:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:27,844 INFO L225 Difference]: With dead ends: 3751 [2019-11-16 00:40:27,844 INFO L226 Difference]: Without dead ends: 2781 [2019-11-16 00:40:27,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-11-16 00:40:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2019-11-16 00:40:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-11-16 00:40:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2019-11-16 00:40:27,910 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 118 [2019-11-16 00:40:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:27,911 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2019-11-16 00:40:27,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2019-11-16 00:40:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-16 00:40:27,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:27,927 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:40:27,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash 687400732, now seen corresponding path program 1 times [2019-11-16 00:40:27,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:27,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418851170] [2019-11-16 00:40:27,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:27,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-16 00:40:28,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418851170] [2019-11-16 00:40:28,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751599187] [2019-11-16 00:40:28,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:28,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:28,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:28,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:28,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-16 00:40:28,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445086028] [2019-11-16 00:40:28,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:28,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:28,539 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 3 states. [2019-11-16 00:40:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:30,316 INFO L93 Difference]: Finished difference Result 7345 states and 9794 transitions. [2019-11-16 00:40:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:30,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-16 00:40:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:30,342 INFO L225 Difference]: With dead ends: 7345 [2019-11-16 00:40:30,342 INFO L226 Difference]: Without dead ends: 4870 [2019-11-16 00:40:30,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-16 00:40:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 2775. [2019-11-16 00:40:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-16 00:40:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2019-11-16 00:40:30,414 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 263 [2019-11-16 00:40:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:30,415 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2019-11-16 00:40:30,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2019-11-16 00:40:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-16 00:40:30,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:30,419 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:40:30,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:30,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -628651217, now seen corresponding path program 1 times [2019-11-16 00:40:30,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:30,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096768787] [2019-11-16 00:40:30,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:30,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:30,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-16 00:40:31,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096768787] [2019-11-16 00:40:31,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:31,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:31,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555799196] [2019-11-16 00:40:31,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:40:31,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:40:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:31,255 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2019-11-16 00:40:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:34,734 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2019-11-16 00:40:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:34,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2019-11-16 00:40:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:34,755 INFO L225 Difference]: With dead ends: 6746 [2019-11-16 00:40:34,755 INFO L226 Difference]: Without dead ends: 3973 [2019-11-16 00:40:34,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-11-16 00:40:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-11-16 00:40:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-11-16 00:40:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2019-11-16 00:40:34,826 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 330 [2019-11-16 00:40:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:34,828 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2019-11-16 00:40:34,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:40:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2019-11-16 00:40:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-11-16 00:40:34,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:34,836 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:34,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 424213697, now seen corresponding path program 1 times [2019-11-16 00:40:34,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:34,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891032224] [2019-11-16 00:40:34,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:35,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891032224] [2019-11-16 00:40:35,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075224953] [2019-11-16 00:40:35,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:35,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:36,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:36,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:40:36,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347269332] [2019-11-16 00:40:36,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:36,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:40:36,052 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 3 states. [2019-11-16 00:40:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:38,113 INFO L93 Difference]: Finished difference Result 7344 states and 9242 transitions. [2019-11-16 00:40:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:38,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-11-16 00:40:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:38,130 INFO L225 Difference]: With dead ends: 7344 [2019-11-16 00:40:38,130 INFO L226 Difference]: Without dead ends: 3673 [2019-11-16 00:40:38,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 404 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:40:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-11-16 00:40:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2019-11-16 00:40:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2019-11-16 00:40:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4356 transitions. [2019-11-16 00:40:38,200 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4356 transitions. Word has length 404 [2019-11-16 00:40:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:38,201 INFO L462 AbstractCegarLoop]: Abstraction has 3671 states and 4356 transitions. [2019-11-16 00:40:38,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4356 transitions. [2019-11-16 00:40:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-16 00:40:38,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:38,209 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:38,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:38,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1079722266, now seen corresponding path program 1 times [2019-11-16 00:40:38,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:38,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18381332] [2019-11-16 00:40:38,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-16 00:40:38,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18381332] [2019-11-16 00:40:38,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:38,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:38,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935595671] [2019-11-16 00:40:38,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:38,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:38,836 INFO L87 Difference]: Start difference. First operand 3671 states and 4356 transitions. Second operand 4 states. [2019-11-16 00:40:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:41,635 INFO L93 Difference]: Finished difference Result 9137 states and 11217 transitions. [2019-11-16 00:40:41,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:41,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-16 00:40:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:41,665 INFO L225 Difference]: With dead ends: 9137 [2019-11-16 00:40:41,665 INFO L226 Difference]: Without dead ends: 5468 [2019-11-16 00:40:41,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-11-16 00:40:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5467. [2019-11-16 00:40:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2019-11-16 00:40:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 6522 transitions. [2019-11-16 00:40:41,778 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 6522 transitions. Word has length 421 [2019-11-16 00:40:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:41,779 INFO L462 AbstractCegarLoop]: Abstraction has 5467 states and 6522 transitions. [2019-11-16 00:40:41,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 6522 transitions. [2019-11-16 00:40:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-16 00:40:41,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:41,792 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:41,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1964586309, now seen corresponding path program 1 times [2019-11-16 00:40:41,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:41,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747978640] [2019-11-16 00:40:41,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-16 00:40:42,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747978640] [2019-11-16 00:40:42,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:42,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:42,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402622208] [2019-11-16 00:40:42,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:42,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:42,273 INFO L87 Difference]: Start difference. First operand 5467 states and 6522 transitions. Second operand 3 states. [2019-11-16 00:40:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:44,430 INFO L93 Difference]: Finished difference Result 12725 states and 15454 transitions. [2019-11-16 00:40:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:44,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2019-11-16 00:40:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:44,461 INFO L225 Difference]: With dead ends: 12725 [2019-11-16 00:40:44,462 INFO L226 Difference]: Without dead ends: 7260 [2019-11-16 00:40:44,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-11-16 00:40:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7260. [2019-11-16 00:40:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-11-16 00:40:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 8644 transitions. [2019-11-16 00:40:44,582 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 8644 transitions. Word has length 517 [2019-11-16 00:40:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:44,583 INFO L462 AbstractCegarLoop]: Abstraction has 7260 states and 8644 transitions. [2019-11-16 00:40:44,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 8644 transitions. [2019-11-16 00:40:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-16 00:40:44,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:44,600 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:44,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 667607770, now seen corresponding path program 1 times [2019-11-16 00:40:44,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:44,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653166247] [2019-11-16 00:40:44,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 634 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-16 00:40:45,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653166247] [2019-11-16 00:40:45,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424337546] [2019-11-16 00:40:45,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:40:45,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:46,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:40:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-16 00:40:46,571 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:40:46,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-16 00:40:46,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055200868] [2019-11-16 00:40:46,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:40:46,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:40:46,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:40:46,574 INFO L87 Difference]: Start difference. First operand 7260 states and 8644 transitions. Second operand 9 states. [2019-11-16 00:40:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:52,593 INFO L93 Difference]: Finished difference Result 19457 states and 22803 transitions. [2019-11-16 00:40:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:40:52,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 608 [2019-11-16 00:40:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:52,609 INFO L225 Difference]: With dead ends: 19457 [2019-11-16 00:40:52,609 INFO L226 Difference]: Without dead ends: 9053 [2019-11-16 00:40:52,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:40:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-11-16 00:40:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 6660. [2019-11-16 00:40:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-16 00:40:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7156 transitions. [2019-11-16 00:40:52,715 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7156 transitions. Word has length 608 [2019-11-16 00:40:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:52,715 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7156 transitions. [2019-11-16 00:40:52,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:40:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7156 transitions. [2019-11-16 00:40:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-11-16 00:40:52,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:52,735 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:52,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:52,939 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -450281948, now seen corresponding path program 1 times [2019-11-16 00:40:52,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:52,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236872175] [2019-11-16 00:40:52,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:52,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:52,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:40:53,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236872175] [2019-11-16 00:40:53,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:53,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:53,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836284280] [2019-11-16 00:40:53,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:53,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:53,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:53,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:53,485 INFO L87 Difference]: Start difference. First operand 6660 states and 7156 transitions. Second operand 3 states. [2019-11-16 00:40:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:54,542 INFO L93 Difference]: Finished difference Result 13316 states and 14308 transitions. [2019-11-16 00:40:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:54,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-11-16 00:40:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:54,554 INFO L225 Difference]: With dead ends: 13316 [2019-11-16 00:40:54,554 INFO L226 Difference]: Without dead ends: 6658 [2019-11-16 00:40:54,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2019-11-16 00:40:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6658. [2019-11-16 00:40:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-11-16 00:40:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7152 transitions. [2019-11-16 00:40:54,632 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7152 transitions. Word has length 650 [2019-11-16 00:40:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 6658 states and 7152 transitions. [2019-11-16 00:40:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7152 transitions. [2019-11-16 00:40:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-11-16 00:40:54,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:54,642 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:40:54,642 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1610580137, now seen corresponding path program 1 times [2019-11-16 00:40:54,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:54,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096775206] [2019-11-16 00:40:54,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:54,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:54,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 473 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-16 00:40:55,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096775206] [2019-11-16 00:40:55,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706856731] [2019-11-16 00:40:55,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:55,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:56,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-16 00:40:56,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:56,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:40:56,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755516408] [2019-11-16 00:40:56,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:56,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:40:56,434 INFO L87 Difference]: Start difference. First operand 6658 states and 7152 transitions. Second operand 3 states. [2019-11-16 00:40:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:57,322 INFO L93 Difference]: Finished difference Result 13315 states and 14304 transitions. [2019-11-16 00:40:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:57,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-11-16 00:40:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:57,333 INFO L225 Difference]: With dead ends: 13315 [2019-11-16 00:40:57,333 INFO L226 Difference]: Without dead ends: 6659 [2019-11-16 00:40:57,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 664 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:40:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-11-16 00:40:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6656. [2019-11-16 00:40:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-11-16 00:40:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7064 transitions. [2019-11-16 00:40:57,409 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7064 transitions. Word has length 663 [2019-11-16 00:40:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:57,410 INFO L462 AbstractCegarLoop]: Abstraction has 6656 states and 7064 transitions. [2019-11-16 00:40:57,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7064 transitions. [2019-11-16 00:40:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-11-16 00:40:57,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:57,419 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:40:57,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:57,625 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1841661433, now seen corresponding path program 1 times [2019-11-16 00:40:57,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:57,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24946539] [2019-11-16 00:40:57,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:57,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:57,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 81 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:58,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24946539] [2019-11-16 00:40:58,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592006373] [2019-11-16 00:40:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:59,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:59,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:00,189 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 60 DAG size of output: 17 [2019-11-16 00:41:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-16 00:41:00,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:41:00,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-16 00:41:00,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262431503] [2019-11-16 00:41:00,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:41:00,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:41:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:41:00,663 INFO L87 Difference]: Start difference. First operand 6656 states and 7064 transitions. Second operand 3 states. [2019-11-16 00:41:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:25,808 INFO L93 Difference]: Finished difference Result 17214 states and 18273 transitions. [2019-11-16 00:41:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:41:25,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-11-16 00:41:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:25,819 INFO L225 Difference]: With dead ends: 17214 [2019-11-16 00:41:25,819 INFO L226 Difference]: Without dead ends: 10261 [2019-11-16 00:41:25,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:41:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2019-11-16 00:41:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 9650. [2019-11-16 00:41:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9650 states. [2019-11-16 00:41:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9650 states to 9650 states and 10207 transitions. [2019-11-16 00:41:25,942 INFO L78 Accepts]: Start accepts. Automaton has 9650 states and 10207 transitions. Word has length 685 [2019-11-16 00:41:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:25,943 INFO L462 AbstractCegarLoop]: Abstraction has 9650 states and 10207 transitions. [2019-11-16 00:41:25,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:41:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9650 states and 10207 transitions. [2019-11-16 00:41:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-11-16 00:41:25,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:25,955 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:26,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:26,159 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1459953853, now seen corresponding path program 1 times [2019-11-16 00:41:26,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:26,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532597651] [2019-11-16 00:41:26,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:26,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:26,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:41:28,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532597651] [2019-11-16 00:41:28,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105920999] [2019-11-16 00:41:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:28,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:41:29,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:29,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:29,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:31,106 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-11-16 00:41:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-16 00:41:31,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:41:31,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2019-11-16 00:41:31,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877749513] [2019-11-16 00:41:31,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:41:31,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:41:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:41:31,752 INFO L87 Difference]: Start difference. First operand 9650 states and 10207 transitions. Second operand 4 states. [2019-11-16 00:42:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:05,630 INFO L93 Difference]: Finished difference Result 21397 states and 22714 transitions. [2019-11-16 00:42:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:05,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 711 [2019-11-16 00:42:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:05,641 INFO L225 Difference]: With dead ends: 21397 [2019-11-16 00:42:05,641 INFO L226 Difference]: Without dead ends: 11749 [2019-11-16 00:42:05,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:42:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11749 states. [2019-11-16 00:42:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11749 to 10553. [2019-11-16 00:42:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10553 states. [2019-11-16 00:42:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 11119 transitions. [2019-11-16 00:42:05,764 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 11119 transitions. Word has length 711 [2019-11-16 00:42:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:05,765 INFO L462 AbstractCegarLoop]: Abstraction has 10553 states and 11119 transitions. [2019-11-16 00:42:05,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 11119 transitions. [2019-11-16 00:42:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-11-16 00:42:05,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:05,784 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:05,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:05,988 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1653832397, now seen corresponding path program 1 times [2019-11-16 00:42:05,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:05,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463032007] [2019-11-16 00:42:05,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:05,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:05,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 682 proven. 171 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-16 00:42:07,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463032007] [2019-11-16 00:42:07,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865088630] [2019-11-16 00:42:07,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:07,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:42:07,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-11-16 00:42:08,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:42:08,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-16 00:42:08,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979607229] [2019-11-16 00:42:08,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:08,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:08,726 INFO L87 Difference]: Start difference. First operand 10553 states and 11119 transitions. Second operand 4 states. [2019-11-16 00:42:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:10,667 INFO L93 Difference]: Finished difference Result 26804 states and 28306 transitions. [2019-11-16 00:42:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:10,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 838 [2019-11-16 00:42:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:10,686 INFO L225 Difference]: With dead ends: 26804 [2019-11-16 00:42:10,686 INFO L226 Difference]: Without dead ends: 16253 [2019-11-16 00:42:10,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 837 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2019-11-16 00:42:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 13853. [2019-11-16 00:42:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13853 states. [2019-11-16 00:42:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 14511 transitions. [2019-11-16 00:42:10,826 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 14511 transitions. Word has length 838 [2019-11-16 00:42:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:10,827 INFO L462 AbstractCegarLoop]: Abstraction has 13853 states and 14511 transitions. [2019-11-16 00:42:10,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 14511 transitions. [2019-11-16 00:42:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2019-11-16 00:42:10,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:10,854 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:11,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:11,057 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1916669849, now seen corresponding path program 1 times [2019-11-16 00:42:11,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:11,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658753345] [2019-11-16 00:42:11,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:11,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:11,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-11-16 00:42:12,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658753345] [2019-11-16 00:42:12,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:12,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:12,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548724352] [2019-11-16 00:42:12,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:12,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:12,082 INFO L87 Difference]: Start difference. First operand 13853 states and 14511 transitions. Second operand 3 states. [2019-11-16 00:42:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:13,046 INFO L93 Difference]: Finished difference Result 22574 states and 23677 transitions. [2019-11-16 00:42:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:13,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 892 [2019-11-16 00:42:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:13,058 INFO L225 Difference]: With dead ends: 22574 [2019-11-16 00:42:13,058 INFO L226 Difference]: Without dead ends: 11421 [2019-11-16 00:42:13,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11421 states. [2019-11-16 00:42:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11421 to 10524. [2019-11-16 00:42:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2019-11-16 00:42:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 10910 transitions. [2019-11-16 00:42:13,144 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 10910 transitions. Word has length 892 [2019-11-16 00:42:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:13,145 INFO L462 AbstractCegarLoop]: Abstraction has 10524 states and 10910 transitions. [2019-11-16 00:42:13,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 10910 transitions. [2019-11-16 00:42:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2019-11-16 00:42:13,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:13,162 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:13,162 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash -196750209, now seen corresponding path program 1 times [2019-11-16 00:42:13,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:13,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657302461] [2019-11-16 00:42:13,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:13,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:13,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-11-16 00:42:13,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657302461] [2019-11-16 00:42:13,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:13,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:13,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299835363] [2019-11-16 00:42:13,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:13,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:13,896 INFO L87 Difference]: Start difference. First operand 10524 states and 10910 transitions. Second operand 3 states. [2019-11-16 00:42:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:14,711 INFO L93 Difference]: Finished difference Result 19842 states and 20632 transitions. [2019-11-16 00:42:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:14,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 925 [2019-11-16 00:42:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:14,722 INFO L225 Difference]: With dead ends: 19842 [2019-11-16 00:42:14,722 INFO L226 Difference]: Without dead ends: 12018 [2019-11-16 00:42:14,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-11-16 00:42:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11719. [2019-11-16 00:42:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11719 states. [2019-11-16 00:42:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11719 states to 11719 states and 12144 transitions. [2019-11-16 00:42:14,840 INFO L78 Accepts]: Start accepts. Automaton has 11719 states and 12144 transitions. Word has length 925 [2019-11-16 00:42:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:14,842 INFO L462 AbstractCegarLoop]: Abstraction has 11719 states and 12144 transitions. [2019-11-16 00:42:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11719 states and 12144 transitions. [2019-11-16 00:42:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2019-11-16 00:42:14,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:14,864 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:14,865 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -634879843, now seen corresponding path program 1 times [2019-11-16 00:42:14,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:14,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029100030] [2019-11-16 00:42:14,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:14,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:14,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 262 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:18,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029100030] [2019-11-16 00:42:18,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496431544] [2019-11-16 00:42:18,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:18,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:19,334 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_828 Int)) (and (<= (+ v_~a0~0_828 44) 0) (<= 0 v_~a0~0_828) (<= (mod v_~a0~0_828 299926) (+ c_~a0~0 300074)))) (exists ((v_~a0~0_828 Int)) (let ((.cse0 (mod v_~a0~0_828 299926))) (and (not (= 0 .cse0)) (<= (+ v_~a0~0_828 44) 0) (< v_~a0~0_828 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_~a0~0_828 Int)) (let ((.cse1 (mod v_~a0~0_828 299926))) (and (<= (+ v_~a0~0_828 44) 0) (= 0 .cse1) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2019-11-16 00:42:20,344 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_828 Int)) (and (<= (+ v_~a0~0_828 44) 0) (<= 0 v_~a0~0_828) (<= (mod v_~a0~0_828 299926) (+ c_~a0~0 300074)))) (exists ((v_prenex_3 Int)) (let ((.cse0 (mod v_prenex_3 299926))) (and (<= (+ v_prenex_3 44) 0) (<= .cse0 (+ c_~a0~0 300074)) (= 0 .cse0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 600000)) (not (= 0 .cse1)))))) is different from true [2019-11-16 00:42:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:42:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 480 trivial. 640 not checked. [2019-11-16 00:42:24,624 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:24,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-11-16 00:42:24,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936319072] [2019-11-16 00:42:24,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:42:24,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:42:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=113, Unknown=2, NotChecked=46, Total=210 [2019-11-16 00:42:24,627 INFO L87 Difference]: Start difference. First operand 11719 states and 12144 transitions. Second operand 15 states. [2019-11-16 00:42:36,574 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-16 00:42:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:48,268 INFO L93 Difference]: Finished difference Result 41401 states and 42950 transitions. [2019-11-16 00:42:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:42:48,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 946 [2019-11-16 00:42:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:48,290 INFO L225 Difference]: With dead ends: 41401 [2019-11-16 00:42:48,290 INFO L226 Difference]: Without dead ends: 30282 [2019-11-16 00:42:48,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 943 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=257, Invalid=936, Unknown=5, NotChecked=134, Total=1332 [2019-11-16 00:42:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30282 states. [2019-11-16 00:42:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30282 to 15917. [2019-11-16 00:42:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15917 states. [2019-11-16 00:42:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15917 states to 15917 states and 16507 transitions. [2019-11-16 00:42:48,500 INFO L78 Accepts]: Start accepts. Automaton has 15917 states and 16507 transitions. Word has length 946 [2019-11-16 00:42:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:48,501 INFO L462 AbstractCegarLoop]: Abstraction has 15917 states and 16507 transitions. [2019-11-16 00:42:48,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:42:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 15917 states and 16507 transitions. [2019-11-16 00:42:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2019-11-16 00:42:48,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:48,521 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:48,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:48,722 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 375105591, now seen corresponding path program 1 times [2019-11-16 00:42:48,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:48,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42117586] [2019-11-16 00:42:48,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:48,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:48,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 122 proven. 1240 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-11-16 00:42:51,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42117586] [2019-11-16 00:42:51,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046864895] [2019-11-16 00:42:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:51,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:42:51,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 102 proven. 1260 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-11-16 00:42:53,248 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:53,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-16 00:42:53,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435095735] [2019-11-16 00:42:53,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:42:53,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:42:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:42:53,251 INFO L87 Difference]: Start difference. First operand 15917 states and 16507 transitions. Second operand 9 states. [2019-11-16 00:42:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:56,136 INFO L93 Difference]: Finished difference Result 23422 states and 24315 transitions. [2019-11-16 00:42:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:42:56,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1185 [2019-11-16 00:42:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:56,152 INFO L225 Difference]: With dead ends: 23422 [2019-11-16 00:42:56,153 INFO L226 Difference]: Without dead ends: 23420 [2019-11-16 00:42:56,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:42:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23420 states. [2019-11-16 00:42:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23420 to 20117. [2019-11-16 00:42:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20117 states. [2019-11-16 00:42:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20117 states to 20117 states and 20893 transitions. [2019-11-16 00:42:56,365 INFO L78 Accepts]: Start accepts. Automaton has 20117 states and 20893 transitions. Word has length 1185 [2019-11-16 00:42:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:56,366 INFO L462 AbstractCegarLoop]: Abstraction has 20117 states and 20893 transitions. [2019-11-16 00:42:56,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:42:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20117 states and 20893 transitions. [2019-11-16 00:42:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2019-11-16 00:42:56,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:56,401 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:56,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:56,606 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1817558120, now seen corresponding path program 1 times [2019-11-16 00:42:56,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:56,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657737657] [2019-11-16 00:42:56,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:56,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:56,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6730 backedges. 3560 proven. 198 refuted. 0 times theorem prover too weak. 2972 trivial. 0 not checked. [2019-11-16 00:42:59,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657737657] [2019-11-16 00:42:59,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32942775] [2019-11-16 00:42:59,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:00,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 2190 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:43:00,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6730 backedges. 3626 proven. 0 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2019-11-16 00:43:01,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:01,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:43:01,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660767122] [2019-11-16 00:43:01,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:43:01,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:43:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:01,805 INFO L87 Difference]: Start difference. First operand 20117 states and 20893 transitions. Second operand 3 states. [2019-11-16 00:43:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:02,745 INFO L93 Difference]: Finished difference Result 39634 states and 41179 transitions. [2019-11-16 00:43:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:02,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1908 [2019-11-16 00:43:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:02,764 INFO L225 Difference]: With dead ends: 39634 [2019-11-16 00:43:02,764 INFO L226 Difference]: Without dead ends: 20117 [2019-11-16 00:43:02,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1921 GetRequests, 1909 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20117 states. [2019-11-16 00:43:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20117 to 18917. [2019-11-16 00:43:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18917 states. [2019-11-16 00:43:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18917 states to 18917 states and 19423 transitions. [2019-11-16 00:43:02,955 INFO L78 Accepts]: Start accepts. Automaton has 18917 states and 19423 transitions. Word has length 1908 [2019-11-16 00:43:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:02,956 INFO L462 AbstractCegarLoop]: Abstraction has 18917 states and 19423 transitions. [2019-11-16 00:43:02,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:43:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18917 states and 19423 transitions. [2019-11-16 00:43:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2248 [2019-11-16 00:43:02,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:02,999 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 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, 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-11-16 00:43:03,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:03,205 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash -766057737, now seen corresponding path program 1 times [2019-11-16 00:43:03,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:03,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489950535] [2019-11-16 00:43:03,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:03,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:03,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8957 backedges. 5184 proven. 0 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2019-11-16 00:43:06,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489950535] [2019-11-16 00:43:06,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:06,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:43:06,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65008185] [2019-11-16 00:43:06,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:43:06,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:43:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:06,708 INFO L87 Difference]: Start difference. First operand 18917 states and 19423 transitions. Second operand 4 states. [2019-11-16 00:43:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:08,147 INFO L93 Difference]: Finished difference Result 46218 states and 47453 transitions. [2019-11-16 00:43:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:08,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2247 [2019-11-16 00:43:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:08,148 INFO L225 Difference]: With dead ends: 46218 [2019-11-16 00:43:08,148 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:43:08,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:43:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:43:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:43:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:43:08,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2247 [2019-11-16 00:43:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:08,160 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:43:08,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:43:08,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:43:08,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:43:08,850 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 461 DAG size of output: 359 [2019-11-16 00:43:09,346 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 453 DAG size of output: 358 [2019-11-16 00:43:09,704 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 329 [2019-11-16 00:43:14,358 WARN L191 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 339 DAG size of output: 161 [2019-11-16 00:43:18,884 WARN L191 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 339 DAG size of output: 161 [2019-11-16 00:43:24,531 WARN L191 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 310 DAG size of output: 155 [2019-11-16 00:43:24,533 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,533 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,533 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,533 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,534 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,535 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,536 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,537 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,538 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,539 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,540 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,541 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:43:24,542 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,543 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,544 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:43:24,545 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:43:24,545 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:43:24,546 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:43:24,547 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,548 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,549 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,550 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,550 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse30 (+ ~a0~0 98)) (.cse29 (+ ~a4~0 86)) (.cse26 (+ ~a0~0 44))) (let ((.cse22 (<= 0 .cse26)) (.cse10 (<= .cse29 0)) (.cse20 (< 0 .cse30)) (.cse3 (= 1 ~a2~0)) (.cse18 (< 0 (+ ~a29~0 144))) (.cse8 (<= 2 ~a2~0)) (.cse0 (<= .cse30 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse28 (< 0 .cse29)) (.cse9 (<= ~a2~0 2))) (let ((.cse5 (not (= 5 ~a2~0))) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse15 (and .cse8 .cse0 .cse1 .cse28 .cse9)) (.cse12 (and .cse28 .cse3 (<= ~a29~0 43) .cse18)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse27 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse27) (<= (+ ~a0~0 300075) .cse27))))) (.cse16 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse2 (<= 4 ~a2~0)) (.cse4 (< 0 (+ ~a0~0 147))) (.cse23 (<= .cse26 0)) (.cse21 (<= (+ ~a4~0 89) 0)) (.cse7 (or .cse22 (and .cse10 (not (= 2 ~a2~0))) (and .cse10 .cse20))) (.cse17 (exists ((v_prenex_1 Int)) (let ((.cse25 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse25) (<= ~a29~0 (+ (mod .cse25 29) 14)))))) (.cse11 (= 3 ~a2~0))) (or (and .cse0 (<= 280404 ~a29~0) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse6) (and (and .cse5 .cse1 .cse7) .cse2) (and (and .cse8 .cse9 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and .cse10 .cse11) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse6 .cse15) (and .cse0 .cse1 .cse11) (and (and .cse1 .cse7) .cse16 .cse2) (and .cse16 .cse15) (and .cse0 .cse1 .cse16 .cse3 .cse14) (and .cse8 .cse1 .cse9 .cse7 .cse17) (and .cse12 .cse1 .cse16) (and .cse1 .cse3 .cse18 .cse17 .cse19 .cse20) (and .cse1 .cse13 .cse2 .cse14) (and .cse0 .cse1 .cse16 .cse2 .cse14) (and .cse8 .cse10 .cse9 .cse17) (and .cse7 .cse19) (and .cse8 .cse21 .cse9 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4) (and .cse21 .cse3 .cse22 .cse17 .cse23 (<= 0 (+ ~a29~0 127))) (or (and .cse8 .cse10 .cse9 (<= 4723 ~a0~0)) (and .cse8 .cse21 (exists ((v_prenex_2 Int)) (let ((.cse24 (mod v_prenex_2 299926))) (and (<= (+ .cse24 146) ~a0~0) (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (not (= 0 .cse24))))) .cse9)) (and .cse1 .cse7 .cse17 .cse11))))) [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,551 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:43:24,552 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:43:24,552 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,553 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:43:24,554 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,555 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,556 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse22 (+ ~a29~0 144)) (.cse31 (+ ~a4~0 86)) (.cse28 (+ ~a0~0 44)) (.cse32 (+ ~a0~0 98))) (let ((.cse20 (< 0 .cse32)) (.cse24 (<= 0 .cse28)) (.cse10 (<= .cse31 0)) (.cse3 (= 1 ~a2~0)) (.cse17 (< 0 .cse22)) (.cse8 (<= 2 ~a2~0)) (.cse0 (<= .cse32 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse30 (< 0 .cse31)) (.cse9 (<= ~a2~0 2))) (let ((.cse5 (not (= 5 ~a2~0))) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse15 (and .cse8 .cse0 .cse1 .cse30 .cse9)) (.cse12 (and .cse30 .cse3 (<= ~a29~0 43) .cse17)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse29 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse29) (<= (+ ~a0~0 300075) .cse29))))) (.cse16 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse2 (<= 4 ~a2~0)) (.cse4 (< 0 (+ ~a0~0 147))) (.cse21 (or (and .cse3 .cse24) (and .cse10 .cse3))) (.cse25 (<= .cse28 0)) (.cse23 (<= (+ ~a4~0 89) 0)) (.cse7 (or .cse24 (and .cse10 (not (= 2 ~a2~0))) (and .cse10 .cse20))) (.cse18 (exists ((v_prenex_1 Int)) (let ((.cse27 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse27) (<= ~a29~0 (+ (mod .cse27 29) 14)))))) (.cse11 (= 3 ~a2~0))) (or (and .cse0 (<= 280404 ~a29~0) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse6) (and (and .cse5 .cse1 .cse7) .cse2) (and (and .cse8 .cse9 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and .cse10 .cse11) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse6 .cse15) (and .cse0 .cse1 .cse11) (and (and .cse1 .cse7) .cse16 .cse2) (and .cse16 .cse15) (and .cse0 .cse1 .cse16 .cse3 .cse14) (and .cse12 .cse1 .cse16) (and .cse1 .cse3 .cse17 .cse18 .cse19 .cse20) (and .cse10 .cse21 (<= .cse22 0)) (or (and .cse8 .cse1 .cse9 .cse7 .cse18) (and .cse8 .cse10 .cse9 .cse18)) (and .cse1 .cse13 .cse2 .cse14) (and .cse0 .cse1 .cse16 .cse2 .cse14) (and .cse7 .cse19) (and .cse8 .cse23 .cse9 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse4) (and .cse23 .cse21 .cse24 .cse18 .cse25 (<= 0 (+ ~a29~0 127))) (or (and .cse8 .cse10 .cse9 (<= 4723 ~a0~0)) (and .cse8 .cse23 (exists ((v_prenex_2 Int)) (let ((.cse26 (mod v_prenex_2 299926))) (and (<= (+ .cse26 146) ~a0~0) (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (not (= 0 .cse26))))) .cse9)) (and .cse1 .cse7 .cse18 .cse11))))) [2019-11-16 00:43:24,556 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,556 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,557 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,558 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:43:24,559 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,560 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:43:24,561 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,562 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse22 (+ ~a29~0 144)) (.cse31 (+ ~a4~0 86)) (.cse28 (+ ~a0~0 44)) (.cse32 (+ ~a0~0 98))) (let ((.cse20 (< 0 .cse32)) (.cse24 (<= 0 .cse28)) (.cse10 (<= .cse31 0)) (.cse3 (= 1 ~a2~0)) (.cse17 (< 0 .cse22)) (.cse8 (<= 2 ~a2~0)) (.cse0 (<= .cse32 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse30 (< 0 .cse31)) (.cse9 (<= ~a2~0 2))) (let ((.cse5 (not (= 5 ~a2~0))) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse15 (and .cse8 .cse0 .cse1 .cse30 .cse9)) (.cse12 (and .cse30 .cse3 (<= ~a29~0 43) .cse17)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse29 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse29) (<= (+ ~a0~0 300075) .cse29))))) (.cse16 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse2 (<= 4 ~a2~0)) (.cse4 (< 0 (+ ~a0~0 147))) (.cse21 (or (and .cse3 .cse24) (and .cse10 .cse3))) (.cse25 (<= .cse28 0)) (.cse23 (<= (+ ~a4~0 89) 0)) (.cse7 (or .cse24 (and .cse10 (not (= 2 ~a2~0))) (and .cse10 .cse20))) (.cse18 (exists ((v_prenex_1 Int)) (let ((.cse27 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse27) (<= ~a29~0 (+ (mod .cse27 29) 14)))))) (.cse11 (= 3 ~a2~0))) (or (and .cse0 (<= 280404 ~a29~0) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse6) (and (and .cse5 .cse1 .cse7) .cse2) (and (and .cse8 .cse9 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and .cse10 .cse11) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse6 .cse15) (and .cse0 .cse1 .cse11) (and (and .cse1 .cse7) .cse16 .cse2) (and .cse16 .cse15) (and .cse0 .cse1 .cse16 .cse3 .cse14) (and .cse12 .cse1 .cse16) (and .cse1 .cse3 .cse17 .cse18 .cse19 .cse20) (and .cse10 .cse21 (<= .cse22 0)) (or (and .cse8 .cse1 .cse9 .cse7 .cse18) (and .cse8 .cse10 .cse9 .cse18)) (and .cse1 .cse13 .cse2 .cse14) (and .cse0 .cse1 .cse16 .cse2 .cse14) (and .cse7 .cse19) (and .cse8 .cse23 .cse9 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse4) (and .cse23 .cse21 .cse24 .cse18 .cse25 (<= 0 (+ ~a29~0 127))) (or (and .cse8 .cse10 .cse9 (<= 4723 ~a0~0)) (and .cse8 .cse23 (exists ((v_prenex_2 Int)) (let ((.cse26 (mod v_prenex_2 299926))) (and (<= (+ .cse26 146) ~a0~0) (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (not (= 0 .cse26))))) .cse9)) (and .cse1 .cse7 .cse18 .cse11))))) [2019-11-16 00:43:24,562 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,563 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,564 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,565 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:43:24,566 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,567 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:43:24,568 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:43:24,569 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:43:24,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:24,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:24,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:24,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:43:24 BoogieIcfgContainer [2019-11-16 00:43:24,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:43:24,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:43:24,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:43:24,705 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:43:24,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:18" (3/4) ... [2019-11-16 00:43:24,709 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:43:24,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:43:24,757 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:43:24,797 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-16 00:43:24,802 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-16 00:43:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-16 00:43:25,002 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c14a6d0-cb23-48dc-a2e3-e9b459043519/bin/uautomizer/witness.graphml [2019-11-16 00:43:25,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:43:25,004 INFO L168 Benchmark]: Toolchain (without parser) took 191301.39 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 940.7 MB in the beginning and 1.9 GB in the end (delta: -964.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,004 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:43:25,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1314.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 219.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,005 INFO L168 Benchmark]: Boogie Preprocessor took 202.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,006 INFO L168 Benchmark]: RCFGBuilder took 3342.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,006 INFO L168 Benchmark]: TraceAbstraction took 185916.09 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -802.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,007 INFO L168 Benchmark]: Witness Printer took 301.78 ms. Allocated memory is still 5.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:25,008 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1314.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 219.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 202.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3342.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -124.2 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 185916.09 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -802.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 301.78 ms. Allocated memory is still 5.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-16 00:43:25,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:43:25,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:43:25,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-16 00:43:25,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-16 00:43:25,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:43:25,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-16 00:43:25,101 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a0 + 98 <= 0 && 280404 <= a29) && a4 + 42 <= 0) && 4 <= a2) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || (a4 + 86 <= 0 && 3 == a2)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (0 <= a0 + 595423 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 < a29 + 16) && 4 <= a2)) || (0 < a29 + 16 && (((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || ((((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && a2 <= 2) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && 4723 <= a0) || (((2 <= a2 && a4 + 89 <= 0) && (\exists v_prenex_2 : int :: ((v_prenex_2 % 299926 + 146 <= a0 && v_prenex_2 + 44 <= 0) && v_prenex_2 < 0) && !(0 == v_prenex_2 % 299926))) && a2 <= 2)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 185.7s, OverallIterations: 19, TraceHistogramMax: 12, AutomataDifference: 120.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.3s, HoareTripleCheckerStatistics: 4577 SDtfs, 17102 SDslu, 1208 SDs, 0 SdLazy, 42961 SolverSat, 4737 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 101.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8367 GetRequests, 8216 SyntacticMatches, 24 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20117occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 29371 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 325 NumberOfFragments, 2519 HoareAnnotationTreeSize, 4 FomulaSimplifications, 92206 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 47711 FormulaSimplificationTreeSizeReductionInter, 14.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 22575 NumberOfCodeBlocks, 22575 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 22546 ConstructedInterpolants, 543 QuantifiedInterpolants, 96293255 SizeOfPredicates, 10 NumberOfNonLiveVariables, 9556 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 36903/43280 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...