./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.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_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:36,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:36,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:36,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:36,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:36,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:36,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:36,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:36,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:36,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:36,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:36,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:36,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:36,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:36,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:36,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:36,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:36,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:36,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:36,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:36,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:36,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:36,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:36,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:36,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:36,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:36,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:36,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:36,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:36,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:36,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:36,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:36,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:36,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:36,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:36,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:36,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:36,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:36,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:36,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:36,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:36,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:36,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:36,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:36,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:36,638 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:36,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:36,639 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:36,639 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:36,639 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:36,639 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:36,639 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:36,640 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:36,640 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:36,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:36,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:36,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:36,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:36,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:36,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:36,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:36,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:36,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:36,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:36,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:36,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:36,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:36,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:36,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:36,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:36,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:36,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:36,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:36,644 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:36,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:36,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:36,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:36,645 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_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2019-10-22 11:24:36,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:36,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:36,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:36,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:36,689 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:36,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-10-22 11:24:36,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/data/596d46329/eeba2f6dedcc468f8339f6b9b3fba215/FLAG7d5b6bc93 [2019-10-22 11:24:37,217 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:37,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-10-22 11:24:37,226 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/data/596d46329/eeba2f6dedcc468f8339f6b9b3fba215/FLAG7d5b6bc93 [2019-10-22 11:24:37,517 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/data/596d46329/eeba2f6dedcc468f8339f6b9b3fba215 [2019-10-22 11:24:37,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:37,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:37,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:37,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:37,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:37,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:37" (1/1) ... [2019-10-22 11:24:37,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58004cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:37, skipping insertion in model container [2019-10-22 11:24:37,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:37" (1/1) ... [2019-10-22 11:24:37,533 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:37,582 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:37,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:37,985 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:38,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:38,110 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:38,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38 WrapperNode [2019-10-22 11:24:38,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:38,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:38,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:38,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:38,120 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:24:38" (1/1) ... [2019-10-22 11:24:38,147 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:24:38" (1/1) ... [2019-10-22 11:24:38,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:38,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:38,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:38,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:38,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... [2019-10-22 11:24:38,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:38,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:38,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:38,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:38,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/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:24:38,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:38,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:39,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:39,466 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:24:39,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:39 BoogieIcfgContainer [2019-10-22 11:24:39,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:39,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:39,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:39,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:39,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:37" (1/3) ... [2019-10-22 11:24:39,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444dc6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:39, skipping insertion in model container [2019-10-22 11:24:39,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:38" (2/3) ... [2019-10-22 11:24:39,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444dc6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:39, skipping insertion in model container [2019-10-22 11:24:39,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:39" (3/3) ... [2019-10-22 11:24:39,478 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-10-22 11:24:39,488 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:39,496 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:39,508 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:39,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:39,536 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:39,536 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:39,536 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:39,536 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:39,537 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:39,537 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:39,537 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-10-22 11:24:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-22 11:24:39,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:39,565 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:39,567 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1439061899, now seen corresponding path program 1 times [2019-10-22 11:24:39,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:39,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605380461] [2019-10-22 11:24:39,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:39,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:39,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:39,993 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:24:39,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605380461] [2019-10-22 11:24:39,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:39,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:39,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840360891] [2019-10-22 11:24:40,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:40,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:40,015 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-10-22 11:24:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:41,332 INFO L93 Difference]: Finished difference Result 748 states and 1325 transitions. [2019-10-22 11:24:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:41,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-22 11:24:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:41,349 INFO L225 Difference]: With dead ends: 748 [2019-10-22 11:24:41,349 INFO L226 Difference]: Without dead ends: 454 [2019-10-22 11:24:41,353 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:24:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-22 11:24:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2019-10-22 11:24:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-22 11:24:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2019-10-22 11:24:41,449 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 140 [2019-10-22 11:24:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:41,451 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2019-10-22 11:24:41,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2019-10-22 11:24:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-22 11:24:41,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:41,457 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:41,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2046676736, now seen corresponding path program 1 times [2019-10-22 11:24:41,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:41,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742759986] [2019-10-22 11:24:41,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:41,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:41,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:41,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742759986] [2019-10-22 11:24:41,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:41,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:41,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136627863] [2019-10-22 11:24:41,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:41,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:41,919 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand 10 states. [2019-10-22 11:24:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:43,131 INFO L93 Difference]: Finished difference Result 1672 states and 2295 transitions. [2019-10-22 11:24:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:43,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-10-22 11:24:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:43,138 INFO L225 Difference]: With dead ends: 1672 [2019-10-22 11:24:43,139 INFO L226 Difference]: Without dead ends: 1151 [2019-10-22 11:24:43,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-10-22 11:24:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1011. [2019-10-22 11:24:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-10-22 11:24:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1227 transitions. [2019-10-22 11:24:43,183 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1227 transitions. Word has length 145 [2019-10-22 11:24:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:43,183 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1227 transitions. [2019-10-22 11:24:43,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1227 transitions. [2019-10-22 11:24:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-22 11:24:43,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:43,189 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:43,189 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 706730423, now seen corresponding path program 1 times [2019-10-22 11:24:43,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:43,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303756600] [2019-10-22 11:24:43,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:43,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:43,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:24:43,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303756600] [2019-10-22 11:24:43,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:43,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:43,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340363276] [2019-10-22 11:24:43,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:43,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:43,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:43,338 INFO L87 Difference]: Start difference. First operand 1011 states and 1227 transitions. Second operand 4 states. [2019-10-22 11:24:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:44,119 INFO L93 Difference]: Finished difference Result 2867 states and 3568 transitions. [2019-10-22 11:24:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:44,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-10-22 11:24:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:44,128 INFO L225 Difference]: With dead ends: 2867 [2019-10-22 11:24:44,129 INFO L226 Difference]: Without dead ends: 1858 [2019-10-22 11:24:44,131 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:24:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-10-22 11:24:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1431. [2019-10-22 11:24:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-10-22 11:24:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1691 transitions. [2019-10-22 11:24:44,183 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1691 transitions. Word has length 167 [2019-10-22 11:24:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:44,186 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 1691 transitions. [2019-10-22 11:24:44,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1691 transitions. [2019-10-22 11:24:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-22 11:24:44,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:44,191 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:44,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 514204718, now seen corresponding path program 1 times [2019-10-22 11:24:44,194 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:44,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039917305] [2019-10-22 11:24:44,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:44,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:44,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:24:44,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039917305] [2019-10-22 11:24:44,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:44,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:44,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906096545] [2019-10-22 11:24:44,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:44,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:44,339 INFO L87 Difference]: Start difference. First operand 1431 states and 1691 transitions. Second operand 3 states. [2019-10-22 11:24:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:44,828 INFO L93 Difference]: Finished difference Result 3559 states and 4205 transitions. [2019-10-22 11:24:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:44,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-22 11:24:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:44,834 INFO L225 Difference]: With dead ends: 3559 [2019-10-22 11:24:44,834 INFO L226 Difference]: Without dead ends: 1566 [2019-10-22 11:24:44,838 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:24:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2019-10-22 11:24:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1286. [2019-10-22 11:24:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-10-22 11:24:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1411 transitions. [2019-10-22 11:24:44,867 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1411 transitions. Word has length 233 [2019-10-22 11:24:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:44,869 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 1411 transitions. [2019-10-22 11:24:44,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1411 transitions. [2019-10-22 11:24:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-22 11:24:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:44,874 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:44,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 209319723, now seen corresponding path program 1 times [2019-10-22 11:24:44,875 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:44,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510103058] [2019-10-22 11:24:44,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:44,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:44,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 11:24:45,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510103058] [2019-10-22 11:24:45,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450365316] [2019-10-22 11:24:45,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/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:24:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:45,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 11:24:45,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 11:24:45,353 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:24:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 11:24:45,456 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:24:45,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-10-22 11:24:45,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310667826] [2019-10-22 11:24:45,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:45,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:45,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:45,458 INFO L87 Difference]: Start difference. First operand 1286 states and 1411 transitions. Second operand 5 states. [2019-10-22 11:24:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:46,403 INFO L93 Difference]: Finished difference Result 2877 states and 3163 transitions. [2019-10-22 11:24:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:46,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2019-10-22 11:24:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:46,408 INFO L225 Difference]: With dead ends: 2877 [2019-10-22 11:24:46,409 INFO L226 Difference]: Without dead ends: 1453 [2019-10-22 11:24:46,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-22 11:24:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1286. [2019-10-22 11:24:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-10-22 11:24:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1400 transitions. [2019-10-22 11:24:46,440 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1400 transitions. Word has length 247 [2019-10-22 11:24:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:46,440 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 1400 transitions. [2019-10-22 11:24:46,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1400 transitions. [2019-10-22 11:24:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-22 11:24:46,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:46,445 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:46,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:46,647 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash 287206733, now seen corresponding path program 1 times [2019-10-22 11:24:46,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:46,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702145255] [2019-10-22 11:24:46,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:46,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:46,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 11:24:46,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702145255] [2019-10-22 11:24:46,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:46,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:46,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244550646] [2019-10-22 11:24:46,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:46,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:46,809 INFO L87 Difference]: Start difference. First operand 1286 states and 1400 transitions. Second operand 4 states. [2019-10-22 11:24:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:47,484 INFO L93 Difference]: Finished difference Result 3414 states and 3743 transitions. [2019-10-22 11:24:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:47,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-10-22 11:24:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:47,497 INFO L225 Difference]: With dead ends: 3414 [2019-10-22 11:24:47,497 INFO L226 Difference]: Without dead ends: 2130 [2019-10-22 11:24:47,499 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:24:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-10-22 11:24:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1986. [2019-10-22 11:24:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-10-22 11:24:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2155 transitions. [2019-10-22 11:24:47,542 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2155 transitions. Word has length 268 [2019-10-22 11:24:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:47,544 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2155 transitions. [2019-10-22 11:24:47,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2155 transitions. [2019-10-22 11:24:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-22 11:24:47,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:47,551 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:47,552 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:47,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1285312662, now seen corresponding path program 1 times [2019-10-22 11:24:47,552 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:47,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521445228] [2019-10-22 11:24:47,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:47,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:47,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:47,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521445228] [2019-10-22 11:24:47,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:47,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:47,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487488265] [2019-10-22 11:24:47,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:47,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:47,840 INFO L87 Difference]: Start difference. First operand 1986 states and 2155 transitions. Second operand 5 states. [2019-10-22 11:24:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:48,732 INFO L93 Difference]: Finished difference Result 3971 states and 4293 transitions. [2019-10-22 11:24:48,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:48,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-10-22 11:24:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:48,739 INFO L225 Difference]: With dead ends: 3971 [2019-10-22 11:24:48,740 INFO L226 Difference]: Without dead ends: 1704 [2019-10-22 11:24:48,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-10-22 11:24:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1561. [2019-10-22 11:24:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-10-22 11:24:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1632 transitions. [2019-10-22 11:24:48,782 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1632 transitions. Word has length 291 [2019-10-22 11:24:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:48,783 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 1632 transitions. [2019-10-22 11:24:48,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1632 transitions. [2019-10-22 11:24:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-22 11:24:48,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:48,790 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:48,791 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash 733079694, now seen corresponding path program 1 times [2019-10-22 11:24:48,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:48,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247246514] [2019-10-22 11:24:48,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:48,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:48,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 11:24:48,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247246514] [2019-10-22 11:24:48,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:48,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:48,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044849119] [2019-10-22 11:24:48,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:48,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:48,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:48,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:48,933 INFO L87 Difference]: Start difference. First operand 1561 states and 1632 transitions. Second operand 3 states. [2019-10-22 11:24:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,294 INFO L93 Difference]: Finished difference Result 3120 states and 3262 transitions. [2019-10-22 11:24:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:49,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-10-22 11:24:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,300 INFO L225 Difference]: With dead ends: 3120 [2019-10-22 11:24:49,300 INFO L226 Difference]: Without dead ends: 1561 [2019-10-22 11:24:49,302 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:24:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-10-22 11:24:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2019-10-22 11:24:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-10-22 11:24:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1618 transitions. [2019-10-22 11:24:49,331 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1618 transitions. Word has length 318 [2019-10-22 11:24:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,332 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 1618 transitions. [2019-10-22 11:24:49,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1618 transitions. [2019-10-22 11:24:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-22 11:24:49,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,339 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,339 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1479463842, now seen corresponding path program 1 times [2019-10-22 11:24:49,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459545485] [2019-10-22 11:24:49,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-22 11:24:49,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459545485] [2019-10-22 11:24:49,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:49,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372405965] [2019-10-22 11:24:49,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:49,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:49,543 INFO L87 Difference]: Start difference. First operand 1561 states and 1618 transitions. Second operand 3 states. [2019-10-22 11:24:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,965 INFO L93 Difference]: Finished difference Result 3119 states and 3233 transitions. [2019-10-22 11:24:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:49,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-10-22 11:24:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,969 INFO L225 Difference]: With dead ends: 3119 [2019-10-22 11:24:49,969 INFO L226 Difference]: Without dead ends: 994 [2019-10-22 11:24:49,971 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:24:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-10-22 11:24:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2019-10-22 11:24:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-10-22 11:24:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1022 transitions. [2019-10-22 11:24:49,991 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1022 transitions. Word has length 324 [2019-10-22 11:24:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,992 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1022 transitions. [2019-10-22 11:24:49,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1022 transitions. [2019-10-22 11:24:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-22 11:24:50,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,001 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:50,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash 495955641, now seen corresponding path program 1 times [2019-10-22 11:24:50,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004144784] [2019-10-22 11:24:50,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-22 11:24:50,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004144784] [2019-10-22 11:24:50,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:50,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048534774] [2019-10-22 11:24:50,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:50,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:50,294 INFO L87 Difference]: Start difference. First operand 994 states and 1022 transitions. Second operand 5 states. [2019-10-22 11:24:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,020 INFO L93 Difference]: Finished difference Result 2267 states and 2334 transitions. [2019-10-22 11:24:51,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:51,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2019-10-22 11:24:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,025 INFO L225 Difference]: With dead ends: 2267 [2019-10-22 11:24:51,025 INFO L226 Difference]: Without dead ends: 1275 [2019-10-22 11:24:51,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-10-22 11:24:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1134. [2019-10-22 11:24:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-10-22 11:24:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1164 transitions. [2019-10-22 11:24:51,049 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1164 transitions. Word has length 343 [2019-10-22 11:24:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,049 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 1164 transitions. [2019-10-22 11:24:51,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1164 transitions. [2019-10-22 11:24:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-22 11:24:51,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,056 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,057 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1889946957, now seen corresponding path program 1 times [2019-10-22 11:24:51,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191457756] [2019-10-22 11:24:51,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-22 11:24:51,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191457756] [2019-10-22 11:24:51,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:51,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215569733] [2019-10-22 11:24:51,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:51,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:51,273 INFO L87 Difference]: Start difference. First operand 1134 states and 1164 transitions. Second operand 4 states. [2019-10-22 11:24:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,684 INFO L93 Difference]: Finished difference Result 1836 states and 1878 transitions. [2019-10-22 11:24:51,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:51,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2019-10-22 11:24:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,685 INFO L225 Difference]: With dead ends: 1836 [2019-10-22 11:24:51,685 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:51,687 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:24:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:51,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-10-22 11:24:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,688 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:51,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:51,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:52,086 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-10-22 11:24:52,371 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-10-22 11:24:52,373 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,374 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:24:52,375 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,376 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,377 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,377 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-22 11:24:52,377 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-22 11:24:52,377 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-22 11:24:52,378 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,380 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,381 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-22 11:24:52,382 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-22 11:24:52,383 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-22 11:24:52,384 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:24:52,385 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-22 11:24:52,386 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:24:52,387 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:24:52,387 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-22 11:24:52,390 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1))) (let ((.cse2 (not (= ~a17~0 9))) (.cse0 (not .cse6)) (.cse1 (= ~a28~0 7)) (.cse7 (= ~a25~0 1)) (.cse8 (= ~a11~0 1)) (.cse3 (= ~a17~0 8)) (.cse5 (= 10 ~a28~0)) (.cse4 (= ~a21~0 1))) (or (and (and .cse0 .cse1) .cse2) (and .cse0 (<= ~a25~0 0) .cse2 (= 8 ~a28~0)) (and .cse3 .cse1 .cse4) (and (not (= 1 ~a11~0)) (not .cse5) .cse6 .cse7) (and .cse5 .cse7 .cse0) (and .cse3 .cse6 .cse5 .cse4 (= 1 ULTIMATE.start_calculate_output_~input)) (and .cse3 .cse6 .cse4 .cse7) (and .cse8 .cse0) (and (= ~a28~0 9) (and .cse3 .cse6 .cse4)) (and (<= ~a17~0 7) .cse1 .cse7) (and .cse3 .cse4 .cse8) (and .cse3 .cse6 .cse5 .cse4 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)))))) [2019-10-22 11:24:52,391 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,392 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:24:52,393 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1))) (let ((.cse2 (not (= ~a17~0 9))) (.cse0 (not .cse6)) (.cse1 (= ~a28~0 7)) (.cse7 (= ~a25~0 1)) (.cse8 (= ~a11~0 1)) (.cse3 (= ~a17~0 8)) (.cse5 (= 10 ~a28~0)) (.cse4 (= ~a21~0 1))) (or (and (and .cse0 .cse1) .cse2) (and .cse0 (<= ~a25~0 0) .cse2 (= 8 ~a28~0)) (and .cse3 .cse1 .cse4) (and (not (= 1 ~a11~0)) (not .cse5) .cse6 .cse7) (and .cse5 .cse7 .cse0) (and .cse3 .cse6 .cse5 .cse4 (= 1 ULTIMATE.start_calculate_output_~input)) (and .cse3 .cse6 .cse4 .cse7) (and .cse8 .cse0) (and (= ~a28~0 9) (and .cse3 .cse6 .cse4)) (and (<= ~a17~0 7) .cse1 .cse7) (and .cse3 .cse4 .cse8) (and .cse3 .cse6 .cse5 .cse4 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)))))) [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-22 11:24:52,394 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-22 11:24:52,395 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-22 11:24:52,395 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-22 11:24:52,395 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:24:52,396 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,397 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-22 11:24:52,398 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-22 11:24:52,399 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-22 11:24:52,399 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-22 11:24:52,399 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,399 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-22 11:24:52,400 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,401 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:24:52,402 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-22 11:24:52,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:52 BoogieIcfgContainer [2019-10-22 11:24:52,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:52,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:52,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:52,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:52,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:39" (3/4) ... [2019-10-22 11:24:52,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:52,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:24:52,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:24:52,636 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc69de98-6a6a-4bcc-b026-0c6560e64b5b/bin/utaipan/witness.graphml [2019-10-22 11:24:52,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:52,637 INFO L168 Benchmark]: Toolchain (without parser) took 15117.60 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.3 MB). Free memory was 940.5 MB in the beginning and 1.3 GB in the end (delta: -353.6 MB). Peak memory consumption was 192.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:52,638 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:52,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:52,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.81 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:24:52,639 INFO L168 Benchmark]: Boogie Preprocessor took 55.04 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:24:52,639 INFO L168 Benchmark]: RCFGBuilder took 1200.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:52,640 INFO L168 Benchmark]: TraceAbstraction took 12966.17 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 988.5 MB in the beginning and 1.3 GB in the end (delta: -338.2 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:52,640 INFO L168 Benchmark]: Witness Printer took 199.79 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:52,641 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 590.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.81 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 55.04 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 1200.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12966.17 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 988.5 MB in the beginning and 1.3 GB in the end (delta: -338.2 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. * Witness Printer took 199.79 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: ((((((((((((!(a19 == 1) && a28 == 7) && !(a17 == 9)) || (((!(a19 == 1) && a25 <= 0) && !(a17 == 9)) && 8 == a28)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (((!(1 == a11) && !(10 == a28)) && a19 == 1) && a25 == 1)) || ((10 == a28 && a25 == 1) && !(a19 == 1))) || ((((a17 == 8 && a19 == 1) && 10 == a28) && a21 == 1) && 1 == input)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (a11 == 1 && !(a19 == 1))) || (a28 == 9 && (a17 == 8 && a19 == 1) && a21 == 1)) || ((a17 <= 7 && a28 == 7) && a25 == 1)) || ((a17 == 8 && a21 == 1) && a11 == 1)) || ((((a17 == 8 && a19 == 1) && 10 == a28) && a21 == 1) && (((4 == input || 3 == input) || 6 == input) || 5 == input)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((!(a19 == 1) && a28 == 7) && !(a17 == 9)) || (((!(a19 == 1) && a25 <= 0) && !(a17 == 9)) && 8 == a28)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || (((!(1 == a11) && !(10 == a28)) && a19 == 1) && a25 == 1)) || ((10 == a28 && a25 == 1) && !(a19 == 1))) || ((((a17 == 8 && a19 == 1) && 10 == a28) && a21 == 1) && 1 == input)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (a11 == 1 && !(a19 == 1))) || (a28 == 9 && (a17 == 8 && a19 == 1) && a21 == 1)) || ((a17 <= 7 && a28 == 7) && a25 == 1)) || ((a17 == 8 && a21 == 1) && a11 == 1)) || ((((a17 == 8 && a19 == 1) && 10 == a28) && a21 == 1) && (((4 == input || 3 == input) || 6 == input) || 5 == input)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.8s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1066 SDtfs, 3018 SDslu, 331 SDs, 0 SdLazy, 7113 SolverSat, 968 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 513 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1986occurred in iteration=6, 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, 11 MinimizatonAttempts, 1447 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 325 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1332 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 752 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3324 ConstructedInterpolants, 0 QuantifiedInterpolants, 2040516 SizeOfPredicates, 8 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2774/2777 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...