./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label22.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_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/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 5d64bd7f5bbeaca0bb8c10d2e820a015bdae8eae .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:27:34,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:27:34,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:27:34,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:27:34,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:27:34,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:27:34,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:27:34,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:27:34,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:27:34,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:27:34,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:27:34,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:27:34,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:27:34,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:27:34,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:27:34,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:27:34,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:27:34,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:27:34,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:27:34,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:27:34,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:27:34,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:27:34,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:27:34,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:27:34,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:27:34,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:27:34,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:27:34,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:27:34,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:27:34,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:27:34,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:27:34,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:27:34,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:27:34,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:27:34,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:27:34,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:27:34,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:27:34,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:27:34,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:27:34,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:27:34,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:27:34,796 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:27:34,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:27:34,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:27:34,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:27:34,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:27:34,813 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:27:34,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:27:34,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:27:34,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:27:34,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:27:34,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:27:34,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:27:34,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:27:34,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:27:34,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:27:34,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:27:34,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:27:34,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:27:34,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:27:34,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:27:34,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:27:34,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:27:34,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:27:34,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:27:34,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:27:34,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:27:34,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:27:34,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:27:34,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:27:34,820 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_6bfd3648-a6ad-45f3-9867-12714fad60ac/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 -> 5d64bd7f5bbeaca0bb8c10d2e820a015bdae8eae [2019-11-15 22:27:34,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:27:34,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:27:34,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:27:34,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:27:34,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:27:34,863 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label22.c [2019-11-15 22:27:34,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/data/ee82bcc1f/ad12350f802b41639d3e5c4612327cdb/FLAGdef902033 [2019-11-15 22:27:35,483 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:27:35,485 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/sv-benchmarks/c/eca-rers2012/Problem03_label22.c [2019-11-15 22:27:35,504 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/data/ee82bcc1f/ad12350f802b41639d3e5c4612327cdb/FLAGdef902033 [2019-11-15 22:27:35,663 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/data/ee82bcc1f/ad12350f802b41639d3e5c4612327cdb [2019-11-15 22:27:35,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:27:35,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:27:35,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:27:35,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:27:35,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:27:35,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:27:35" (1/1) ... [2019-11-15 22:27:35,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433cded2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:35, skipping insertion in model container [2019-11-15 22:27:35,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:27:35" (1/1) ... [2019-11-15 22:27:35,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:27:35,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:27:36,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:27:36,405 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:27:36,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:27:36,653 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:27:36,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36 WrapperNode [2019-11-15 22:27:36,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:27:36,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:27:36,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:27:36,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:27:36,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:27:36,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:27:36,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:27:36,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:27:36,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... [2019-11-15 22:27:36,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:27:36,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:27:36,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:27:36,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:27:36,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:27:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:27:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:27:39,222 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:27:39,222 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:27:39,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:39 BoogieIcfgContainer [2019-11-15 22:27:39,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:27:39,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:27:39,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:27:39,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:27:39,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:27:35" (1/3) ... [2019-11-15 22:27:39,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d77c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:27:39, skipping insertion in model container [2019-11-15 22:27:39,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:27:36" (2/3) ... [2019-11-15 22:27:39,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d77c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:27:39, skipping insertion in model container [2019-11-15 22:27:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:39" (3/3) ... [2019-11-15 22:27:39,235 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label22.c [2019-11-15 22:27:39,245 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:27:39,253 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:27:39,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:27:39,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:27:39,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:27:39,291 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:27:39,291 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:27:39,291 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:27:39,291 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:27:39,292 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:27:39,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:27:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 22:27:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 22:27:39,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:39,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:39,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1133598669, now seen corresponding path program 1 times [2019-11-15 22:27:39,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:39,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56944164] [2019-11-15 22:27:39,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:39,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:39,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:39,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56944164] [2019-11-15 22:27:39,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:39,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:27:39,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090073322] [2019-11-15 22:27:39,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:39,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:39,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:39,919 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-15 22:27:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:41,581 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-15 22:27:41,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:41,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 22:27:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:41,610 INFO L225 Difference]: With dead ends: 829 [2019-11-15 22:27:41,610 INFO L226 Difference]: Without dead ends: 463 [2019-11-15 22:27:41,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-15 22:27:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-15 22:27:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 22:27:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-15 22:27:41,709 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 167 [2019-11-15 22:27:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:41,710 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-15 22:27:41,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-15 22:27:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 22:27:41,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:41,715 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:27:41,716 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1783223651, now seen corresponding path program 1 times [2019-11-15 22:27:41,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:41,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470630961] [2019-11-15 22:27:41,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:41,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:41,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:41,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470630961] [2019-11-15 22:27:41,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:41,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:41,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547932876] [2019-11-15 22:27:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:41,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:41,859 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-15 22:27:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:43,460 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-15 22:27:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:43,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-15 22:27:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:43,470 INFO L225 Difference]: With dead ends: 1737 [2019-11-15 22:27:43,471 INFO L226 Difference]: Without dead ends: 1290 [2019-11-15 22:27:43,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-15 22:27:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-15 22:27:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 22:27:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-15 22:27:43,516 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 172 [2019-11-15 22:27:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:43,517 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-15 22:27:43,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-15 22:27:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 22:27:43,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:43,523 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:27:43,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 194017064, now seen corresponding path program 1 times [2019-11-15 22:27:43,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:43,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663595103] [2019-11-15 22:27:43,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:43,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:43,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:27:43,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663595103] [2019-11-15 22:27:43,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:43,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:43,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826954670] [2019-11-15 22:27:43,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:43,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:43,762 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-15 22:27:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:45,696 INFO L93 Difference]: Finished difference Result 3344 states and 5142 transitions. [2019-11-15 22:27:45,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:45,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 22:27:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:45,713 INFO L225 Difference]: With dead ends: 3344 [2019-11-15 22:27:45,714 INFO L226 Difference]: Without dead ends: 2487 [2019-11-15 22:27:45,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-11-15 22:27:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2485. [2019-11-15 22:27:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-11-15 22:27:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3446 transitions. [2019-11-15 22:27:45,791 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3446 transitions. Word has length 174 [2019-11-15 22:27:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:45,793 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 3446 transitions. [2019-11-15 22:27:45,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3446 transitions. [2019-11-15 22:27:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:27:45,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:45,801 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:45,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2000740269, now seen corresponding path program 1 times [2019-11-15 22:27:45,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:45,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605228221] [2019-11-15 22:27:45,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:45,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:45,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:27:45,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605228221] [2019-11-15 22:27:45,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:45,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:27:45,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845901464] [2019-11-15 22:27:45,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:45,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:45,882 INFO L87 Difference]: Start difference. First operand 2485 states and 3446 transitions. Second operand 3 states. [2019-11-15 22:27:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:46,345 INFO L93 Difference]: Finished difference Result 7439 states and 10319 transitions. [2019-11-15 22:27:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:46,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-15 22:27:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:46,372 INFO L225 Difference]: With dead ends: 7439 [2019-11-15 22:27:46,373 INFO L226 Difference]: Without dead ends: 4956 [2019-11-15 22:27:46,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-11-15 22:27:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4953. [2019-11-15 22:27:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4953 states. [2019-11-15 22:27:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 6860 transitions. [2019-11-15 22:27:46,488 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 6860 transitions. Word has length 187 [2019-11-15 22:27:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:46,488 INFO L462 AbstractCegarLoop]: Abstraction has 4953 states and 6860 transitions. [2019-11-15 22:27:46,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 6860 transitions. [2019-11-15 22:27:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 22:27:46,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:46,498 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:46,499 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1161579327, now seen corresponding path program 1 times [2019-11-15 22:27:46,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:46,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116951707] [2019-11-15 22:27:46,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:46,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:46,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:27:46,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116951707] [2019-11-15 22:27:46,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:46,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:27:46,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977913423] [2019-11-15 22:27:46,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:46,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:46,601 INFO L87 Difference]: Start difference. First operand 4953 states and 6860 transitions. Second operand 3 states. [2019-11-15 22:27:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:47,167 INFO L93 Difference]: Finished difference Result 9866 states and 13666 transitions. [2019-11-15 22:27:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:47,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-15 22:27:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:47,191 INFO L225 Difference]: With dead ends: 9866 [2019-11-15 22:27:47,192 INFO L226 Difference]: Without dead ends: 4915 [2019-11-15 22:27:47,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-11-15 22:27:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4915. [2019-11-15 22:27:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2019-11-15 22:27:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 6676 transitions. [2019-11-15 22:27:47,363 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 6676 transitions. Word has length 195 [2019-11-15 22:27:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:47,363 INFO L462 AbstractCegarLoop]: Abstraction has 4915 states and 6676 transitions. [2019-11-15 22:27:47,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 6676 transitions. [2019-11-15 22:27:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:27:47,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:47,371 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:47,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1084371729, now seen corresponding path program 1 times [2019-11-15 22:27:47,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:47,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340771587] [2019-11-15 22:27:47,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:47,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:47,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:47,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340771587] [2019-11-15 22:27:47,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:47,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:27:47,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784120392] [2019-11-15 22:27:47,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:27:47,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:47,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:27:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:47,548 INFO L87 Difference]: Start difference. First operand 4915 states and 6676 transitions. Second operand 5 states. [2019-11-15 22:27:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:49,337 INFO L93 Difference]: Finished difference Result 11066 states and 15191 transitions. [2019-11-15 22:27:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:27:49,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-11-15 22:27:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:49,370 INFO L225 Difference]: With dead ends: 11066 [2019-11-15 22:27:49,371 INFO L226 Difference]: Without dead ends: 6153 [2019-11-15 22:27:49,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:27:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2019-11-15 22:27:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 5321. [2019-11-15 22:27:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5321 states. [2019-11-15 22:27:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 7222 transitions. [2019-11-15 22:27:49,636 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 7222 transitions. Word has length 205 [2019-11-15 22:27:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:49,636 INFO L462 AbstractCegarLoop]: Abstraction has 5321 states and 7222 transitions. [2019-11-15 22:27:49,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:27:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 7222 transitions. [2019-11-15 22:27:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 22:27:49,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:49,648 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:49,648 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash 227764771, now seen corresponding path program 1 times [2019-11-15 22:27:49,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:49,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128478336] [2019-11-15 22:27:49,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:49,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:49,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-15 22:27:49,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128478336] [2019-11-15 22:27:49,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74484350] [2019-11-15 22:27:49,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:27:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:49,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:27:49,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:27:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 22:27:50,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:27:50,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 22:27:50,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003507182] [2019-11-15 22:27:50,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:50,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:50,024 INFO L87 Difference]: Start difference. First operand 5321 states and 7222 transitions. Second operand 3 states. [2019-11-15 22:27:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:50,391 INFO L93 Difference]: Finished difference Result 15957 states and 21660 transitions. [2019-11-15 22:27:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:50,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-15 22:27:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:50,450 INFO L225 Difference]: With dead ends: 15957 [2019-11-15 22:27:50,451 INFO L226 Difference]: Without dead ends: 10638 [2019-11-15 22:27:50,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10638 states. [2019-11-15 22:27:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10638 to 10636. [2019-11-15 22:27:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10636 states. [2019-11-15 22:27:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 14415 transitions. [2019-11-15 22:27:50,692 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 14415 transitions. Word has length 239 [2019-11-15 22:27:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:50,693 INFO L462 AbstractCegarLoop]: Abstraction has 10636 states and 14415 transitions. [2019-11-15 22:27:50,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 14415 transitions. [2019-11-15 22:27:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 22:27:50,709 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:50,709 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:50,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:27:50,921 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1616170837, now seen corresponding path program 1 times [2019-11-15 22:27:50,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:50,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242468525] [2019-11-15 22:27:50,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:50,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:50,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:27:51,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242468525] [2019-11-15 22:27:51,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:51,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:51,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128654724] [2019-11-15 22:27:51,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:27:51,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:27:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:51,107 INFO L87 Difference]: Start difference. First operand 10636 states and 14415 transitions. Second operand 3 states. [2019-11-15 22:27:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:52,369 INFO L93 Difference]: Finished difference Result 31442 states and 42521 transitions. [2019-11-15 22:27:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:27:52,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-15 22:27:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:52,408 INFO L225 Difference]: With dead ends: 31442 [2019-11-15 22:27:52,408 INFO L226 Difference]: Without dead ends: 20808 [2019-11-15 22:27:52,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:27:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20808 states. [2019-11-15 22:27:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20808 to 20804. [2019-11-15 22:27:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20804 states. [2019-11-15 22:27:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20804 states to 20804 states and 26387 transitions. [2019-11-15 22:27:52,773 INFO L78 Accepts]: Start accepts. Automaton has 20804 states and 26387 transitions. Word has length 240 [2019-11-15 22:27:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:52,774 INFO L462 AbstractCegarLoop]: Abstraction has 20804 states and 26387 transitions. [2019-11-15 22:27:52,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:27:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 20804 states and 26387 transitions. [2019-11-15 22:27:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 22:27:52,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:52,797 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:27:52,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -915409615, now seen corresponding path program 1 times [2019-11-15 22:27:52,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:52,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079722177] [2019-11-15 22:27:52,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:52,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:52,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:27:52,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079722177] [2019-11-15 22:27:52,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:52,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:52,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787922074] [2019-11-15 22:27:52,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:52,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:52,987 INFO L87 Difference]: Start difference. First operand 20804 states and 26387 transitions. Second operand 4 states. [2019-11-15 22:27:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:54,750 INFO L93 Difference]: Finished difference Result 67013 states and 84831 transitions. [2019-11-15 22:27:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:54,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-15 22:27:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:54,850 INFO L225 Difference]: With dead ends: 67013 [2019-11-15 22:27:54,850 INFO L226 Difference]: Without dead ends: 46211 [2019-11-15 22:27:54,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46211 states. [2019-11-15 22:27:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46211 to 36029. [2019-11-15 22:27:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36029 states. [2019-11-15 22:27:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36029 states to 36029 states and 44359 transitions. [2019-11-15 22:27:55,726 INFO L78 Accepts]: Start accepts. Automaton has 36029 states and 44359 transitions. Word has length 245 [2019-11-15 22:27:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:55,727 INFO L462 AbstractCegarLoop]: Abstraction has 36029 states and 44359 transitions. [2019-11-15 22:27:55,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36029 states and 44359 transitions. [2019-11-15 22:27:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-15 22:27:55,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:55,774 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:27:55,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 752568515, now seen corresponding path program 1 times [2019-11-15 22:27:55,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:55,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622622675] [2019-11-15 22:27:55,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:55,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:55,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:27:55,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622622675] [2019-11-15 22:27:55,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:55,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:55,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204521812] [2019-11-15 22:27:55,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:55,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:55,921 INFO L87 Difference]: Start difference. First operand 36029 states and 44359 transitions. Second operand 4 states. [2019-11-15 22:27:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:27:57,450 INFO L93 Difference]: Finished difference Result 71650 states and 88069 transitions. [2019-11-15 22:27:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:27:57,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-15 22:27:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:27:57,498 INFO L225 Difference]: With dead ends: 71650 [2019-11-15 22:27:57,499 INFO L226 Difference]: Without dead ends: 35623 [2019-11-15 22:27:57,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35623 states. [2019-11-15 22:27:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35623 to 35623. [2019-11-15 22:27:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35623 states. [2019-11-15 22:27:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 41422 transitions. [2019-11-15 22:27:58,291 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 41422 transitions. Word has length 266 [2019-11-15 22:27:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:27:58,291 INFO L462 AbstractCegarLoop]: Abstraction has 35623 states and 41422 transitions. [2019-11-15 22:27:58,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:27:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 41422 transitions. [2019-11-15 22:27:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 22:27:58,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:27:58,327 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:27:58,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:27:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:27:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1942509672, now seen corresponding path program 1 times [2019-11-15 22:27:58,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:27:58,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387157527] [2019-11-15 22:27:58,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:58,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:27:58,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:27:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:27:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:27:58,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387157527] [2019-11-15 22:27:58,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:27:58,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:27:58,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612381619] [2019-11-15 22:27:58,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:27:58,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:27:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:27:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:27:58,458 INFO L87 Difference]: Start difference. First operand 35623 states and 41422 transitions. Second operand 4 states. [2019-11-15 22:28:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:00,636 INFO L93 Difference]: Finished difference Result 132704 states and 154476 transitions. [2019-11-15 22:28:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:28:00,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-15 22:28:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:00,764 INFO L225 Difference]: With dead ends: 132704 [2019-11-15 22:28:00,764 INFO L226 Difference]: Without dead ends: 97083 [2019-11-15 22:28:00,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:28:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97083 states. [2019-11-15 22:28:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97083 to 97081. [2019-11-15 22:28:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97081 states. [2019-11-15 22:28:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97081 states to 97081 states and 112835 transitions. [2019-11-15 22:28:02,211 INFO L78 Accepts]: Start accepts. Automaton has 97081 states and 112835 transitions. Word has length 268 [2019-11-15 22:28:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:02,211 INFO L462 AbstractCegarLoop]: Abstraction has 97081 states and 112835 transitions. [2019-11-15 22:28:02,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:28:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 97081 states and 112835 transitions. [2019-11-15 22:28:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-15 22:28:02,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:02,241 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:02,242 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 962018805, now seen corresponding path program 1 times [2019-11-15 22:28:02,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:02,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760904485] [2019-11-15 22:28:02,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:02,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:02,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:28:02,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760904485] [2019-11-15 22:28:02,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:02,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:28:02,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712773819] [2019-11-15 22:28:02,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:28:02,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:28:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:02,361 INFO L87 Difference]: Start difference. First operand 97081 states and 112835 transitions. Second operand 3 states. [2019-11-15 22:28:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:04,350 INFO L93 Difference]: Finished difference Result 194184 states and 225710 transitions. [2019-11-15 22:28:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:28:04,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-15 22:28:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:04,469 INFO L225 Difference]: With dead ends: 194184 [2019-11-15 22:28:04,469 INFO L226 Difference]: Without dead ends: 97105 [2019-11-15 22:28:04,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97105 states. [2019-11-15 22:28:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97105 to 94645. [2019-11-15 22:28:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94645 states. [2019-11-15 22:28:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94645 states to 94645 states and 105258 transitions. [2019-11-15 22:28:05,273 INFO L78 Accepts]: Start accepts. Automaton has 94645 states and 105258 transitions. Word has length 272 [2019-11-15 22:28:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:05,273 INFO L462 AbstractCegarLoop]: Abstraction has 94645 states and 105258 transitions. [2019-11-15 22:28:05,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:28:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 94645 states and 105258 transitions. [2019-11-15 22:28:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 22:28:05,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:05,285 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:28:05,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash 853434924, now seen corresponding path program 1 times [2019-11-15 22:28:05,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:05,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481722791] [2019-11-15 22:28:05,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:05,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:05,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:28:05,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481722791] [2019-11-15 22:28:05,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:05,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:28:05,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469472536] [2019-11-15 22:28:05,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:28:05,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:28:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:05,417 INFO L87 Difference]: Start difference. First operand 94645 states and 105258 transitions. Second operand 3 states. [2019-11-15 22:28:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:07,148 INFO L93 Difference]: Finished difference Result 187091 states and 207918 transitions. [2019-11-15 22:28:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:28:07,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-15 22:28:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:07,220 INFO L225 Difference]: With dead ends: 187091 [2019-11-15 22:28:07,220 INFO L226 Difference]: Without dead ends: 92448 [2019-11-15 22:28:07,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92448 states. [2019-11-15 22:28:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92448 to 92412. [2019-11-15 22:28:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92412 states. [2019-11-15 22:28:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92412 states to 92412 states and 100986 transitions. [2019-11-15 22:28:07,984 INFO L78 Accepts]: Start accepts. Automaton has 92412 states and 100986 transitions. Word has length 300 [2019-11-15 22:28:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:07,984 INFO L462 AbstractCegarLoop]: Abstraction has 92412 states and 100986 transitions. [2019-11-15 22:28:07,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:28:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 92412 states and 100986 transitions. [2019-11-15 22:28:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-15 22:28:07,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:07,996 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:07,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1530237930, now seen corresponding path program 1 times [2019-11-15 22:28:07,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:07,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268352950] [2019-11-15 22:28:07,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:07,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:07,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-15 22:28:08,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268352950] [2019-11-15 22:28:08,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:28:08,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:28:08,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107974754] [2019-11-15 22:28:08,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:28:08,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:28:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:08,120 INFO L87 Difference]: Start difference. First operand 92412 states and 100986 transitions. Second operand 3 states. [2019-11-15 22:28:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:09,475 INFO L93 Difference]: Finished difference Result 228010 states and 249373 transitions. [2019-11-15 22:28:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:28:09,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-11-15 22:28:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:09,595 INFO L225 Difference]: With dead ends: 228010 [2019-11-15 22:28:09,595 INFO L226 Difference]: Without dead ends: 135600 [2019-11-15 22:28:10,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:28:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135600 states. [2019-11-15 22:28:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135600 to 135582. [2019-11-15 22:28:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135582 states. [2019-11-15 22:28:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135582 states to 135582 states and 148241 transitions. [2019-11-15 22:28:11,335 INFO L78 Accepts]: Start accepts. Automaton has 135582 states and 148241 transitions. Word has length 303 [2019-11-15 22:28:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:11,335 INFO L462 AbstractCegarLoop]: Abstraction has 135582 states and 148241 transitions. [2019-11-15 22:28:11,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:28:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 135582 states and 148241 transitions. [2019-11-15 22:28:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 22:28:11,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:28:11,354 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:28:11,354 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:28:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:28:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2085834207, now seen corresponding path program 1 times [2019-11-15 22:28:11,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:28:11,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813755406] [2019-11-15 22:28:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:28:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:28:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-15 22:28:11,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813755406] [2019-11-15 22:28:11,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134762781] [2019-11-15 22:28:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:28:11,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:28:11,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:28:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-15 22:28:11,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:28:11,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:28:11,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929016722] [2019-11-15 22:28:11,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:28:11,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:28:11,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:28:11,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:11,794 INFO L87 Difference]: Start difference. First operand 135582 states and 148241 transitions. Second operand 3 states. [2019-11-15 22:28:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:28:13,550 INFO L93 Difference]: Finished difference Result 307400 states and 337192 transitions. [2019-11-15 22:28:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:28:13,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-15 22:28:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:28:13,551 INFO L225 Difference]: With dead ends: 307400 [2019-11-15 22:28:13,551 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:28:13,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:28:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:28:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:28:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:28:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:28:13,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2019-11-15 22:28:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:28:13,640 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:28:13,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:28:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:28:13,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:28:13,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:28:13,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:28:21,080 WARN L191 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 1059 DAG size of output: 347 [2019-11-15 22:28:24,434 WARN L191 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 1059 DAG size of output: 347 [2019-11-15 22:28:27,098 WARN L191 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 345 DAG size of output: 56 [2019-11-15 22:28:29,653 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 345 DAG size of output: 56 [2019-11-15 22:28:29,654 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 22:28:29,655 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,656 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,659 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,659 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,659 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,659 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,660 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 22:28:29,661 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,662 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,663 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:28:29,665 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:28:29,665 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,666 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1536) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,667 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,668 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,669 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,670 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,671 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,672 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,673 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:28:29,673 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:28:29,673 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,673 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,673 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,674 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:28:29,674 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,674 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:28:29,675 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,676 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,677 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,678 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse12 (not .cse5))) (let ((.cse4 (<= ~a6~0 0)) (.cse6 (= ~a11~0 1)) (.cse10 (and .cse1 .cse12)) (.cse3 (= ~a26~0 1)) (.cse9 (not (= 0 ~a3~0))) (.cse8 (= 1 ~a6~0)) (.cse0 (<= ~a3~0 0)) (.cse7 (= ~a16~0 1)) (.cse13 (= 1 ~a3~0)) (.cse2 (= ~a5~0 1)) (.cse11 (<= ~a20~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse4 .cse2 .cse6 .cse3 .cse7 (<= ~a27~0 0)) (and .cse8 .cse2 .cse3) (and (not (= ~a7~0 1)) (and .cse9 .cse2 .cse7) .cse8 (= 1 ~a10~0)) (and .cse4 .cse1 .cse5 .cse2) (and .cse1 .cse8 .cse2) (and .cse0 .cse8 .cse2 .cse6) (and .cse0 .cse8 .cse5 .cse2) (and .cse10 .cse2 .cse6) (and .cse9 .cse5 .cse2 .cse3) (and (and .cse10 .cse11) .cse2) (and .cse9 .cse12 .cse4 .cse2 .cse6) (and .cse0 .cse10 .cse2) (and .cse13 .cse2 .cse3) (and .cse9 .cse12 .cse8 .cse2) (and .cse0 (and (not .cse1) .cse7) .cse5 .cse2) (and .cse13 .cse5 .cse2) (and .cse13 .cse2 .cse11))))) [2019-11-15 22:28:29,679 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,679 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,679 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,679 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 22:28:29,679 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,680 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 22:28:29,681 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,682 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:28:29,683 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse12 (not .cse5))) (let ((.cse4 (<= ~a6~0 0)) (.cse6 (= ~a11~0 1)) (.cse10 (and .cse1 .cse12)) (.cse3 (= ~a26~0 1)) (.cse9 (not (= 0 ~a3~0))) (.cse8 (= 1 ~a6~0)) (.cse0 (<= ~a3~0 0)) (.cse7 (= ~a16~0 1)) (.cse13 (= 1 ~a3~0)) (.cse2 (= ~a5~0 1)) (.cse11 (<= ~a20~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse4 .cse2 .cse6 .cse3 .cse7 (<= ~a27~0 0)) (and .cse8 .cse2 .cse3) (and (not (= ~a7~0 1)) (and .cse9 .cse2 .cse7) .cse8 (= 1 ~a10~0)) (and .cse4 .cse1 .cse5 .cse2) (and .cse1 .cse8 .cse2) (and .cse0 .cse8 .cse2 .cse6) (and .cse0 .cse8 .cse5 .cse2) (and .cse10 .cse2 .cse6) (and .cse9 .cse5 .cse2 .cse3) (and (and .cse10 .cse11) .cse2) (and .cse9 .cse12 .cse4 .cse2 .cse6) (and .cse0 .cse10 .cse2) (and .cse13 .cse2 .cse3) (and .cse9 .cse12 .cse8 .cse2) (and .cse0 (and (not .cse1) .cse7) .cse5 .cse2) (and .cse13 .cse5 .cse2) (and .cse13 .cse2 .cse11))))) [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,684 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,685 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,686 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,687 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,688 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:28:29,689 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 22:28:29,690 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,691 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 22:28:29,692 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:28:29,693 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:28:29,694 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,694 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 22:28:29,694 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,695 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,696 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:28:29,696 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:28:29,696 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,697 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,698 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,699 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 22:28:29,700 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 22:28:29,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:28:29 BoogieIcfgContainer [2019-11-15 22:28:29,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:28:29,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:28:29,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:28:29,763 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:28:29,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:27:39" (3/4) ... [2019-11-15 22:28:29,768 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:28:29,805 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:28:29,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:28:30,057 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6bfd3648-a6ad-45f3-9867-12714fad60ac/bin/uautomizer/witness.graphml [2019-11-15 22:28:30,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:28:30,059 INFO L168 Benchmark]: Toolchain (without parser) took 54391.73 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 940.7 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,059 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:28:30,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 985.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,060 INFO L168 Benchmark]: Boogie Preprocessor took 108.99 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,060 INFO L168 Benchmark]: RCFGBuilder took 2319.45 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: 17.0 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,061 INFO L168 Benchmark]: TraceAbstraction took 50537.27 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,061 INFO L168 Benchmark]: Witness Printer took 295.20 ms. Allocated memory is still 4.6 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:28:30,063 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.21 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 985.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.99 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2319.45 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: 17.0 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50537.27 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 295.20 ms. Allocated memory is still 4.6 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1536]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a3 <= 0 && a27 == 1) && a5 == 1) && a26 == 1) || (((a3 <= 0 && a6 <= 0) && a12 == 1) && a5 == 1)) || (((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || ((1 == a6 && a5 == 1) && a26 == 1)) || (((!(a7 == 1) && (!(0 == a3) && a5 == 1) && a16 == 1) && 1 == a6) && 1 == a10)) || (((a6 <= 0 && a27 == 1) && a12 == 1) && a5 == 1)) || ((a27 == 1 && 1 == a6) && a5 == 1)) || (((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1)) || (((a3 <= 0 && 1 == a6) && a12 == 1) && a5 == 1)) || (((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((!(0 == a3) && a12 == 1) && a5 == 1) && a26 == 1)) || (((a27 == 1 && !(a12 == 1)) && a20 <= 0) && a5 == 1)) || ((((!(0 == a3) && !(a12 == 1)) && a6 <= 0) && a5 == 1) && a11 == 1)) || ((a3 <= 0 && a27 == 1 && !(a12 == 1)) && a5 == 1)) || ((1 == a3 && a5 == 1) && a26 == 1)) || (((!(0 == a3) && !(a12 == 1)) && 1 == a6) && a5 == 1)) || (((a3 <= 0 && !(a27 == 1) && a16 == 1) && a12 == 1) && a5 == 1)) || ((1 == a3 && a12 == 1) && a5 == 1)) || ((1 == a3 && a5 == 1) && a20 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a3 <= 0 && a27 == 1) && a5 == 1) && a26 == 1) || (((a3 <= 0 && a6 <= 0) && a12 == 1) && a5 == 1)) || (((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || ((1 == a6 && a5 == 1) && a26 == 1)) || (((!(a7 == 1) && (!(0 == a3) && a5 == 1) && a16 == 1) && 1 == a6) && 1 == a10)) || (((a6 <= 0 && a27 == 1) && a12 == 1) && a5 == 1)) || ((a27 == 1 && 1 == a6) && a5 == 1)) || (((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1)) || (((a3 <= 0 && 1 == a6) && a12 == 1) && a5 == 1)) || (((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((!(0 == a3) && a12 == 1) && a5 == 1) && a26 == 1)) || (((a27 == 1 && !(a12 == 1)) && a20 <= 0) && a5 == 1)) || ((((!(0 == a3) && !(a12 == 1)) && a6 <= 0) && a5 == 1) && a11 == 1)) || ((a3 <= 0 && a27 == 1 && !(a12 == 1)) && a5 == 1)) || ((1 == a3 && a5 == 1) && a26 == 1)) || (((!(0 == a3) && !(a12 == 1)) && 1 == a6) && a5 == 1)) || (((a3 <= 0 && !(a27 == 1) && a16 == 1) && a12 == 1) && a5 == 1)) || ((1 == a3 && a12 == 1) && a5 == 1)) || ((1 == a3 && a5 == 1) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 50.4s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.8s, HoareTripleCheckerStatistics: 2801 SDtfs, 5380 SDslu, 1082 SDs, 0 SdLazy, 10426 SolverSat, 2019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135582occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 13986 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1693 NumberOfFragments, 537 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56908 FormulaSimplificationTreeSizeReduction, 10.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 23516 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 4092 NumberOfCodeBlocks, 4092 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4075 ConstructedInterpolants, 0 QuantifiedInterpolants, 1648466 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1076 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 1936/1947 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...