./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label19.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/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label19.c -s /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94bad701dc31ef8837df5dc0d8bbaaa41b948fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:01,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:01,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:01,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:01,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:01,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:01,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:01,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:01,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:01,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:01,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:01,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:01,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:01,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:01,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:01,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:01,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:01,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:01,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:01,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:01,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:01,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:01,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:01,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:01,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:01,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:01,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:01,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:01,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:01,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:01,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:01,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:01,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:01,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:01,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:01,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:01,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:01,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:01,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:01,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:01,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:01,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:01,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:01,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:01,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:01,439 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:01,440 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:01,440 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:01,440 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:01,440 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:01,440 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:01,441 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:01,441 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:01,441 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:01,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:01,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:01,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:01,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:01,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:01,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:01,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:01,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:01,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:01,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:01,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:01,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:01,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:01,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:01,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:01,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:01,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:01,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:01,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:01,445 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:01,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:01,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:01,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:01,446 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan 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 -> Taipan 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 -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2019-10-22 11:27:01,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:01,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:01,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:01,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:01,487 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:01,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-10-22 11:27:01,541 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/data/9ffeebb55/b0b29a6103044f9085e0efeeedc21159/FLAG566fbe1c7 [2019-10-22 11:27:02,065 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:02,066 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-10-22 11:27:02,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/data/9ffeebb55/b0b29a6103044f9085e0efeeedc21159/FLAG566fbe1c7 [2019-10-22 11:27:02,341 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/data/9ffeebb55/b0b29a6103044f9085e0efeeedc21159 [2019-10-22 11:27:02,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:02,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:02,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:02,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:02,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:02,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:02,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70acf076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02, skipping insertion in model container [2019-10-22 11:27:02,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:02,361 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:02,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:02,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:02,812 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:02,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:02,950 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:02,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02 WrapperNode [2019-10-22 11:27:02,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:02,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:02,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:02,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:02,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:02,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:03,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:03,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:03,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:03,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... [2019-10-22 11:27:03,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:03,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:03,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:03,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:03,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/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-10-22 11:27:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:03,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:04,064 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:04,065 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:27:04,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:04 BoogieIcfgContainer [2019-10-22 11:27:04,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:04,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:04,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:04,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:04,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:02" (1/3) ... [2019-10-22 11:27:04,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3e197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:04, skipping insertion in model container [2019-10-22 11:27:04,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:02" (2/3) ... [2019-10-22 11:27:04,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3e197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:04, skipping insertion in model container [2019-10-22 11:27:04,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:04" (3/3) ... [2019-10-22 11:27:04,073 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2019-10-22 11:27:04,082 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:04,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:27:04,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:27:04,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:04,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:04,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:04,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:04,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:04,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:04,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:04,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-10-22 11:27:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:27:04,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:04,153 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] [2019-10-22 11:27:04,155 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1607169461, now seen corresponding path program 1 times [2019-10-22 11:27:04,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:04,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56596605] [2019-10-22 11:27:04,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:04,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56596605] [2019-10-22 11:27:04,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:04,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:04,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173219272] [2019-10-22 11:27:04,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:04,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:04,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:04,468 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-10-22 11:27:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:05,577 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-10-22 11:27:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:05,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-22 11:27:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:05,593 INFO L225 Difference]: With dead ends: 789 [2019-10-22 11:27:05,593 INFO L226 Difference]: Without dead ends: 465 [2019-10-22 11:27:05,597 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-10-22 11:27:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-22 11:27:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-10-22 11:27:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-22 11:27:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-10-22 11:27:05,671 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 92 [2019-10-22 11:27:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:05,672 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-10-22 11:27:05,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-10-22 11:27:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-22 11:27:05,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:05,676 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:27:05,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1513780896, now seen corresponding path program 1 times [2019-10-22 11:27:05,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:05,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211641054] [2019-10-22 11:27:05,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:05,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:05,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211641054] [2019-10-22 11:27:05,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:05,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:05,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435340089] [2019-10-22 11:27:05,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:05,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:05,799 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-10-22 11:27:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:06,240 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-10-22 11:27:06,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:06,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-22 11:27:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:06,246 INFO L225 Difference]: With dead ends: 899 [2019-10-22 11:27:06,247 INFO L226 Difference]: Without dead ends: 592 [2019-10-22 11:27:06,248 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-10-22 11:27:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-22 11:27:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-22 11:27:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-22 11:27:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-10-22 11:27:06,296 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 96 [2019-10-22 11:27:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:06,297 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-10-22 11:27:06,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-10-22 11:27:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 11:27:06,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:06,300 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:27:06,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 308279990, now seen corresponding path program 1 times [2019-10-22 11:27:06,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:06,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575793636] [2019-10-22 11:27:06,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:06,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575793636] [2019-10-22 11:27:06,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:06,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:06,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072727711] [2019-10-22 11:27:06,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:06,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:06,408 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-10-22 11:27:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:07,149 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-10-22 11:27:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:07,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 11:27:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:07,155 INFO L225 Difference]: With dead ends: 2169 [2019-10-22 11:27:07,155 INFO L226 Difference]: Without dead ends: 1437 [2019-10-22 11:27:07,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-10-22 11:27:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-10-22 11:27:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-10-22 11:27:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-10-22 11:27:07,185 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 101 [2019-10-22 11:27:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:07,186 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-10-22 11:27:07,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-10-22 11:27:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-22 11:27:07,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:07,191 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:27:07,191 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1263008387, now seen corresponding path program 1 times [2019-10-22 11:27:07,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:07,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130810330] [2019-10-22 11:27:07,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:07,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:07,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:07,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130810330] [2019-10-22 11:27:07,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:07,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:27:07,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54030785] [2019-10-22 11:27:07,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:07,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:07,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:07,228 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-10-22 11:27:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:07,649 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-10-22 11:27:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:07,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-22 11:27:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:07,655 INFO L225 Difference]: With dead ends: 3278 [2019-10-22 11:27:07,656 INFO L226 Difference]: Without dead ends: 2130 [2019-10-22 11:27:07,657 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-10-22 11:27:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-10-22 11:27:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-10-22 11:27:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-10-22 11:27:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-10-22 11:27:07,698 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 109 [2019-10-22 11:27:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:07,699 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-10-22 11:27:07,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-10-22 11:27:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-22 11:27:07,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:07,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:07,706 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1854205693, now seen corresponding path program 1 times [2019-10-22 11:27:07,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:07,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561550299] [2019-10-22 11:27:07,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:07,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:07,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561550299] [2019-10-22 11:27:07,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:07,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:07,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216086677] [2019-10-22 11:27:07,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:07,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:07,820 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-10-22 11:27:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:08,465 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-10-22 11:27:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:08,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-22 11:27:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:08,471 INFO L225 Difference]: With dead ends: 3984 [2019-10-22 11:27:08,471 INFO L226 Difference]: Without dead ends: 2136 [2019-10-22 11:27:08,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-10-22 11:27:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-10-22 11:27:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-10-22 11:27:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-22 11:27:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-10-22 11:27:08,511 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 150 [2019-10-22 11:27:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:08,511 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-10-22 11:27:08,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-10-22 11:27:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-22 11:27:08,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:08,515 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:08,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2077294402, now seen corresponding path program 1 times [2019-10-22 11:27:08,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:08,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696605938] [2019-10-22 11:27:08,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:08,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:08,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:08,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696605938] [2019-10-22 11:27:08,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:08,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:08,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034830734] [2019-10-22 11:27:08,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:08,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:08,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:08,594 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-10-22 11:27:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:08,939 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-10-22 11:27:08,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:08,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-22 11:27:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:08,946 INFO L225 Difference]: With dead ends: 4266 [2019-10-22 11:27:08,946 INFO L226 Difference]: Without dead ends: 2137 [2019-10-22 11:27:08,948 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-10-22 11:27:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-10-22 11:27:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-10-22 11:27:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-22 11:27:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-10-22 11:27:08,981 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 159 [2019-10-22 11:27:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:08,982 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-10-22 11:27:08,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-10-22 11:27:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-22 11:27:08,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:08,985 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:08,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1420578269, now seen corresponding path program 1 times [2019-10-22 11:27:08,986 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:08,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962816760] [2019-10-22 11:27:08,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:08,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:08,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 11:27:09,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962816760] [2019-10-22 11:27:09,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:09,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:09,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129404500] [2019-10-22 11:27:09,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:09,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:09,090 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-10-22 11:27:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:09,519 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-10-22 11:27:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:09,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-22 11:27:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:09,525 INFO L225 Difference]: With dead ends: 4258 [2019-10-22 11:27:09,525 INFO L226 Difference]: Without dead ends: 2129 [2019-10-22 11:27:09,527 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-10-22 11:27:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-10-22 11:27:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-10-22 11:27:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-10-22 11:27:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-10-22 11:27:09,558 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 161 [2019-10-22 11:27:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:09,559 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-10-22 11:27:09,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-10-22 11:27:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-22 11:27:09,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:09,563 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:09,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 72359917, now seen corresponding path program 1 times [2019-10-22 11:27:09,564 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:09,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356855298] [2019-10-22 11:27:09,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:09,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:09,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 11:27:09,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356855298] [2019-10-22 11:27:09,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:09,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:09,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635006351] [2019-10-22 11:27:09,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:09,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:09,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:09,625 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-10-22 11:27:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:09,924 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-10-22 11:27:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:09,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-22 11:27:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:09,928 INFO L225 Difference]: With dead ends: 4538 [2019-10-22 11:27:09,928 INFO L226 Difference]: Without dead ends: 2270 [2019-10-22 11:27:09,931 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-10-22 11:27:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-10-22 11:27:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-10-22 11:27:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-10-22 11:27:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-10-22 11:27:09,963 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 170 [2019-10-22 11:27:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:09,963 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-10-22 11:27:09,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-10-22 11:27:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-22 11:27:09,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:09,967 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:09,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash -648360830, now seen corresponding path program 1 times [2019-10-22 11:27:09,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:09,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199472302] [2019-10-22 11:27:09,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:09,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:09,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:27:10,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199472302] [2019-10-22 11:27:10,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:10,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:10,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765561357] [2019-10-22 11:27:10,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:10,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:10,037 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-10-22 11:27:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:10,746 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-10-22 11:27:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:10,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-22 11:27:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:10,753 INFO L225 Difference]: With dead ends: 5239 [2019-10-22 11:27:10,753 INFO L226 Difference]: Without dead ends: 2973 [2019-10-22 11:27:10,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-10-22 11:27:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-10-22 11:27:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-10-22 11:27:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-10-22 11:27:10,793 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 171 [2019-10-22 11:27:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:10,793 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-10-22 11:27:10,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-10-22 11:27:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-22 11:27:10,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:10,798 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:27:10,798 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1613967385, now seen corresponding path program 1 times [2019-10-22 11:27:10,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:10,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771267205] [2019-10-22 11:27:10,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:10,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:10,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:10,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771267205] [2019-10-22 11:27:10,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:10,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:10,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445919126] [2019-10-22 11:27:10,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:10,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:10,876 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-10-22 11:27:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:11,431 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-10-22 11:27:11,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:11,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-10-22 11:27:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:11,437 INFO L225 Difference]: With dead ends: 5658 [2019-10-22 11:27:11,437 INFO L226 Difference]: Without dead ends: 2550 [2019-10-22 11:27:11,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-10-22 11:27:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-10-22 11:27:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-10-22 11:27:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-10-22 11:27:11,475 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 194 [2019-10-22 11:27:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:11,476 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-10-22 11:27:11,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-10-22 11:27:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-22 11:27:11,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:11,480 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:11,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1509674929, now seen corresponding path program 1 times [2019-10-22 11:27:11,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:11,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390312863] [2019-10-22 11:27:11,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:11,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:11,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-22 11:27:11,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390312863] [2019-10-22 11:27:11,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097919711] [2019-10-22 11:27:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/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-10-22 11:27:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:11,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:27:11,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-22 11:27:11,753 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-22 11:27:11,797 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:27:11,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-10-22 11:27:11,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657650999] [2019-10-22 11:27:11,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:11,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:11,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:11,799 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 3 states. [2019-10-22 11:27:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:11,990 INFO L93 Difference]: Finished difference Result 4380 states and 4595 transitions. [2019-10-22 11:27:11,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:11,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-10-22 11:27:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:11,993 INFO L225 Difference]: With dead ends: 4380 [2019-10-22 11:27:11,993 INFO L226 Difference]: Without dead ends: 992 [2019-10-22 11:27:11,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 399 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-22 11:27:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-10-22 11:27:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-10-22 11:27:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1026 transitions. [2019-10-22 11:27:12,015 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1026 transitions. Word has length 201 [2019-10-22 11:27:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:12,016 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1026 transitions. [2019-10-22 11:27:12,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1026 transitions. [2019-10-22 11:27:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-22 11:27:12,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:12,019 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:12,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:12,220 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2063084960, now seen corresponding path program 1 times [2019-10-22 11:27:12,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:12,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464635339] [2019-10-22 11:27:12,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:12,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:12,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-22 11:27:12,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464635339] [2019-10-22 11:27:12,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:12,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:12,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110766374] [2019-10-22 11:27:12,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:12,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:12,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:12,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:12,401 INFO L87 Difference]: Start difference. First operand 992 states and 1026 transitions. Second operand 4 states. [2019-10-22 11:27:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:12,544 INFO L93 Difference]: Finished difference Result 1839 states and 1907 transitions. [2019-10-22 11:27:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:12,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-10-22 11:27:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:12,545 INFO L225 Difference]: With dead ends: 1839 [2019-10-22 11:27:12,545 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:27:12,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:27:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:27:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:27:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:27:12,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-10-22 11:27:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:12,548 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:27:12,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:27:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:27:12,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:27:12,830 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-10-22 11:27:13,052 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-10-22 11:27:13,054 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,054 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,054 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,054 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-22 11:27:13,054 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,055 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-22 11:27:13,057 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-22 11:27:13,058 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,059 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,060 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-22 11:27:13,061 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-22 11:27:13,062 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-22 11:27:13,063 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-22 11:27:13,067 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:27:13,068 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-22 11:27:13,069 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~a25~0 1))) (let ((.cse4 (= ~a11~0 1)) (.cse1 (= 10 ~a28~0)) (.cse5 (= ~a28~0 7)) (.cse3 (<= ~a17~0 8)) (.cse6 (= ~a17~0 8)) (.cse7 (<= 10 ~a28~0)) (.cse8 (not .cse2)) (.cse9 (= ~a19~0 1)) (.cse0 (<= ~a11~0 0)) (.cse10 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1) (and (= ~a28~0 9) .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse6 .cse0 .cse5) (and .cse7 .cse8 .cse4) (and .cse9 .cse0 .cse1) (and (not .cse5) .cse9 .cse0 .cse2 .cse3) (and .cse6 .cse0 .cse8 .cse10) (and .cse7 .cse8 .cse9 .cse0 .cse10)))) [2019-10-22 11:27:13,070 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,070 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,070 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-22 11:27:13,070 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-22 11:27:13,070 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-22 11:27:13,071 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-22 11:27:13,072 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a25~0 1))) (let ((.cse4 (= ~a11~0 1)) (.cse1 (= 10 ~a28~0)) (.cse5 (= ~a28~0 7)) (.cse3 (<= ~a17~0 8)) (.cse6 (= ~a17~0 8)) (.cse7 (<= 10 ~a28~0)) (.cse8 (not .cse2)) (.cse9 (= ~a19~0 1)) (.cse0 (<= ~a11~0 0)) (.cse10 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1) (and (= ~a28~0 9) .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse6 .cse0 .cse5) (and .cse7 .cse8 .cse4) (and .cse9 .cse0 .cse1) (and (not .cse5) .cse9 .cse0 .cse2 .cse3) (and .cse6 .cse0 .cse8 .cse10) (and .cse7 .cse8 .cse9 .cse0 .cse10)))) [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-22 11:27:13,073 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,074 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-22 11:27:13,075 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-22 11:27:13,076 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-22 11:27:13,077 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-22 11:27:13,078 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-22 11:27:13,079 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-22 11:27:13,080 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:27:13,080 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-22 11:27:13,080 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:27:13,080 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-22 11:27:13,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:13 BoogieIcfgContainer [2019-10-22 11:27:13,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:13,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:13,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:13,106 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:13,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:04" (3/4) ... [2019-10-22 11:27:13,110 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:27:13,128 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:27:13,133 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:27:13,273 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_11406254-a3cd-4729-9416-d15a22b2cb47/bin/utaipan/witness.graphml [2019-10-22 11:27:13,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:13,276 INFO L168 Benchmark]: Toolchain (without parser) took 10931.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 936.9 MB in the beginning and 938.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 398.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,277 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:13,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,278 INFO L168 Benchmark]: Boogie Preprocessor took 41.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,278 INFO L168 Benchmark]: RCFGBuilder took 1002.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,279 INFO L168 Benchmark]: TraceAbstraction took 9039.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 998.3 MB in the beginning and 962.9 MB in the end (delta: 35.4 MB). Peak memory consumption was 297.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,279 INFO L168 Benchmark]: Witness Printer took 169.04 ms. Allocated memory is still 1.4 GB. Free memory was 962.9 MB in the beginning and 938.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:13,280 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1002.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9039.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 998.3 MB in the beginning and 962.9 MB in the end (delta: 35.4 MB). Peak memory consumption was 297.0 MB. Max. memory is 11.5 GB. * Witness Printer took 169.04 ms. Allocated memory is still 1.4 GB. Free memory was 962.9 MB in the beginning and 938.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((a11 <= 0 && 10 == a28) && a25 == 1) && a17 <= 8) || (a11 == 1 && 10 == a28)) || ((a28 == 9 && a11 == 1) && a17 <= 8)) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a19 == 1 && a11 <= 0) && 10 == a28)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (((a17 == 8 && a11 <= 0) && !(a25 == 1)) && !(a28 == 11))) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a11 <= 0 && 10 == a28) && a25 == 1) && a17 <= 8) || (a11 == 1 && 10 == a28)) || ((a28 == 9 && a11 == 1) && a17 <= 8)) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a19 == 1 && a11 <= 0) && 10 == a28)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (((a17 == 8 && a11 <= 0) && !(a25 == 1)) && !(a28 == 11))) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 8.9s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1537 SDtfs, 2378 SDslu, 267 SDs, 0 SdLazy, 5978 SolverSat, 948 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 416 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2689occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 245 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1172 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2045 NumberOfCodeBlocks, 2045 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2232 ConstructedInterpolants, 0 QuantifiedInterpolants, 711619 SizeOfPredicates, 1 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1498/1506 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...