./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-new/nested-1.i --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_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-new/nested-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/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 a881e1073186594f4727f809fbe5d917ff145543 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:53:02,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:53:02,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:53:02,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:53:02,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:53:02,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:53:02,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:53:02,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:53:02,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:53:02,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:53:02,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:53:02,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:53:02,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:53:02,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:53:02,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:53:02,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:53:02,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:53:02,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:53:02,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:53:02,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:53:02,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:53:02,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:53:02,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:53:02,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:53:02,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:53:02,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:53:02,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:53:02,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:53:02,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:53:02,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:53:02,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:53:02,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:53:02,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:53:02,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:53:02,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:53:02,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:53:02,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:53:02,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:53:02,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:53:02,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:53:02,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:53:02,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:53:02,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:53:02,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:53:02,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:53:02,729 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:53:02,729 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:53:02,729 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:53:02,729 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:53:02,729 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:53:02,729 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:53:02,730 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:53:02,730 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:53:02,730 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:53:02,730 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:53:02,730 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:53:02,730 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:53:02,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:53:02,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:53:02,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:53:02,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:53:02,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:53:02,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:53:02,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:53:02,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:53:02,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:53:02,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:53:02,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:53:02,734 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:53:02,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:53:02,734 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_89d385fd-c440-49da-8db6-8004ccdc1368/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 -> a881e1073186594f4727f809fbe5d917ff145543 [2019-12-07 13:53:02,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:53:02,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:53:02,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:53:02,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:53:02,846 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:53:02,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/../../sv-benchmarks/c/loop-new/nested-1.i [2019-12-07 13:53:02,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/data/ed2fbbb97/19d9a5cdb3e949a59dd4c253116da747/FLAGc4f447c1a [2019-12-07 13:53:03,206 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:53:03,207 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/sv-benchmarks/c/loop-new/nested-1.i [2019-12-07 13:53:03,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/data/ed2fbbb97/19d9a5cdb3e949a59dd4c253116da747/FLAGc4f447c1a [2019-12-07 13:53:03,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/data/ed2fbbb97/19d9a5cdb3e949a59dd4c253116da747 [2019-12-07 13:53:03,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:53:03,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:53:03,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:03,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:53:03,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:53:03,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1f8437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03, skipping insertion in model container [2019-12-07 13:53:03,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:53:03,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:53:03,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:03,400 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:53:03,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:03,419 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:53:03,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03 WrapperNode [2019-12-07 13:53:03,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:03,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:03,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:53:03,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:53:03,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:03,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:53:03,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:53:03,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:53:03,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... [2019-12-07 13:53:03,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:53:03,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:53:03,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:53:03,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:53:03,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/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 13:53:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:53:03,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:53:03,625 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:53:03,625 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:53:03,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:03 BoogieIcfgContainer [2019-12-07 13:53:03,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:53:03,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:53:03,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:53:03,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:53:03,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:53:03" (1/3) ... [2019-12-07 13:53:03,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b3e39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:03, skipping insertion in model container [2019-12-07 13:53:03,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:03" (2/3) ... [2019-12-07 13:53:03,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b3e39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:03, skipping insertion in model container [2019-12-07 13:53:03,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:03" (3/3) ... [2019-12-07 13:53:03,633 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-1.i [2019-12-07 13:53:03,639 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:53:03,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:53:03,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:53:03,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:53:03,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:53:03,664 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:53:03,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:53:03,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:53:03,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:53:03,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:53:03,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:53:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-12-07 13:53:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:53:03,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:03,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:53:03,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 922057718, now seen corresponding path program 1 times [2019-12-07 13:53:03,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:03,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559160633] [2019-12-07 13:53:03,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:03,786 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 13:53:03,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559160633] [2019-12-07 13:53:03,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:03,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:53:03,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028593721] [2019-12-07 13:53:03,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:03,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:03,802 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-12-07 13:53:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:03,841 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-12-07 13:53:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:53:03,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:53:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:03,848 INFO L225 Difference]: With dead ends: 21 [2019-12-07 13:53:03,849 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 13:53:03,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 13:53:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-12-07 13:53:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 13:53:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-12-07 13:53:03,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-12-07 13:53:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:03,872 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 13:53:03,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-12-07 13:53:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:53:03,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:03,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:03,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1299572786, now seen corresponding path program 1 times [2019-12-07 13:53:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366599416] [2019-12-07 13:53:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:03,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366599416] [2019-12-07 13:53:03,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:03,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:53:03,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414423355] [2019-12-07 13:53:03,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:03,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:03,896 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-12-07 13:53:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:03,912 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-12-07 13:53:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:53:03,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 13:53:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:03,912 INFO L225 Difference]: With dead ends: 15 [2019-12-07 13:53:03,912 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 13:53:03,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 13:53:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 13:53:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 13:53:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-12-07 13:53:03,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-12-07 13:53:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:03,916 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-12-07 13:53:03,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-12-07 13:53:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:53:03,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:03,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:03,916 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1629236874, now seen corresponding path program 1 times [2019-12-07 13:53:03,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:03,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128221174] [2019-12-07 13:53:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:03,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128221174] [2019-12-07 13:53:03,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490809377] [2019-12-07 13:53:03,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/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 13:53:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:03,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:03,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:04,041 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:04,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238223098] [2019-12-07 13:53:04,084 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 13:53:04,085 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:04,088 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:04,092 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:04,093 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:04,320 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:04,505 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:04,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:04,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2019-12-07 13:53:04,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435630670] [2019-12-07 13:53:04,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:53:04,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:53:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:53:04,508 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 13 states. [2019-12-07 13:53:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:04,671 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-12-07 13:53:04,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:53:04,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-12-07 13:53:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:04,672 INFO L225 Difference]: With dead ends: 24 [2019-12-07 13:53:04,672 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 13:53:04,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:53:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 13:53:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-12-07 13:53:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 13:53:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-12-07 13:53:04,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2019-12-07 13:53:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:04,678 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 13:53:04,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:53:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-12-07 13:53:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:53:04,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:04,679 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:04,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:04,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:04,880 INFO L82 PathProgramCache]: Analyzing trace with hash 671137330, now seen corresponding path program 2 times [2019-12-07 13:53:04,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:04,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549536049] [2019-12-07 13:53:04,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:05,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549536049] [2019-12-07 13:53:05,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025286065] [2019-12-07 13:53:05,007 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:05,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 13:53:05,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:05,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:05,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:53:05,048 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:53:05,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2135405766] [2019-12-07 13:53:05,073 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 13:53:05,073 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:05,074 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:05,074 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:05,074 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:05,210 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:05,380 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:05,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:05,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2019-12-07 13:53:05,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782378624] [2019-12-07 13:53:05,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:53:05,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:53:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:53:05,382 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 15 states. [2019-12-07 13:53:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:05,536 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-12-07 13:53:05,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:53:05,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-12-07 13:53:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:05,538 INFO L225 Difference]: With dead ends: 41 [2019-12-07 13:53:05,538 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 13:53:05,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:53:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 13:53:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-12-07 13:53:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 13:53:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 13:53:05,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2019-12-07 13:53:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:05,547 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 13:53:05,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:53:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 13:53:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:53:05,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:05,548 INFO L410 BasicCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:05,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:05,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 308532966, now seen corresponding path program 3 times [2019-12-07 13:53:05,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:05,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597993690] [2019-12-07 13:53:05,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:06,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597993690] [2019-12-07 13:53:06,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622208899] [2019-12-07 13:53:06,125 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:06,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:53:06,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:06,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:53:06,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 13:53:06,266 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-12-07 13:53:06,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840346225] [2019-12-07 13:53:06,394 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 13:53:06,394 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:06,395 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:06,395 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:06,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:06,479 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:06,704 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:06,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:06,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 8] total 40 [2019-12-07 13:53:06,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157716199] [2019-12-07 13:53:06,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 13:53:06,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 13:53:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 13:53:06,706 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 40 states. [2019-12-07 13:53:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:07,351 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2019-12-07 13:53:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:53:07,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-07 13:53:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:07,352 INFO L225 Difference]: With dead ends: 77 [2019-12-07 13:53:07,352 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 13:53:07,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=629, Invalid=3927, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 13:53:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 13:53:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 13:53:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 13:53:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-12-07 13:53:07,361 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2019-12-07 13:53:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:07,362 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-12-07 13:53:07,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 13:53:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-12-07 13:53:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 13:53:07,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:07,363 INFO L410 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:07,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:07,564 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:07,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2081107174, now seen corresponding path program 4 times [2019-12-07 13:53:07,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:07,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212599555] [2019-12-07 13:53:07,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 13:53:07,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212599555] [2019-12-07 13:53:07,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230073550] [2019-12-07 13:53:07,653 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:07,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:53:07,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 13:53:07,731 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 13:53:07,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [557565644] [2019-12-07 13:53:07,779 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 13:53:07,779 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:07,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:07,779 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:07,779 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:07,857 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:07,970 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:07,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:07,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-12-07 13:53:07,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360052276] [2019-12-07 13:53:07,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 13:53:07,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:07,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 13:53:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:53:07,972 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 19 states. [2019-12-07 13:53:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:08,083 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-12-07 13:53:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:53:08,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-07 13:53:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:08,084 INFO L225 Difference]: With dead ends: 130 [2019-12-07 13:53:08,084 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 13:53:08,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:53:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 13:53:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-12-07 13:53:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 13:53:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-12-07 13:53:08,101 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 54 [2019-12-07 13:53:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:08,101 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-12-07 13:53:08,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 13:53:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-12-07 13:53:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 13:53:08,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:08,104 INFO L410 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:08,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:08,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:53:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 417098318, now seen corresponding path program 5 times [2019-12-07 13:53:08,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:08,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501810147] [2019-12-07 13:53:08,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 13:53:11,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501810147] [2019-12-07 13:53:11,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:11,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2019-12-07 13:53:11,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717239250] [2019-12-07 13:53:11,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-12-07 13:53:11,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-12-07 13:53:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 13:53:11,529 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 104 states. [2019-12-07 13:53:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:12,217 INFO L93 Difference]: Finished difference Result 5122 states and 5582 transitions. [2019-12-07 13:53:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-12-07 13:53:12,218 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 126 [2019-12-07 13:53:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:12,218 INFO L225 Difference]: With dead ends: 5122 [2019-12-07 13:53:12,218 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:53:12,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2019-12-07 13:53:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:53:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:53:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:53:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:53:12,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2019-12-07 13:53:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:12,229 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:53:12,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-12-07 13:53:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:53:12,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:53:12,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:53:43,900 WARN L192 SmtUtils]: Spent 31.65 s on a formula simplification. DAG size of input: 4951 DAG size of output: 1196 [2019-12-07 13:53:44,808 WARN L192 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 684 DAG size of output: 641 [2019-12-07 13:54:04,109 WARN L192 SmtUtils]: Spent 19.29 s on a formula simplification. DAG size of input: 1187 DAG size of output: 348 [2019-12-07 13:54:07,906 WARN L192 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 640 DAG size of output: 58 [2019-12-07 13:54:07,909 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:54:07,909 INFO L249 CegarLoopResult]: At program point L23(lines 10 24) the Hoare annotation is: true [2019-12-07 13:54:07,909 INFO L246 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2019-12-07 13:54:07,909 INFO L242 CegarLoopResult]: At program point L17-3(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~0)) (.cse1 (<= 10 ULTIMATE.start_main_~m~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1) (and .cse0 (<= 10 ULTIMATE.start_main_~k~0) .cse1 (<= ULTIMATE.start_main_~i~0 1)) (and (<= 40 ULTIMATE.start_main_~k~0) .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 4)) (and .cse0 .cse1 (<= 90 ULTIMATE.start_main_~k~0) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0)) (and (<= ULTIMATE.start_main_~i~0 2) .cse0 (<= 20 ULTIMATE.start_main_~k~0) .cse1) (and .cse0 .cse1 (<= 80 ULTIMATE.start_main_~k~0) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (and .cse0 .cse1 (<= 50 ULTIMATE.start_main_~k~0) (< (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~n~0)) (and .cse0 (<= 70 ULTIMATE.start_main_~k~0) .cse1 (< (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~n~0)) (and .cse0 .cse1 (<= 100 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 3) (<= 30 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 60 ULTIMATE.start_main_~k~0) (< (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)))) [2019-12-07 13:54:07,909 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 13:54:07,910 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:54:07,910 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 13:54:07,910 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-12-07 13:54:07,911 INFO L242 CegarLoopResult]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse14 (<= 30 ULTIMATE.start_main_~k~0)) (.cse17 (<= 40 ULTIMATE.start_main_~k~0)) (.cse6 (<= ULTIMATE.start_main_~j~0 4)) (.cse4 (<= ULTIMATE.start_main_~i~0 0)) (.cse26 (<= 10 ULTIMATE.start_main_~k~0)) (.cse9 (< (+ ULTIMATE.start_main_~j~0 2) ULTIMATE.start_main_~m~0)) (.cse30 (<= 70 ULTIMATE.start_main_~k~0)) (.cse13 (<= ULTIMATE.start_main_~i~0 3)) (.cse7 (<= ULTIMATE.start_main_~i~0 4)) (.cse25 (<= 60 ULTIMATE.start_main_~k~0)) (.cse16 (<= ULTIMATE.start_main_~j~0 2)) (.cse3 (<= ULTIMATE.start_main_~j~0 3)) (.cse27 (<= 80 ULTIMATE.start_main_~k~0)) (.cse11 (<= ULTIMATE.start_main_~j~0 1)) (.cse24 (<= 50 ULTIMATE.start_main_~k~0)) (.cse23 (< (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~n~0)) (.cse8 (< (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~n~0)) (.cse21 (< (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)) (.cse12 (<= ULTIMATE.start_main_~j~0 0)) (.cse28 (<= 90 ULTIMATE.start_main_~k~0)) (.cse19 (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse5 (< (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~m~0)) (.cse22 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0)) (.cse29 (<= 20 ULTIMATE.start_main_~k~0)) (.cse20 (<= ULTIMATE.start_main_~i~0 1)) (.cse18 (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~m~0)) (.cse10 (< (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~n~0)) (.cse0 (<= ULTIMATE.start_main_~i~0 2)) (.cse1 (<= 10 ULTIMATE.start_main_~n~0)) (.cse15 (< (+ ULTIMATE.start_main_~j~0 3) ULTIMATE.start_main_~m~0)) (.cse2 (<= 10 ULTIMATE.start_main_~m~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 23 ULTIMATE.start_main_~k~0)) (and .cse4 .cse1 (<= 5 ULTIMATE.start_main_~k~0) .cse2 .cse5) (and (<= 44 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse6 .cse7) (and .cse1 .cse2 .cse3 (<= 63 ULTIMATE.start_main_~k~0) .cse8) (and .cse4 .cse1 .cse9 .cse2 (<= 7 ULTIMATE.start_main_~k~0)) (and .cse1 .cse2 (<= 74 ULTIMATE.start_main_~k~0) .cse10 .cse6) (and .cse0 (<= 21 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse11) (and .cse1 .cse2 .cse12 .cse13 .cse14) (and .cse1 .cse15 .cse2 (<= 66 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse1 .cse2 .cse14) (and (<= 42 ULTIMATE.start_main_~k~0) .cse16 .cse1 .cse2 .cse7) (and .cse4 .cse1 (<= 1 ULTIMATE.start_main_~k~0) .cse2 .cse11) (and .cse17 .cse1 .cse2 .cse13) (and .cse1 .cse2 .cse18 .cse19 (<= 89 ULTIMATE.start_main_~k~0)) (and (<= 37 ULTIMATE.start_main_~k~0) .cse1 .cse9 .cse2 .cse13) (and (<= 19 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse18 .cse20) (and .cse4 .cse1 .cse2 (<= 8 ULTIMATE.start_main_~k~0) .cse21) (and (<= 49 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse18 .cse7) (and .cse1 .cse9 (<= 77 ULTIMATE.start_main_~k~0) .cse2 .cse10) (and .cse1 .cse15 .cse2 (<= 46 ULTIMATE.start_main_~k~0) .cse7) (and .cse1 .cse2 (<= 100 ULTIMATE.start_main_~k~0) .cse22) (and (<= 35 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse13 .cse5) (and (<= 97 ULTIMATE.start_main_~k~0) .cse1 .cse9 .cse2 .cse22) (and .cse16 .cse1 .cse2 (<= 52 ULTIMATE.start_main_~k~0) .cse23) (and .cse1 .cse2 .cse23 (<= 55 ULTIMATE.start_main_~k~0) .cse5) (and .cse1 .cse2 .cse23 (<= 58 ULTIMATE.start_main_~k~0) .cse21) (and .cse0 .cse1 .cse2 (<= 25 ULTIMATE.start_main_~k~0) .cse5) (and .cse1 .cse2 .cse24 .cse7) (and .cse0 .cse1 .cse2 .cse6 (<= 24 ULTIMATE.start_main_~k~0)) (and .cse16 .cse1 .cse2 (<= 32 ULTIMATE.start_main_~k~0) .cse13) (and .cse4 .cse1 .cse2 .cse18 (<= 9 ULTIMATE.start_main_~k~0)) (and .cse1 .cse9 .cse2 (<= 87 ULTIMATE.start_main_~k~0) .cse19) (and .cse1 .cse2 .cse6 .cse22 (<= 94 ULTIMATE.start_main_~k~0)) (and .cse1 .cse2 .cse20 (<= 14 ULTIMATE.start_main_~k~0) .cse6) (and .cse4 (<= 2 ULTIMATE.start_main_~k~0) .cse16 .cse1 .cse2) (and .cse17 .cse1 .cse2 .cse12 .cse7) (and .cse1 .cse2 (<= 48 ULTIMATE.start_main_~k~0) .cse21 .cse7) (and .cse1 .cse2 .cse12 .cse25 .cse8) (and .cse1 .cse15 .cse2 (<= 56 ULTIMATE.start_main_~k~0) .cse23) (and .cse1 .cse2 (<= 95 ULTIMATE.start_main_~k~0) .cse22 .cse5) (and .cse1 .cse2 .cse13 (<= 34 ULTIMATE.start_main_~k~0) .cse6) (and (<= 47 ULTIMATE.start_main_~k~0) .cse1 .cse9 .cse2 .cse7) (and .cse4 .cse1 .cse2 .cse6 (<= 4 ULTIMATE.start_main_~k~0)) (and .cse4 .cse1 .cse15 (<= 6 ULTIMATE.start_main_~k~0) .cse2) (and .cse1 (<= 51 ULTIMATE.start_main_~k~0) .cse2 .cse11 .cse23) (and .cse16 .cse1 .cse2 (<= 62 ULTIMATE.start_main_~k~0) .cse8) (and .cse1 .cse26 .cse2 .cse12 .cse20) (and .cse4 .cse1 .cse2 .cse3 (<= 3 ULTIMATE.start_main_~k~0)) (and .cse1 .cse2 .cse11 (<= 41 ULTIMATE.start_main_~k~0) .cse7) (and .cse0 .cse1 (<= 29 ULTIMATE.start_main_~k~0) .cse2 .cse18) (and (<= 33 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse13 .cse3) (and .cse1 .cse2 .cse27 .cse10) (and .cse1 .cse2 .cse19 (<= 88 ULTIMATE.start_main_~k~0) .cse21) (and .cse1 .cse2 (<= 84 ULTIMATE.start_main_~k~0) .cse19 .cse6) (and (<= 92 ULTIMATE.start_main_~k~0) .cse16 .cse1 .cse2 .cse22) (and .cse1 .cse2 .cse19 .cse28) (and .cse1 .cse2 (<= 11 ULTIMATE.start_main_~k~0) .cse11 .cse20) (and .cse1 (<= 59 ULTIMATE.start_main_~k~0) .cse2 .cse18 .cse23) (and .cse1 .cse9 .cse2 (<= 67 ULTIMATE.start_main_~k~0) .cse8) (and .cse1 .cse2 (<= 64 ULTIMATE.start_main_~k~0) .cse8 .cse6) (and .cse1 .cse2 (<= 43 ULTIMATE.start_main_~k~0) .cse3 .cse7) (and .cse0 .cse1 .cse29 .cse2 .cse12) (and .cse1 .cse2 .cse11 (<= 81 ULTIMATE.start_main_~k~0) .cse19) (and .cse1 .cse15 .cse2 .cse20 (<= 16 ULTIMATE.start_main_~k~0)) (and .cse1 .cse30 .cse2 .cse8) (and .cse1 .cse15 .cse2 .cse13 (<= 36 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 27 ULTIMATE.start_main_~k~0) .cse9 .cse2) (and (<= 82 ULTIMATE.start_main_~k~0) .cse16 .cse1 .cse2 .cse19) (and .cse1 .cse15 (<= 96 ULTIMATE.start_main_~k~0) .cse2 .cse22) (and .cse1 .cse2 .cse13 .cse11 (<= 31 ULTIMATE.start_main_~k~0)) (and .cse1 .cse9 (<= 17 ULTIMATE.start_main_~k~0) .cse2 .cse20) (and .cse1 (<= 54 ULTIMATE.start_main_~k~0) .cse2 .cse23 .cse6) (and .cse1 .cse2 .cse3 .cse10 (<= 73 ULTIMATE.start_main_~k~0)) (and .cse4 (<= 0 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse12) (and .cse1 .cse2 .cse11 .cse10 (<= 71 ULTIMATE.start_main_~k~0)) (and .cse1 (<= 38 ULTIMATE.start_main_~k~0) .cse2 .cse13 .cse21) (and .cse4 .cse1 .cse2 .cse26) (and .cse1 .cse2 (<= 18 ULTIMATE.start_main_~k~0) .cse20 .cse21) (and .cse1 .cse2 (<= 15 ULTIMATE.start_main_~k~0) .cse20 .cse5) (and .cse1 .cse9 .cse2 (<= 57 ULTIMATE.start_main_~k~0) .cse23) (and .cse1 .cse30 .cse2 .cse12 .cse10) (and .cse1 (<= 93 ULTIMATE.start_main_~k~0) .cse2 .cse3 .cse22) (and (<= 69 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse18 .cse8) (and .cse1 .cse2 (<= 68 ULTIMATE.start_main_~k~0) .cse8 .cse21) (and .cse1 (<= 78 ULTIMATE.start_main_~k~0) .cse2 .cse10 .cse21) (and .cse0 .cse16 .cse1 .cse2 (<= 22 ULTIMATE.start_main_~k~0)) (and .cse1 (<= 39 ULTIMATE.start_main_~k~0) .cse2 .cse18 .cse13) (and .cse1 .cse2 (<= 45 ULTIMATE.start_main_~k~0) .cse5 .cse7) (and (<= 72 ULTIMATE.start_main_~k~0) .cse16 .cse1 .cse2 .cse10) (and (<= 76 ULTIMATE.start_main_~k~0) .cse1 .cse15 .cse2 .cse10) (and (<= 53 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse3 .cse23) (and .cse1 .cse15 .cse2 .cse19 (<= 86 ULTIMATE.start_main_~k~0)) (and .cse1 .cse2 .cse11 (<= 91 ULTIMATE.start_main_~k~0) .cse22) (and .cse1 .cse2 .cse25 .cse23) (and (<= 13 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse3 .cse20) (and .cse16 .cse1 .cse2 .cse20 (<= 12 ULTIMATE.start_main_~k~0)) (and .cse1 (<= 83 ULTIMATE.start_main_~k~0) .cse2 .cse3 .cse19) (and .cse1 .cse2 .cse10 (<= 75 ULTIMATE.start_main_~k~0) .cse5) (and .cse0 .cse1 (<= 28 ULTIMATE.start_main_~k~0) .cse2 .cse21) (and .cse1 .cse2 .cse12 .cse27 .cse19) (and .cse1 .cse2 .cse11 (<= 61 ULTIMATE.start_main_~k~0) .cse8) (and .cse1 .cse2 .cse12 .cse24 .cse23) (and .cse1 .cse2 (<= 65 ULTIMATE.start_main_~k~0) .cse8 .cse5) (and .cse1 .cse2 (<= 98 ULTIMATE.start_main_~k~0) .cse22 .cse21) (and .cse1 .cse2 .cse12 .cse28 .cse22) (and (<= 85 ULTIMATE.start_main_~k~0) .cse1 .cse2 .cse19 .cse5) (and .cse1 (<= 99 ULTIMATE.start_main_~k~0) .cse2 .cse18 .cse22) (and .cse1 .cse29 .cse2 .cse20) (and .cse1 (<= 79 ULTIMATE.start_main_~k~0) .cse2 .cse18 .cse10) (and .cse0 (<= 26 ULTIMATE.start_main_~k~0) .cse1 .cse15 .cse2))) [2019-12-07 13:54:07,911 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-12-07 13:54:07,911 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~n~0) [2019-12-07 13:54:07,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:54:07 BoogieIcfgContainer [2019-12-07 13:54:07,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:54:07,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:54:07,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:54:07,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:54:07,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:03" (3/4) ... [2019-12-07 13:54:07,956 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:54:07,962 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 13:54:07,963 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 13:54:07,998 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_89d385fd-c440-49da-8db6-8004ccdc1368/bin/utaipan/witness.graphml [2019-12-07 13:54:07,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:54:07,999 INFO L168 Benchmark]: Toolchain (without parser) took 64777.86 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 942.3 MB in the beginning and 1.2 GB in the end (delta: -286.3 MB). Peak memory consumption was 763.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:07,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:54:08,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:08,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:54:08,001 INFO L168 Benchmark]: Boogie Preprocessor took 12.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:54:08,001 INFO L168 Benchmark]: RCFGBuilder took 172.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:08,001 INFO L168 Benchmark]: TraceAbstraction took 64325.78 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 924.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:54:08,002 INFO L168 Benchmark]: Witness Printer took 44.98 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:08,003 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64325.78 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 924.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 44.98 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i <= 2 && 10 <= n) && 10 <= m) && j <= 3) && 23 <= k) || ((((i <= 0 && 10 <= n) && 5 <= k) && 10 <= m) && j + 4 < m)) || ((((44 <= k && 10 <= n) && 10 <= m) && j <= 4) && i <= 4)) || ((((10 <= n && 10 <= m) && j <= 3) && 63 <= k) && i + 3 < n)) || ((((i <= 0 && 10 <= n) && j + 2 < m) && 10 <= m) && 7 <= k)) || ((((10 <= n && 10 <= m) && 74 <= k) && i + 2 < n) && j <= 4)) || ((((i <= 2 && 21 <= k) && 10 <= n) && 10 <= m) && j <= 1)) || ((((10 <= n && 10 <= m) && j <= 0) && i <= 3) && 30 <= k)) || ((((10 <= n && j + 3 < m) && 10 <= m) && 66 <= k) && i + 3 < n)) || (((i <= 2 && 10 <= n) && 10 <= m) && 30 <= k)) || ((((42 <= k && j <= 2) && 10 <= n) && 10 <= m) && i <= 4)) || ((((i <= 0 && 10 <= n) && 1 <= k) && 10 <= m) && j <= 1)) || (((40 <= k && 10 <= n) && 10 <= m) && i <= 3)) || ((((10 <= n && 10 <= m) && j < m) && i + 1 < n) && 89 <= k)) || ((((37 <= k && 10 <= n) && j + 2 < m) && 10 <= m) && i <= 3)) || ((((19 <= k && 10 <= n) && 10 <= m) && j < m) && i <= 1)) || ((((i <= 0 && 10 <= n) && 10 <= m) && 8 <= k) && j + 1 < m)) || ((((49 <= k && 10 <= n) && 10 <= m) && j < m) && i <= 4)) || ((((10 <= n && j + 2 < m) && 77 <= k) && 10 <= m) && i + 2 < n)) || ((((10 <= n && j + 3 < m) && 10 <= m) && 46 <= k) && i <= 4)) || (((10 <= n && 10 <= m) && 100 <= k) && i < n)) || ((((35 <= k && 10 <= n) && 10 <= m) && i <= 3) && j + 4 < m)) || ((((97 <= k && 10 <= n) && j + 2 < m) && 10 <= m) && i < n)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 52 <= k) && i + 4 < n)) || ((((10 <= n && 10 <= m) && i + 4 < n) && 55 <= k) && j + 4 < m)) || ((((10 <= n && 10 <= m) && i + 4 < n) && 58 <= k) && j + 1 < m)) || ((((i <= 2 && 10 <= n) && 10 <= m) && 25 <= k) && j + 4 < m)) || (((10 <= n && 10 <= m) && 50 <= k) && i <= 4)) || ((((i <= 2 && 10 <= n) && 10 <= m) && j <= 4) && 24 <= k)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 32 <= k) && i <= 3)) || ((((i <= 0 && 10 <= n) && 10 <= m) && j < m) && 9 <= k)) || ((((10 <= n && j + 2 < m) && 10 <= m) && 87 <= k) && i + 1 < n)) || ((((10 <= n && 10 <= m) && j <= 4) && i < n) && 94 <= k)) || ((((10 <= n && 10 <= m) && i <= 1) && 14 <= k) && j <= 4)) || ((((i <= 0 && 2 <= k) && j <= 2) && 10 <= n) && 10 <= m)) || ((((40 <= k && 10 <= n) && 10 <= m) && j <= 0) && i <= 4)) || ((((10 <= n && 10 <= m) && 48 <= k) && j + 1 < m) && i <= 4)) || ((((10 <= n && 10 <= m) && j <= 0) && 60 <= k) && i + 3 < n)) || ((((10 <= n && j + 3 < m) && 10 <= m) && 56 <= k) && i + 4 < n)) || ((((10 <= n && 10 <= m) && 95 <= k) && i < n) && j + 4 < m)) || ((((10 <= n && 10 <= m) && i <= 3) && 34 <= k) && j <= 4)) || ((((47 <= k && 10 <= n) && j + 2 < m) && 10 <= m) && i <= 4)) || ((((i <= 0 && 10 <= n) && 10 <= m) && j <= 4) && 4 <= k)) || ((((i <= 0 && 10 <= n) && j + 3 < m) && 6 <= k) && 10 <= m)) || ((((10 <= n && 51 <= k) && 10 <= m) && j <= 1) && i + 4 < n)) || ((((j <= 2 && 10 <= n) && 10 <= m) && 62 <= k) && i + 3 < n)) || ((((10 <= n && 10 <= k) && 10 <= m) && j <= 0) && i <= 1)) || ((((i <= 0 && 10 <= n) && 10 <= m) && j <= 3) && 3 <= k)) || ((((10 <= n && 10 <= m) && j <= 1) && 41 <= k) && i <= 4)) || ((((i <= 2 && 10 <= n) && 29 <= k) && 10 <= m) && j < m)) || ((((33 <= k && 10 <= n) && 10 <= m) && i <= 3) && j <= 3)) || (((10 <= n && 10 <= m) && 80 <= k) && i + 2 < n)) || ((((10 <= n && 10 <= m) && i + 1 < n) && 88 <= k) && j + 1 < m)) || ((((10 <= n && 10 <= m) && 84 <= k) && i + 1 < n) && j <= 4)) || ((((92 <= k && j <= 2) && 10 <= n) && 10 <= m) && i < n)) || (((10 <= n && 10 <= m) && i + 1 < n) && 90 <= k)) || ((((10 <= n && 10 <= m) && 11 <= k) && j <= 1) && i <= 1)) || ((((10 <= n && 59 <= k) && 10 <= m) && j < m) && i + 4 < n)) || ((((10 <= n && j + 2 < m) && 10 <= m) && 67 <= k) && i + 3 < n)) || ((((10 <= n && 10 <= m) && 64 <= k) && i + 3 < n) && j <= 4)) || ((((10 <= n && 10 <= m) && 43 <= k) && j <= 3) && i <= 4)) || ((((i <= 2 && 10 <= n) && 20 <= k) && 10 <= m) && j <= 0)) || ((((10 <= n && 10 <= m) && j <= 1) && 81 <= k) && i + 1 < n)) || ((((10 <= n && j + 3 < m) && 10 <= m) && i <= 1) && 16 <= k)) || (((10 <= n && 70 <= k) && 10 <= m) && i + 3 < n)) || ((((10 <= n && j + 3 < m) && 10 <= m) && i <= 3) && 36 <= k)) || ((((i <= 2 && 10 <= n) && 27 <= k) && j + 2 < m) && 10 <= m)) || ((((82 <= k && j <= 2) && 10 <= n) && 10 <= m) && i + 1 < n)) || ((((10 <= n && j + 3 < m) && 96 <= k) && 10 <= m) && i < n)) || ((((10 <= n && 10 <= m) && i <= 3) && j <= 1) && 31 <= k)) || ((((10 <= n && j + 2 < m) && 17 <= k) && 10 <= m) && i <= 1)) || ((((10 <= n && 54 <= k) && 10 <= m) && i + 4 < n) && j <= 4)) || ((((10 <= n && 10 <= m) && j <= 3) && i + 2 < n) && 73 <= k)) || ((((i <= 0 && 0 <= k) && 10 <= n) && 10 <= m) && j <= 0)) || ((((10 <= n && 10 <= m) && j <= 1) && i + 2 < n) && 71 <= k)) || ((((10 <= n && 38 <= k) && 10 <= m) && i <= 3) && j + 1 < m)) || (((i <= 0 && 10 <= n) && 10 <= m) && 10 <= k)) || ((((10 <= n && 10 <= m) && 18 <= k) && i <= 1) && j + 1 < m)) || ((((10 <= n && 10 <= m) && 15 <= k) && i <= 1) && j + 4 < m)) || ((((10 <= n && j + 2 < m) && 10 <= m) && 57 <= k) && i + 4 < n)) || ((((10 <= n && 70 <= k) && 10 <= m) && j <= 0) && i + 2 < n)) || ((((10 <= n && 93 <= k) && 10 <= m) && j <= 3) && i < n)) || ((((69 <= k && 10 <= n) && 10 <= m) && j < m) && i + 3 < n)) || ((((10 <= n && 10 <= m) && 68 <= k) && i + 3 < n) && j + 1 < m)) || ((((10 <= n && 78 <= k) && 10 <= m) && i + 2 < n) && j + 1 < m)) || ((((i <= 2 && j <= 2) && 10 <= n) && 10 <= m) && 22 <= k)) || ((((10 <= n && 39 <= k) && 10 <= m) && j < m) && i <= 3)) || ((((10 <= n && 10 <= m) && 45 <= k) && j + 4 < m) && i <= 4)) || ((((72 <= k && j <= 2) && 10 <= n) && 10 <= m) && i + 2 < n)) || ((((76 <= k && 10 <= n) && j + 3 < m) && 10 <= m) && i + 2 < n)) || ((((53 <= k && 10 <= n) && 10 <= m) && j <= 3) && i + 4 < n)) || ((((10 <= n && j + 3 < m) && 10 <= m) && i + 1 < n) && 86 <= k)) || ((((10 <= n && 10 <= m) && j <= 1) && 91 <= k) && i < n)) || (((10 <= n && 10 <= m) && 60 <= k) && i + 4 < n)) || ((((13 <= k && 10 <= n) && 10 <= m) && j <= 3) && i <= 1)) || ((((j <= 2 && 10 <= n) && 10 <= m) && i <= 1) && 12 <= k)) || ((((10 <= n && 83 <= k) && 10 <= m) && j <= 3) && i + 1 < n)) || ((((10 <= n && 10 <= m) && i + 2 < n) && 75 <= k) && j + 4 < m)) || ((((i <= 2 && 10 <= n) && 28 <= k) && 10 <= m) && j + 1 < m)) || ((((10 <= n && 10 <= m) && j <= 0) && 80 <= k) && i + 1 < n)) || ((((10 <= n && 10 <= m) && j <= 1) && 61 <= k) && i + 3 < n)) || ((((10 <= n && 10 <= m) && j <= 0) && 50 <= k) && i + 4 < n)) || ((((10 <= n && 10 <= m) && 65 <= k) && i + 3 < n) && j + 4 < m)) || ((((10 <= n && 10 <= m) && 98 <= k) && i < n) && j + 1 < m)) || ((((10 <= n && 10 <= m) && j <= 0) && 90 <= k) && i < n)) || ((((85 <= k && 10 <= n) && 10 <= m) && i + 1 < n) && j + 4 < m)) || ((((10 <= n && 99 <= k) && 10 <= m) && j < m) && i < n)) || (((10 <= n && 20 <= k) && 10 <= m) && i <= 1)) || ((((10 <= n && 79 <= k) && 10 <= m) && j < m) && i + 2 < n)) || ((((i <= 2 && 26 <= k) && 10 <= n) && j + 3 < m) && 10 <= m) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 10 <= n - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((i <= 0 && 0 <= k) && 10 <= n) && 10 <= m) || (((10 <= n && 10 <= k) && 10 <= m) && i <= 1)) || (((40 <= k && 10 <= n) && 10 <= m) && i <= 4)) || (((10 <= n && 10 <= m) && 90 <= k) && i < n)) || (((i <= 2 && 10 <= n) && 20 <= k) && 10 <= m)) || (((10 <= n && 10 <= m) && 80 <= k) && i + 1 < n)) || (((10 <= n && 10 <= m) && 50 <= k) && i + 4 < n)) || (((10 <= n && 70 <= k) && 10 <= m) && i + 2 < n)) || ((10 <= n && 10 <= m) && 100 <= k)) || (((10 <= n && 10 <= m) && i <= 3) && 30 <= k)) || (((10 <= n && 10 <= m) && 60 <= k) && i + 3 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: SAFE, OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 100, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.6s, HoareTripleCheckerStatistics: 227 SDtfs, 434 SDslu, 491 SDs, 0 SdLazy, 668 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 5123 NumberOfFragments, 2052 HoareAnnotationTreeSize, 4 FomulaSimplifications, 392687 FormulaSimplificationTreeSizeReduction, 32.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 23368 FormulaSimplificationTreeSizeReductionInter, 23.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 350 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 104146 SizeOfPredicates, 12 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 7113/9558 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...