java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:45,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:45,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:45,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:45,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:45,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:45,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:45,705 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:45,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:45,708 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:45,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:45,709 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:45,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:45,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:45,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:45,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:45,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:45,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:45,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:45,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:45,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:45,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:45,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:45,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:45,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:45,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:45,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:45,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:45,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:45,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:45,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:45,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:45,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:45,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:45,750 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:45,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:45,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:45,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:45,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:45,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:45,782 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:45,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:45,783 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:45,783 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:45,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:45,783 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:45,783 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:45,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:45,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:45,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:45,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:45,784 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:45,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:45,785 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:45,785 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:45,785 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:45,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:45,786 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:45,786 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:45,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:45,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:45,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:45,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:45,787 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:45,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:45,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:45,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:45,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:45,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:45,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:45,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:45,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:45,875 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:45,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c [2018-11-23 12:54:45,932 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea419b88c/d37a4be24408400587b936d56cb07cf0/FLAG04ab96823 [2018-11-23 12:54:46,366 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:46,367 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c [2018-11-23 12:54:46,373 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea419b88c/d37a4be24408400587b936d56cb07cf0/FLAG04ab96823 [2018-11-23 12:54:46,736 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea419b88c/d37a4be24408400587b936d56cb07cf0 [2018-11-23 12:54:46,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:46,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:46,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:46,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:46,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:46,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:46" (1/1) ... [2018-11-23 12:54:46,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e09ba59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:46, skipping insertion in model container [2018-11-23 12:54:46,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:46" (1/1) ... [2018-11-23 12:54:46,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:46,788 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:47,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:47,052 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:47,077 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:47,103 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:47,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47 WrapperNode [2018-11-23 12:54:47,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:47,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:47,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:47,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:47,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:47,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:47,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:47,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:47,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... [2018-11-23 12:54:47,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:47,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:47,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:47,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:47,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 12:54:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:47,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:47,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:47,780 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:47,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:47 BoogieIcfgContainer [2018-11-23 12:54:47,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:47,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:47,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:47,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:47,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:46" (1/3) ... [2018-11-23 12:54:47,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271f9464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:47, skipping insertion in model container [2018-11-23 12:54:47,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:47" (2/3) ... [2018-11-23 12:54:47,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271f9464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:47, skipping insertion in model container [2018-11-23 12:54:47,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:47" (3/3) ... [2018-11-23 12:54:47,790 INFO L112 eAbstractionObserver]: Analyzing ICFG test29_true-unreach-call_true-termination.c [2018-11-23 12:54:47,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:47,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:47,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:47,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:47,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:47,861 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:47,861 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:47,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:47,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:47,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:47,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:47,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 12:54:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:47,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:47,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:47,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:47,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2018-11-23 12:54:47,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:47,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:47,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:47,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:48,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 12:54:48,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21#true} is VALID [2018-11-23 12:54:48,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 12:54:48,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2018-11-23 12:54:48,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2018-11-23 12:54:48,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 12:54:48,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {21#true} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {23#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_~#d1~0.offset| |main_#t~ite1.offset|))} is VALID [2018-11-23 12:54:48,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_~#d1~0.offset| |main_#t~ite1.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {24#(and (= main_~pd~0.base |main_~#d1~0.base|) (= |main_~#d1~0.offset| main_~pd~0.offset))} is VALID [2018-11-23 12:54:48,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#(and (= main_~pd~0.base |main_~#d1~0.base|) (= |main_~#d1~0.offset| main_~pd~0.offset))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); {22#false} is VALID [2018-11-23 12:54:48,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {22#false} is VALID [2018-11-23 12:54:48,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {22#false} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {22#false} is VALID [2018-11-23 12:54:48,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {22#false} is VALID [2018-11-23 12:54:48,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 12:54:48,290 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-23 12:54:48,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:48,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:54:48,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 12:54:48,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:48,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:54:48,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:54:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:54:48,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:48,408 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-11-23 12:54:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,810 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:54:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:48,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 12:54:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:54:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:54:48,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-23 12:54:49,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:49,103 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:49,103 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:54:49,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:54:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-11-23 12:54:49,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:49,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:49,205 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:49,205 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,209 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:54:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:54:49,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:49,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:49,211 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 21 states. [2018-11-23 12:54:49,211 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 21 states. [2018-11-23 12:54:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,215 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:54:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:54:49,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:49,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:49,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:49,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:54:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 12:54:49,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-11-23 12:54:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:49,222 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 12:54:49,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:54:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 12:54:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:49,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:49,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:49,223 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:49,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2018-11-23 12:54:49,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:49,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:49,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-23 12:54:49,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {131#true} is VALID [2018-11-23 12:54:49,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-23 12:54:49,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #35#return; {131#true} is VALID [2018-11-23 12:54:49,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret4 := main(); {131#true} is VALID [2018-11-23 12:54:49,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {133#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:49,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {133#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {134#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d1~0.base|))} is VALID [2018-11-23 12:54:49,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {134#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d1~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} is VALID [2018-11-23 12:54:49,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {136#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:49,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {137#(not |main_#t~short3|)} is VALID [2018-11-23 12:54:49,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {132#false} is VALID [2018-11-23 12:54:49,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {132#false} is VALID [2018-11-23 12:54:49,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-23 12:54:49,647 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-23 12:54:49,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:49,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:54:49,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:49,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:49,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:49,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:49,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:49,713 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2018-11-23 12:54:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,308 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 12:54:50,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:50,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-23 12:54:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-23 12:54:50,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2018-11-23 12:54:50,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:50,356 INFO L225 Difference]: With dead ends: 23 [2018-11-23 12:54:50,356 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 12:54:50,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 12:54:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:54:50,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:50,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:50,366 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:50,366 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,368 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:50,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:50,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:50,369 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:50,369 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,371 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:50,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:50,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:50,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:50,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-11-23 12:54:50,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2018-11-23 12:54:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:50,374 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-11-23 12:54:50,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:50,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:50,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:50,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:50,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1851109901, now seen corresponding path program 1 times [2018-11-23 12:54:50,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:50,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:50,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 12:54:50,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {220#true} is VALID [2018-11-23 12:54:50,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 12:54:50,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #35#return; {220#true} is VALID [2018-11-23 12:54:50,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret4 := main(); {220#true} is VALID [2018-11-23 12:54:50,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {220#true} is VALID [2018-11-23 12:54:50,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {220#true} assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {222#(and (= |main_~#d2~0.base| |main_#t~ite1.base|) (= |main_~#d2~0.offset| |main_#t~ite1.offset|))} is VALID [2018-11-23 12:54:50,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#(and (= |main_~#d2~0.base| |main_#t~ite1.base|) (= |main_~#d2~0.offset| |main_#t~ite1.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {223#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= |main_~#d2~0.base| main_~pd~0.base))} is VALID [2018-11-23 12:54:50,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {223#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= |main_~#d2~0.base| main_~pd~0.base))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); {224#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= |main_~#d2~0.base| main_~pd~0.base) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)))} is VALID [2018-11-23 12:54:50,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {224#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= |main_~#d2~0.base| main_~pd~0.base) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {225#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2018-11-23 12:54:50,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {226#(not |main_#t~short3|)} is VALID [2018-11-23 12:54:50,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#(not |main_#t~short3|)} assume #t~short3;havoc #t~mem2;havoc #t~short3; {221#false} is VALID [2018-11-23 12:54:50,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 12:54:50,636 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-23 12:54:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:50,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:54:50,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:50,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:50,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:50,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:50,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:50,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:50,668 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 7 states. [2018-11-23 12:54:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,958 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:50,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-23 12:54:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-23 12:54:50,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2018-11-23 12:54:51,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:51,007 INFO L225 Difference]: With dead ends: 14 [2018-11-23 12:54:51,007 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:54:51,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:54:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:54:51,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:51,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:51,008 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:51,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:51,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:51,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:51,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:51,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:51,010 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:51,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:51,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:51,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:51,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:51,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:54:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:54:51,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 12:54:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:51,011 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:54:51,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:51,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:51,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:54:51,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:51,042 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:51,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:51,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:51,042 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:54:51,042 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:51,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:51,043 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-11-23 12:54:51,043 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 12:54:51,043 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2018-11-23 12:54:51,043 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-23 12:54:51,044 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2018-11-23 12:54:51,044 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-11-23 12:54:51,044 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-11-23 12:54:51,044 INFO L444 ceAbstractionStarter]: At program point L22(lines 12 29) the Hoare annotation is: false [2018-11-23 12:54:51,044 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2018-11-23 12:54:51,044 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-23 12:54:51,044 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 20) no Hoare annotation was computed. [2018-11-23 12:54:51,046 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:51,046 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:51,046 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:51,046 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:54:51,047 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:54:51,048 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:51,049 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:51,049 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:51,049 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:54:51,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:51 BoogieIcfgContainer [2018-11-23 12:54:51,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:51,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:51,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:51,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:51,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:47" (3/4) ... [2018-11-23 12:54:51,061 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:54:51,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:54:51,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:54:51,072 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 12:54:51,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:54:51,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:54:51,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:54:51,119 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test29_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:51,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:51,121 INFO L168 Benchmark]: Toolchain (without parser) took 4374.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -607.5 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:51,122 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:51,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:51,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:51,124 INFO L168 Benchmark]: Boogie Preprocessor took 28.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:51,125 INFO L168 Benchmark]: RCFGBuilder took 621.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:51,125 INFO L168 Benchmark]: TraceAbstraction took 3273.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 145.4 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:51,126 INFO L168 Benchmark]: Witness Printer took 63.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:51,130 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 356.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 621.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3273.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 145.4 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. * Witness Printer took 63.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 12]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 26 SDslu, 77 SDs, 0 SdLazy, 75 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...