./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b7166d94206693c3f254a3c1de8d5825f8510fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:13:41,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:13:41,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:13:41,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:13:41,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:13:41,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:13:41,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:13:41,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:13:41,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:13:41,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:13:41,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:13:41,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:13:41,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:13:41,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:13:41,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:13:41,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:13:41,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:13:41,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:13:41,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:13:41,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:13:41,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:13:41,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:13:41,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:13:41,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:13:41,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:13:41,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:13:41,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:13:41,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:13:41,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:13:41,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:13:41,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:13:41,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:13:41,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:13:41,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:13:41,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:13:41,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:13:41,727 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 07:13:41,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:13:41,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:13:41,734 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:13:41,734 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:13:41,735 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:13:41,735 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:13:41,736 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:13:41,736 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:13:41,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:13:41,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:13:41,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:13:41,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:13:41,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:13:41,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:13:41,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:13:41,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:13:41,739 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:13:41,739 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_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2018-11-10 07:13:41,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:13:41,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:13:41,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:13:41,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:13:41,774 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:13:41,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-10 07:13:41,810 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/data/dab7865e2/cf0e5083ebf643a7913e2d84104e68e7/FLAG0ff66d0de [2018-11-10 07:13:42,200 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:13:42,201 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/sv-benchmarks/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-10 07:13:42,205 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/data/dab7865e2/cf0e5083ebf643a7913e2d84104e68e7/FLAG0ff66d0de [2018-11-10 07:13:42,214 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/data/dab7865e2/cf0e5083ebf643a7913e2d84104e68e7 [2018-11-10 07:13:42,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:13:42,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:13:42,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:13:42,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:13:42,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:13:42,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177ef697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42, skipping insertion in model container [2018-11-10 07:13:42,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:13:42,238 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:13:42,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:13:42,330 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:13:42,338 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:13:42,347 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:13:42,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42 WrapperNode [2018-11-10 07:13:42,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:13:42,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:13:42,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:13:42,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:13:42,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:13:42,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:13:42,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:13:42,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:13:42,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... [2018-11-10 07:13:42,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:13:42,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:13:42,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:13:42,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:13:42,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/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-11-10 07:13:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:13:42,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:13:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 07:13:42,449 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 07:13:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:13:42,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:13:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:13:42,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:13:42,566 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:13:42,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:42 BoogieIcfgContainer [2018-11-10 07:13:42,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:13:42,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:13:42,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:13:42,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:13:42,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:13:42" (1/3) ... [2018-11-10 07:13:42,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9ae5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:42, skipping insertion in model container [2018-11-10 07:13:42,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:42" (2/3) ... [2018-11-10 07:13:42,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9ae5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:42, skipping insertion in model container [2018-11-10 07:13:42,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:42" (3/3) ... [2018-11-10 07:13:42,573 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2018-11-10 07:13:42,581 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:13:42,588 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 07:13:42,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 07:13:42,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:13:42,628 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:13:42,628 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:13:42,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:13:42,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:13:42,628 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:13:42,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:13:42,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:13:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 07:13:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:13:42,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:42,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:42,650 INFO L424 AbstractCegarLoop]: === Iteration 1 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:42,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash -774276160, now seen corresponding path program 1 times [2018-11-10 07:13:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:42,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:42,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:42,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:13:42,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:42,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:13:42,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:13:42,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:13:42,800 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-10 07:13:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:42,907 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-10 07:13:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:13:42,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-10 07:13:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:42,916 INFO L225 Difference]: With dead ends: 46 [2018-11-10 07:13:42,916 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 07:13:42,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:13:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 07:13:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-10 07:13:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:13:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-10 07:13:42,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2018-11-10 07:13:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:42,947 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 07:13:42,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:13:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-10 07:13:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 07:13:42,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:42,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:42,948 INFO L424 AbstractCegarLoop]: === Iteration 2 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:42,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1767242855, now seen corresponding path program 1 times [2018-11-10 07:13:42,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:42,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:42,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:42,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:42,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:13:42,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:42,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:13:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:13:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:13:42,994 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 5 states. [2018-11-10 07:13:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,058 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-10 07:13:43,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:13:43,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 07:13:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,059 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:13:43,059 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 07:13:43,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:13:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 07:13:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-10 07:13:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 07:13:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-10 07:13:43,066 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 11 [2018-11-10 07:13:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,066 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-10 07:13:43,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:13:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-10 07:13:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:13:43,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,067 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,067 INFO L424 AbstractCegarLoop]: === Iteration 3 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -601436741, now seen corresponding path program 1 times [2018-11-10 07:13:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:43,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:43,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:43,128 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-10 07:13:43,130 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [8], [9], [22], [26], [30], [34], [35], [36], [38] [2018-11-10 07:13:43,162 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:43,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:43,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:43,256 INFO L272 AbstractInterpreter]: Visited 13 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-10 07:13:43,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,263 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:43,306 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 07:13:43,306 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:43,360 INFO L415 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-11-10 07:13:43,360 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2018-11-10 07:13:43,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:43,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:13:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:13:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:13:43,362 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 10 states. [2018-11-10 07:13:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,587 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-10 07:13:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:13:43,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-10 07:13:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,588 INFO L225 Difference]: With dead ends: 53 [2018-11-10 07:13:43,589 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 07:13:43,589 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:13:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 07:13:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-10 07:13:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 07:13:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-10 07:13:43,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2018-11-10 07:13:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,597 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-10 07:13:43,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:13:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-10 07:13:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:13:43,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,598 INFO L424 AbstractCegarLoop]: === Iteration 4 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1839303495, now seen corresponding path program 1 times [2018-11-10 07:13:43,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:43,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:43,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:13:43,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:43,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:13:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:13:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:13:43,632 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-10 07:13:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,645 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2018-11-10 07:13:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:13:43,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 07:13:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,647 INFO L225 Difference]: With dead ends: 63 [2018-11-10 07:13:43,647 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 07:13:43,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:13:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 07:13:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-10 07:13:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 07:13:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-10 07:13:43,654 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 18 [2018-11-10 07:13:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,654 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-10 07:13:43,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:13:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-10 07:13:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 07:13:43,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,654 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,655 INFO L424 AbstractCegarLoop]: === Iteration 5 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1183833542, now seen corresponding path program 1 times [2018-11-10 07:13:43,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:43,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:43,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:13:43,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:43,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:13:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:13:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:13:43,674 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-11-10 07:13:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,684 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-10 07:13:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:13:43,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 07:13:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,686 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:13:43,686 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 07:13:43,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:13:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 07:13:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-10 07:13:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 07:13:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-10 07:13:43,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 19 [2018-11-10 07:13:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,694 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-10 07:13:43,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:13:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-10 07:13:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:13:43,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,695 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,695 INFO L424 AbstractCegarLoop]: === Iteration 6 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1671679351, now seen corresponding path program 1 times [2018-11-10 07:13:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:43,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:43,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:13:43,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:43,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:13:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:13:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:13:43,723 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-11-10 07:13:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,856 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2018-11-10 07:13:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:13:43,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-10 07:13:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,857 INFO L225 Difference]: With dead ends: 83 [2018-11-10 07:13:43,857 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 07:13:43,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:13:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 07:13:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-11-10 07:13:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:13:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-10 07:13:43,868 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 23 [2018-11-10 07:13:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,868 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-10 07:13:43,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:13:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-10 07:13:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:13:43,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,869 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,869 INFO L424 AbstractCegarLoop]: === Iteration 7 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash -282452290, now seen corresponding path program 1 times [2018-11-10 07:13:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:43,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:43,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:13:43,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:43,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:13:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:13:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:13:43,897 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 6 states. [2018-11-10 07:13:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:43,946 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2018-11-10 07:13:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:13:43,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-10 07:13:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:43,948 INFO L225 Difference]: With dead ends: 98 [2018-11-10 07:13:43,948 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 07:13:43,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:13:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 07:13:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2018-11-10 07:13:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 07:13:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-10 07:13:43,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-11-10 07:13:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:43,955 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-10 07:13:43,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:13:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-10 07:13:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:13:43,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:43,956 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:43,956 INFO L424 AbstractCegarLoop]: === Iteration 8 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1947044292, now seen corresponding path program 2 times [2018-11-10 07:13:43,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:43,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:43,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:44,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:44,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:13:44,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:13:44,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:44,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/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-11-10 07:13:44,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:13:44,021 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:13:44,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 07:13:44,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:13:44,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:13:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:13:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:13:44,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 07:13:44,145 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:13:44,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:13:44,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:13:44,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:13:44,146 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-11-10 07:13:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:44,212 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 07:13:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:13:44,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-10 07:13:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:44,213 INFO L225 Difference]: With dead ends: 58 [2018-11-10 07:13:44,213 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 07:13:44,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:13:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 07:13:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-10 07:13:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 07:13:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-10 07:13:44,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2018-11-10 07:13:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:44,219 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-10 07:13:44,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:13:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-10 07:13:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:13:44,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:44,219 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:44,220 INFO L424 AbstractCegarLoop]: === Iteration 9 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:13:44,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 634524286, now seen corresponding path program 3 times [2018-11-10 07:13:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:44,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:13:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:44,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:44,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:44,280 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:13:44,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:13:44,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:44,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/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-11-10 07:13:44,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:13:44,291 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:13:44,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:13:44,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:13:44,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:13:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:13:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:13:44,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:13:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2018-11-10 07:13:44,388 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:13:44,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 07:13:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 07:13:44,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:13:44,389 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2018-11-10 07:13:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:44,516 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-10 07:13:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 07:13:44,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-11-10 07:13:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:44,517 INFO L225 Difference]: With dead ends: 59 [2018-11-10 07:13:44,517 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:13:44,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:13:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:13:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:13:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:13:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:13:44,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-10 07:13:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:44,518 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:13:44,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 07:13:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:13:44,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:13:44,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:13:44,755 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,755 INFO L425 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L421 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (or (= 1 g_~x) (not (= |g_#in~x| 1))) (or (let ((.cse0 (* 2 g_~x))) (and (<= .cse0 4294967294) (<= 2 .cse0))) (< (* 2 |g_#in~x|) 0) (< 2147483647 |g_#in~x|)) (not (= |g_#in~x| 0)) (or (and (<= 2 g_~x) (<= g_~x 2)) (not (= |g_#in~x| 2)))) [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L421 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (and (or (= 1 g_~x) (not (= |g_#in~x| 1))) (not (= |g_#in~x| 0)) (or (and (let ((.cse0 (* 2 g_~x))) (and (<= .cse0 4294967294) (<= 2 .cse0) (<= |g_#t~ret0| 1))) (<= 1 |g_#t~ret0|)) (< (* 2 |g_#in~x|) 0) (< 2147483647 |g_#in~x|)) (not (= |g_#in~x| 2))) [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2018-11-10 07:13:44,756 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:13:44,756 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:13:44,757 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:13:44,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:13:44,757 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 18 22) the Hoare annotation is: true [2018-11-10 07:13:44,757 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 18 22) no Hoare annotation was computed. [2018-11-10 07:13:44,757 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 18 22) no Hoare annotation was computed. [2018-11-10 07:13:44,757 INFO L421 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= (* 2 main_~x~0) 4294967294) (<= 0 main_~x~0)) [2018-11-10 07:13:44,757 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 07:13:44,757 INFO L425 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-10 07:13:44,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:13:44 BoogieIcfgContainer [2018-11-10 07:13:44,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:13:44,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:13:44,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:13:44,760 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:13:44,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:42" (3/4) ... [2018-11-10 07:13:44,763 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:13:44,768 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:13:44,768 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 07:13:44,768 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:13:44,771 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 07:13:44,771 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:13:44,771 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:13:44,799 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a546a30f-ae7f-46a7-aab2-b4b0547c3e5d/bin-2019/utaipan/witness.graphml [2018-11-10 07:13:44,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:13:44,800 INFO L168 Benchmark]: Toolchain (without parser) took 2583.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -76.5 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:44,801 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:13:44,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:44,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.24 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:13:44,801 INFO L168 Benchmark]: Boogie Preprocessor took 10.05 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:13:44,801 INFO L168 Benchmark]: RCFGBuilder took 197.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:44,802 INFO L168 Benchmark]: TraceAbstraction took 2192.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:44,802 INFO L168 Benchmark]: Witness Printer took 39.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:44,804 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.24 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.05 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2192.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. * Witness Printer took 39.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 4 error locations. SAFE Result, 2.1s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 215 SDslu, 553 SDs, 0 SdLazy, 447 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 200 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8666666666666667 AbsIntWeakeningRatio, 0.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 2.8 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 62 PreInvPairs, 65 NumberOfFragments, 107 HoareAnnotationTreeSize, 62 FomulaSimplifications, 724 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 894 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 247 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 16453 SizeOfPredicates, 5 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 138/185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...