./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label34.c -s /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/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 967c72bd82820b824aa390b27f8a26458e2fde4d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:08:30,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:08:30,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:08:30,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:08:30,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:08:30,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:08:30,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:08:30,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:08:30,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:08:30,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:08:30,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:08:30,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:08:30,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:08:30,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:08:30,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:08:30,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:08:30,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:08:30,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:08:30,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:08:30,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:08:30,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:08:30,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:08:30,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:08:30,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:08:30,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:08:30,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:08:30,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:08:30,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:08:30,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:08:30,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:08:30,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:08:30,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:08:30,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:08:30,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:08:30,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:08:30,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:08:30,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:08:30,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:08:30,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:08:30,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:08:30,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:08:30,511 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:08:30,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:08:30,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:08:30,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:08:30,524 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:08:30,524 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:08:30,525 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:08:30,525 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:08:30,525 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:08:30,525 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:08:30,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:08:30,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:08:30,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:08:30,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:08:30,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:08:30,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:08:30,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:08:30,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:08:30,529 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/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/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 -> 967c72bd82820b824aa390b27f8a26458e2fde4d [2019-12-07 11:08:30,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:08:30,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:08:30,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:08:30,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:08:30,658 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:08:30,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label34.c [2019-12-07 11:08:30,698 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/data/be4b96e2f/87ef1dba41bb403ebce27f6a298f16f3/FLAG2bced1bbc [2019-12-07 11:08:31,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:08:31,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/sv-benchmarks/c/eca-rers2012/Problem02_label34.c [2019-12-07 11:08:31,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/data/be4b96e2f/87ef1dba41bb403ebce27f6a298f16f3/FLAG2bced1bbc [2019-12-07 11:08:31,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/data/be4b96e2f/87ef1dba41bb403ebce27f6a298f16f3 [2019-12-07 11:08:31,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:08:31,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:08:31,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:08:31,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:08:31,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:08:31,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9a3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31, skipping insertion in model container [2019-12-07 11:08:31,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:08:31,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:08:31,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:08:31,791 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:08:31,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:08:31,875 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:08:31,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31 WrapperNode [2019-12-07 11:08:31,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:08:31,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:08:31,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:08:31,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:08:31,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:08:31,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:08:31,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:08:31,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:08:31,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... [2019-12-07 11:08:31,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:08:31,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:08:31,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:08:31,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:08:31,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/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-12-07 11:08:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:08:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:08:33,182 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:08:33,183 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:08:33,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:33 BoogieIcfgContainer [2019-12-07 11:08:33,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:08:33,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:08:33,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:08:33,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:08:33,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:08:31" (1/3) ... [2019-12-07 11:08:33,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473c7103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:08:33, skipping insertion in model container [2019-12-07 11:08:33,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:31" (2/3) ... [2019-12-07 11:08:33,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473c7103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:08:33, skipping insertion in model container [2019-12-07 11:08:33,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:33" (3/3) ... [2019-12-07 11:08:33,190 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label34.c [2019-12-07 11:08:33,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:08:33,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:08:33,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:08:33,226 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:08:33,226 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:08:33,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:08:33,226 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:08:33,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:08:33,227 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:08:33,227 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:08:33,227 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:08:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 11:08:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 11:08:33,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:33,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:33,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash 925947017, now seen corresponding path program 1 times [2019-12-07 11:08:33,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:33,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976973480] [2019-12-07 11:08:33,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:33,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976973480] [2019-12-07 11:08:33,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:33,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:33,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33003291] [2019-12-07 11:08:33,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:33,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:33,497 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 11:08:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:33,977 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 11:08:33,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:08:33,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 11:08:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:33,991 INFO L225 Difference]: With dead ends: 333 [2019-12-07 11:08:33,991 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 11:08:33,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 11:08:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 11:08:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:08:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2019-12-07 11:08:34,035 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 80 [2019-12-07 11:08:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:34,036 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2019-12-07 11:08:34,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2019-12-07 11:08:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 11:08:34,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:34,040 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:34,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2137917655, now seen corresponding path program 1 times [2019-12-07 11:08:34,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:34,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082892418] [2019-12-07 11:08:34,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:34,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082892418] [2019-12-07 11:08:34,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:34,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:34,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462681395] [2019-12-07 11:08:34,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,087 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand 3 states. [2019-12-07 11:08:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:34,301 INFO L93 Difference]: Finished difference Result 565 states and 925 transitions. [2019-12-07 11:08:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:34,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 11:08:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:34,304 INFO L225 Difference]: With dead ends: 565 [2019-12-07 11:08:34,304 INFO L226 Difference]: Without dead ends: 323 [2019-12-07 11:08:34,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-07 11:08:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-12-07 11:08:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 11:08:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 488 transitions. [2019-12-07 11:08:34,322 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 488 transitions. Word has length 89 [2019-12-07 11:08:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:34,322 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 488 transitions. [2019-12-07 11:08:34,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 488 transitions. [2019-12-07 11:08:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 11:08:34,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:34,325 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:08:34,326 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash 606381089, now seen corresponding path program 1 times [2019-12-07 11:08:34,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:34,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792278045] [2019-12-07 11:08:34,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:34,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792278045] [2019-12-07 11:08:34,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:34,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:34,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047060717] [2019-12-07 11:08:34,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:34,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:34,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,372 INFO L87 Difference]: Start difference. First operand 323 states and 488 transitions. Second operand 3 states. [2019-12-07 11:08:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:34,602 INFO L93 Difference]: Finished difference Result 725 states and 1115 transitions. [2019-12-07 11:08:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:34,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 11:08:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:34,604 INFO L225 Difference]: With dead ends: 725 [2019-12-07 11:08:34,604 INFO L226 Difference]: Without dead ends: 403 [2019-12-07 11:08:34,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-12-07 11:08:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2019-12-07 11:08:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-12-07 11:08:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 578 transitions. [2019-12-07 11:08:34,619 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 578 transitions. Word has length 93 [2019-12-07 11:08:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:34,619 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 578 transitions. [2019-12-07 11:08:34,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 578 transitions. [2019-12-07 11:08:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:08:34,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:34,620 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:34,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1484411888, now seen corresponding path program 1 times [2019-12-07 11:08:34,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:34,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657540032] [2019-12-07 11:08:34,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:08:34,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657540032] [2019-12-07 11:08:34,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:34,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:08:34,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477900973] [2019-12-07 11:08:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:34,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:34,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,660 INFO L87 Difference]: Start difference. First operand 403 states and 578 transitions. Second operand 3 states. [2019-12-07 11:08:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:34,882 INFO L93 Difference]: Finished difference Result 1125 states and 1641 transitions. [2019-12-07 11:08:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:34,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 11:08:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:34,885 INFO L225 Difference]: With dead ends: 1125 [2019-12-07 11:08:34,885 INFO L226 Difference]: Without dead ends: 723 [2019-12-07 11:08:34,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-07 11:08:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-12-07 11:08:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-12-07 11:08:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1003 transitions. [2019-12-07 11:08:34,900 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1003 transitions. Word has length 99 [2019-12-07 11:08:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:34,900 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1003 transitions. [2019-12-07 11:08:34,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1003 transitions. [2019-12-07 11:08:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 11:08:34,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:34,903 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:08:34,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 691139667, now seen corresponding path program 1 times [2019-12-07 11:08:34,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:34,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827919641] [2019-12-07 11:08:34,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:34,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827919641] [2019-12-07 11:08:34,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:34,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:34,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477570040] [2019-12-07 11:08:34,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:34,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:34,973 INFO L87 Difference]: Start difference. First operand 723 states and 1003 transitions. Second operand 4 states. [2019-12-07 11:08:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:35,431 INFO L93 Difference]: Finished difference Result 2647 states and 3688 transitions. [2019-12-07 11:08:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:08:35,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 11:08:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:35,440 INFO L225 Difference]: With dead ends: 2647 [2019-12-07 11:08:35,440 INFO L226 Difference]: Without dead ends: 1925 [2019-12-07 11:08:35,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-07 11:08:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1123. [2019-12-07 11:08:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 11:08:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1534 transitions. [2019-12-07 11:08:35,465 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1534 transitions. Word has length 132 [2019-12-07 11:08:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:35,465 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1534 transitions. [2019-12-07 11:08:35,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1534 transitions. [2019-12-07 11:08:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 11:08:35,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:35,468 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:35,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:35,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1217218579, now seen corresponding path program 1 times [2019-12-07 11:08:35,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:35,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499724664] [2019-12-07 11:08:35,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:08:35,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499724664] [2019-12-07 11:08:35,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:35,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:35,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102514524] [2019-12-07 11:08:35,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:35,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:35,531 INFO L87 Difference]: Start difference. First operand 1123 states and 1534 transitions. Second operand 3 states. [2019-12-07 11:08:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:35,788 INFO L93 Difference]: Finished difference Result 2885 states and 3942 transitions. [2019-12-07 11:08:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:35,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 11:08:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:35,794 INFO L225 Difference]: With dead ends: 2885 [2019-12-07 11:08:35,795 INFO L226 Difference]: Without dead ends: 1683 [2019-12-07 11:08:35,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-12-07 11:08:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1603. [2019-12-07 11:08:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-07 11:08:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2093 transitions. [2019-12-07 11:08:35,822 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2093 transitions. Word has length 143 [2019-12-07 11:08:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:35,822 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2093 transitions. [2019-12-07 11:08:35,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2093 transitions. [2019-12-07 11:08:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 11:08:35,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:35,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:35,825 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1269985318, now seen corresponding path program 1 times [2019-12-07 11:08:35,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:35,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007737978] [2019-12-07 11:08:35,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 11:08:35,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007737978] [2019-12-07 11:08:35,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:35,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:08:35,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551789847] [2019-12-07 11:08:35,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:35,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:35,868 INFO L87 Difference]: Start difference. First operand 1603 states and 2093 transitions. Second operand 4 states. [2019-12-07 11:08:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:36,247 INFO L93 Difference]: Finished difference Result 3605 states and 4691 transitions. [2019-12-07 11:08:36,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:08:36,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 11:08:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:36,256 INFO L225 Difference]: With dead ends: 3605 [2019-12-07 11:08:36,256 INFO L226 Difference]: Without dead ends: 1763 [2019-12-07 11:08:36,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-07 11:08:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2019-12-07 11:08:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-12-07 11:08:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2052 transitions. [2019-12-07 11:08:36,293 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2052 transitions. Word has length 161 [2019-12-07 11:08:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:36,293 INFO L462 AbstractCegarLoop]: Abstraction has 1763 states and 2052 transitions. [2019-12-07 11:08:36,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2052 transitions. [2019-12-07 11:08:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:08:36,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:36,296 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:36,296 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -858792571, now seen corresponding path program 1 times [2019-12-07 11:08:36,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:36,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677132501] [2019-12-07 11:08:36,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 11:08:36,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677132501] [2019-12-07 11:08:36,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660401713] [2019-12-07 11:08:36,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/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-12-07 11:08:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:36,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:08:36,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:08:36,491 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:08:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:08:36,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:08:36,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-12-07 11:08:36,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789989811] [2019-12-07 11:08:36,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:36,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:08:36,534 INFO L87 Difference]: Start difference. First operand 1763 states and 2052 transitions. Second operand 3 states. [2019-12-07 11:08:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:36,648 INFO L93 Difference]: Finished difference Result 2883 states and 3350 transitions. [2019-12-07 11:08:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:36,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 11:08:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:36,649 INFO L225 Difference]: With dead ends: 2883 [2019-12-07 11:08:36,649 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:08:36,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:08:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:08:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:08:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:08:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:08:36,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2019-12-07 11:08:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:36,651 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:08:36,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:08:36,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:08:36,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:36,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:08:37,001 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-12-07 11:08:37,112 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-12-07 11:08:37,114 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 11:08:37,114 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 11:08:37,114 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 11:08:37,114 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 11:08:37,115 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 11:08:37,116 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 11:08:37,117 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 466) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 11:08:37,118 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a28~0 10)) (.cse1 (= ~a19~0 1)) (.cse5 (= ~a28~0 7)) (.cse2 (= ~a25~0 1)) (.cse6 (not (= ~a11~0 1))) (.cse3 (<= ~a17~0 8)) (.cse4 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3) (and .cse0 .cse3) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2) (and .cse6 .cse3 (not (= ~a28~0 9)) .cse4))) [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 11:08:37,119 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a28~0 10)) (.cse1 (= ~a19~0 1)) (.cse5 (= ~a28~0 7)) (.cse2 (= ~a25~0 1)) (.cse6 (not (= ~a11~0 1))) (.cse3 (<= ~a17~0 8)) (.cse4 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3) (and .cse0 .cse3) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2) (and .cse6 .cse3 (not (= ~a28~0 9)) .cse4))) [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 11:08:37,120 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 11:08:37,121 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 11:08:37,122 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 11:08:37,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:08:37 BoogieIcfgContainer [2019-12-07 11:08:37,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:08:37,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:08:37,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:08:37,140 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:08:37,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:33" (3/4) ... [2019-12-07 11:08:37,144 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:08:37,161 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 11:08:37,163 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 11:08:37,164 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 11:08:37,165 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:08:37,265 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_236b061e-2b53-4c96-a3e8-7b5ac850977d/bin/utaipan/witness.graphml [2019-12-07 11:08:37,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:08:37,267 INFO L168 Benchmark]: Toolchain (without parser) took 5780.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.3 MB). Peak memory consumption was 119.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,267 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:08:37,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 1.1 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-12-07 11:08:37,268 INFO L168 Benchmark]: Boogie Preprocessor took 48.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,268 INFO L168 Benchmark]: RCFGBuilder took 1197.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.9 MB). Peak memory consumption was 231.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,268 INFO L168 Benchmark]: TraceAbstraction took 3955.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.4 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,268 INFO L168 Benchmark]: Witness Printer took 125.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:37,270 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 1.1 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 48.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1197.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.9 MB). Peak memory consumption was 231.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3955.00 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.4 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. * Witness Printer took 125.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: 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: (((((((a28 == 10 && a19 == 1) || ((a25 == 1 && a17 <= 8) && !(a28 == 11))) || (a28 == 7 && a17 <= 8)) || (a28 == 10 && a17 <= 8)) || (((a19 == 1 && a25 == 1) && a17 <= 8) && !(a11 == 1))) || ((a19 == 1 && a17 <= 8) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && !(a11 == 1)) && a25 == 1)) || (((!(a11 == 1) && a17 <= 8) && !(a28 == 9)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((a28 == 10 && a19 == 1) || ((a25 == 1 && a17 <= 8) && !(a28 == 11))) || (a28 == 7 && a17 <= 8)) || (a28 == 10 && a17 <= 8)) || (((a19 == 1 && a25 == 1) && a17 <= 8) && !(a11 == 1))) || ((a19 == 1 && a17 <= 8) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && !(a11 == 1)) && a25 == 1)) || (((!(a11 == 1) && a17 <= 8) && !(a28 == 9)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 574 SDtfs, 876 SDslu, 56 SDs, 0 SdLazy, 2383 SolverSat, 647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1763occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 882 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 552 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 264 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 330668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 662/670 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...