./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/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 6a0edfd90480f917557019c272eaa2ec2221428a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:19:04,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:19:04,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:19:04,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:19:04,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:19:04,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:19:04,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:19:04,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:19:04,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:19:04,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:19:04,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:19:04,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:19:04,918 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:19:04,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:19:04,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:19:04,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:19:04,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:19:04,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:19:04,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:19:04,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:19:04,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:19:04,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:19:04,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:19:04,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:19:04,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:19:04,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:19:04,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:19:04,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:19:04,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:19:04,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:19:04,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:19:04,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:19:04,928 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:19:04,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:19:04,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:19:04,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:19:04,929 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 02:19:04,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:19:04,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:19:04,937 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:19:04,937 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:19:04,937 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:19:04,938 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:19:04,938 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:19:04,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:19:04,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:19:04,939 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:19:04,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:19:04,940 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/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 -> 6a0edfd90480f917557019c272eaa2ec2221428a [2018-12-02 02:19:04,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:19:04,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:19:04,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:19:04,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:19:04,970 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:19:04,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-12-02 02:19:05,014 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/data/996f61c72/9de5e6b0d4b24aa48eba7740a98d4aec/FLAG75d4d3340 [2018-12-02 02:19:05,403 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:19:05,403 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/sv-benchmarks/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-12-02 02:19:05,406 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/data/996f61c72/9de5e6b0d4b24aa48eba7740a98d4aec/FLAG75d4d3340 [2018-12-02 02:19:05,415 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/data/996f61c72/9de5e6b0d4b24aa48eba7740a98d4aec [2018-12-02 02:19:05,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:19:05,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:19:05,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:19:05,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:19:05,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:19:05,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ff7dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05, skipping insertion in model container [2018-12-02 02:19:05,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:19:05,436 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:19:05,518 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:19:05,521 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:19:05,529 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:19:05,537 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:19:05,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05 WrapperNode [2018-12-02 02:19:05,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:19:05,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:19:05,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:19:05,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:19:05,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:19:05,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:19:05,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:19:05,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:19:05,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... [2018-12-02 02:19:05,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:19:05,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:19:05,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:19:05,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:19:05,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/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 [2018-12-02 02:19:05,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:19:05,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:19:05,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:19:05,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:19:05,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:19:05,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:19:05,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 02:19:05,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 02:19:05,711 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:19:05,712 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 02:19:05,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:19:05 BoogieIcfgContainer [2018-12-02 02:19:05,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:19:05,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:19:05,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:19:05,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:19:05,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:19:05" (1/3) ... [2018-12-02 02:19:05,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f4a558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:19:05, skipping insertion in model container [2018-12-02 02:19:05,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:19:05" (2/3) ... [2018-12-02 02:19:05,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f4a558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:19:05, skipping insertion in model container [2018-12-02 02:19:05,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:19:05" (3/3) ... [2018-12-02 02:19:05,716 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-12-02 02:19:05,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:19:05,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:19:05,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:19:05,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:19:05,750 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:19:05,751 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:19:05,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:19:05,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:19:05,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:19:05,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:19:05,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:19:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-02 02:19:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:19:05,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:05,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:05,765 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:05,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-12-02 02:19:05,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:05,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:05,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:05,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:05,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:05,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:19:05,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:19:05,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:19:05,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:19:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:19:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:19:05,876 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-02 02:19:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:05,893 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-12-02 02:19:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:19:05,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:19:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:05,899 INFO L225 Difference]: With dead ends: 29 [2018-12-02 02:19:05,899 INFO L226 Difference]: Without dead ends: 12 [2018-12-02 02:19:05,901 INFO L631 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 [2018-12-02 02:19:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-02 02:19:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 02:19:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 02:19:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-02 02:19:05,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-02 02:19:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:05,921 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-02 02:19:05,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:19:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-02 02:19:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 02:19:05,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:05,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:05,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:05,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-12-02 02:19:05,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:05,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:05,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:05,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:05,975 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-02 02:19:05,976 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2018-12-02 02:19:05,994 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:19:05,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:19:06,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:19:06,090 INFO L272 AbstractInterpreter]: Visited 11 different actions 17 times. Merged at 1 different actions 3 times. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 12. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 2 fixpoints after 2 different actions. Largest state had 3 variables. [2018-12-02 02:19:06,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:19:06,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:06,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:06,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:19:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:19:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:19:06,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 02:19:06,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:19:06,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:19:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:19:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:19:06,182 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-12-02 02:19:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:06,192 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-02 02:19:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:19:06,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-02 02:19:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:06,193 INFO L225 Difference]: With dead ends: 18 [2018-12-02 02:19:06,193 INFO L226 Difference]: Without dead ends: 13 [2018-12-02 02:19:06,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:19:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-02 02:19:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 02:19:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 02:19:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-02 02:19:06,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-02 02:19:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:06,197 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-02 02:19:06,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:19:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-02 02:19:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 02:19:06,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:06,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:06,198 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:06,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-12-02 02:19:06,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:06,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:19:06,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:19:06,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:06,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:19:06,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:19:06,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 02:19:06,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:19:06,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:19:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:19:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 02:19:06,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:19:06,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:19:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:19:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:19:06,322 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-12-02 02:19:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:06,335 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-02 02:19:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:19:06,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-02 02:19:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:06,335 INFO L225 Difference]: With dead ends: 19 [2018-12-02 02:19:06,336 INFO L226 Difference]: Without dead ends: 14 [2018-12-02 02:19:06,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:19:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-02 02:19:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-02 02:19:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 02:19:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-02 02:19:06,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-02 02:19:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:06,338 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-02 02:19:06,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:19:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-02 02:19:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:19:06,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:06,338 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:06,339 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:06,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-12-02 02:19:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:06,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:19:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:06,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:19:06,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:19:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 02:19:06,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 02:19:06,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 02:19:06,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:19:06,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:19:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:19:06,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 02:19:06,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:19:06,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:19:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:19:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:19:06,461 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-12-02 02:19:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:06,476 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-02 02:19:06,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:19:06,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-02 02:19:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:06,476 INFO L225 Difference]: With dead ends: 20 [2018-12-02 02:19:06,476 INFO L226 Difference]: Without dead ends: 15 [2018-12-02 02:19:06,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:19:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-02 02:19:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 02:19:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 02:19:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-02 02:19:06,478 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-02 02:19:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:06,479 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-02 02:19:06,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:19:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-02 02:19:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:19:06,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:06,479 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:06,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:06,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-12-02 02:19:06,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:19:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:06,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:19:06,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:19:06,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:06,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:06,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:19:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:19:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:19:06,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 02:19:06,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:19:06,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:19:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:19:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:19:06,615 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-12-02 02:19:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:06,635 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-02 02:19:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:19:06,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-02 02:19:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:06,636 INFO L225 Difference]: With dead ends: 21 [2018-12-02 02:19:06,636 INFO L226 Difference]: Without dead ends: 16 [2018-12-02 02:19:06,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:19:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-02 02:19:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 02:19:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 02:19:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-02 02:19:06,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-02 02:19:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:06,639 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-02 02:19:06,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:19:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-02 02:19:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 02:19:06,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:06,640 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:06,640 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:06,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-12-02 02:19:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:19:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:06,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:19:06,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:19:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:06,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:06,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:19:06,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:19:06,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 02:19:06,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:19:06,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:19:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:06,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:19:06,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 02:19:06,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:19:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:19:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:19:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:19:06,804 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-12-02 02:19:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:19:06,831 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-02 02:19:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:19:06,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-02 02:19:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:19:06,832 INFO L225 Difference]: With dead ends: 22 [2018-12-02 02:19:06,832 INFO L226 Difference]: Without dead ends: 17 [2018-12-02 02:19:06,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:19:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-02 02:19:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 02:19:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 02:19:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-02 02:19:06,835 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-02 02:19:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:19:06,836 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-02 02:19:06,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:19:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-02 02:19:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 02:19:06,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:19:06,836 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:19:06,837 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:19:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:19:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-12-02 02:19:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:19:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:19:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:19:06,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:19:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:19:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:13,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:13,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:19:13,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:19:13,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:19:13,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:19:13,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:19:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 02:19:13,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 02:19:13,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 02:19:13,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:19:13,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:19:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:19:13,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:20:40,310 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 02:21:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:21:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2018-12-02 02:21:32,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:21:32,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:21:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:21:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=479, Unknown=59, NotChecked=0, Total=650 [2018-12-02 02:21:32,741 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2018-12-02 02:21:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:32,874 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-02 02:21:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:21:32,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-12-02 02:21:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:32,875 INFO L225 Difference]: With dead ends: 27 [2018-12-02 02:21:32,875 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 02:21:32,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 145.8s TimeCoverageRelationStatistics Valid=123, Invalid=574, Unknown=59, NotChecked=0, Total=756 [2018-12-02 02:21:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 02:21:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 02:21:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 02:21:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-02 02:21:32,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-02 02:21:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-02 02:21:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:21:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-02 02:21:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:21:32,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:32,880 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:32,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:21:32,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2018-12-02 02:21:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:21:32,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:32,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:21:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:32,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:21:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:21:32,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:32,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:21:32,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:21:32,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:21:32,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:32,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:32,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:32,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:21:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:32,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:21:32,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:21:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:21:33,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:21:33,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 02:21:33,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:21:33,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:21:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:21:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:21:33,077 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-12-02 02:21:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:33,100 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-02 02:21:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:21:33,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-02 02:21:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:33,101 INFO L225 Difference]: With dead ends: 19 [2018-12-02 02:21:33,101 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:21:33,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:21:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:21:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:21:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:21:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:21:33,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-02 02:21:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:33,102 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:21:33,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:21:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:21:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:21:33,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 02:21:33,159 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 02:21:33,159 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (and (<= main_~x~0 1) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 2 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 1 main_~x~0)) (and (<= main_~x~0 6) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 64 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 6 main_~x~0)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 16 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 4 main_~x~0) (<= main_~x~0 4)) (and (<= main_~x~0 3) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 8 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 3 main_~x~0)) (and (<= 5 main_~x~0) (exists ((v_main_~y~0_26 Int)) (and (= main_~y~0 (* 32 v_main_~y~0_26)) (<= 1 v_main_~y~0_26) (<= v_main_~y~0_26 1))) (<= main_~x~0 5)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 4 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 2 main_~x~0) (<= main_~x~0 2))) [2018-12-02 02:21:33,159 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (<= (let ((.cse0 (div main_~y~0 4294967296))) (+ (* 12297829383904690176 .cse0) (* 8589934592 (div (+ main_~y~0 (* (- 4294967296) .cse0)) 3)) 2863311552)) (* 2863311531 main_~y~0)) [2018-12-02 02:21:33,159 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-12-02 02:21:33,159 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-12-02 02:21:33,160 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-12-02 02:21:33,160 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-12-02 02:21:33,160 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-12-02 02:21:33,160 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-12-02 02:21:33,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:21:33 BoogieIcfgContainer [2018-12-02 02:21:33,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:21:33,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:21:33,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:21:33,172 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:21:33,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:19:05" (3/4) ... [2018-12-02 02:21:33,174 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:21:33,178 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:21:33,178 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:21:33,178 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 02:21:33,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 02:21:33,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 02:21:33,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:21:33,195 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x <= 1 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 2 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1)) && 1 <= x) || ((x <= 6 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 64 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 6 <= x)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 16 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1) && 4 <= x) && x <= 4)) || ((x <= 3 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 8 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 3 <= x)) || ((5 <= x && (\exists v_main_~y~0_26 : int :: (y == 32 * v_main_~y~0_26 && 1 <= v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && x <= 5)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 4 * v_main_~y~0_26) && v_main_~y~0_26 <= 1) && 2 <= x) && x <= 2) [2018-12-02 02:21:33,201 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b17d585f-d1d5-480b-818f-81ce79f64f84/bin-2019/utaipan/witness.graphml [2018-12-02 02:21:33,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:21:33,202 INFO L168 Benchmark]: Toolchain (without parser) took 147784.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:21:33,202 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:21:33,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 946.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:21:33,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:21:33,203 INFO L168 Benchmark]: Boogie Preprocessor took 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:21:33,203 INFO L168 Benchmark]: RCFGBuilder took 149.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:21:33,203 INFO L168 Benchmark]: TraceAbstraction took 147459.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -524.3 kB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2018-12-02 02:21:33,204 INFO L168 Benchmark]: Witness Printer took 29.36 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:21:33,205 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 946.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 147459.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -524.3 kB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * Witness Printer took 29.36 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant [2018-12-02 02:21:33,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-12-02 02:21:33,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] Derived loop invariant: (((((((x <= 1 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 2 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1)) && 1 <= x) || ((x <= 6 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 64 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 6 <= x)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 16 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1) && 4 <= x) && x <= 4)) || ((x <= 3 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 8 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 3 <= x)) || ((5 <= x && (\exists v_main_~y~0_26 : int :: (y == 32 * v_main_~y~0_26 && 1 <= v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && x <= 5)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 4 * v_main_~y~0_26) && v_main_~y~0_26 <= 1) && 2 <= x) && x <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 147.4s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 3 SDslu, 323 SDs, 0 SdLazy, 296 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 151 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 146.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 161 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 146.5s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 285 ConstructedInterpolants, 9 QuantifiedInterpolants, 16269 SizeOfPredicates, 7 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 45/276 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...