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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build_true-unreach-call.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:03,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:03,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:03,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:03,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:03,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:03,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:03,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:03,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:03,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:03,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:03,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:03,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:03,718 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:03,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:03,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:03,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:03,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:03,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:03,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:03,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:03,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:03,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:03,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:03,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:03,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:03,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:03,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:03,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:03,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:03,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:03,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:03,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:03,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:03,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:03,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:03,762 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-14 17:35:03,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:03,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:03,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:03,794 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:03,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:03,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:03,795 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:03,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:03,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:03,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:03,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:03,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:03,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:03,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:03,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:03,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:03,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:03,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:03,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:03,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:03,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:03,799 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:03,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:03,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:03,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:03,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:03,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:03,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:03,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:03,865 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:03,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build_true-unreach-call.i.v+lhb-reducer.c [2018-11-14 17:35:03,932 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5efa1751/256a097ade25491aa50f89ce3a03df49/FLAGe26b49663 [2018-11-14 17:35:04,444 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:04,444 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build_true-unreach-call.i.v+lhb-reducer.c [2018-11-14 17:35:04,455 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5efa1751/256a097ade25491aa50f89ce3a03df49/FLAGe26b49663 [2018-11-14 17:35:04,477 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5efa1751/256a097ade25491aa50f89ce3a03df49 [2018-11-14 17:35:04,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:04,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:04,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:04,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:04,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:04,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112c4233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04, skipping insertion in model container [2018-11-14 17:35:04,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:04,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:04,768 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:04,774 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:04,799 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:04,813 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:04,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04 WrapperNode [2018-11-14 17:35:04,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:04,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:04,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:04,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:04,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (1/1) ... [2018-11-14 17:35:04,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:04,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:04,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:04,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:04,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (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-14 17:35:04,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:04,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:04,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:05,478 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:05,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:05 BoogieIcfgContainer [2018-11-14 17:35:05,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:05,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:05,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:05,483 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:05,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:04" (1/3) ... [2018-11-14 17:35:05,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661ff4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:05, skipping insertion in model container [2018-11-14 17:35:05,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:04" (2/3) ... [2018-11-14 17:35:05,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661ff4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:05, skipping insertion in model container [2018-11-14 17:35:05,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:05" (3/3) ... [2018-11-14 17:35:05,487 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build_true-unreach-call.i.v+lhb-reducer.c [2018-11-14 17:35:05,498 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:05,508 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 17:35:05,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 17:35:05,561 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:05,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:05,562 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:05,562 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:05,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:05,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:05,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:05,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:05,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-14 17:35:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:35:05,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:05,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:05,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:05,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1077508024, now seen corresponding path program 1 times [2018-11-14 17:35:05,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:05,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:05,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:05,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:05,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:05,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-14 17:35:05,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} ~__return_main~0 := 0;~__return_100~0 := 0; {27#true} is VALID [2018-11-14 17:35:05,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-14 17:35:05,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-14 17:35:05,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2018-11-14 17:35:05,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__nlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {27#true} is VALID [2018-11-14 17:35:05,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {29#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2018-11-14 17:35:05,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {30#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:05,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {28#false} is VALID [2018-11-14 17:35:05,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-14 17:35:05,976 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-14 17:35:05,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:05,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:35:05,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-14 17:35:05,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:05,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:35:06,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:06,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:35:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:35:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:35:06,053 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-11-14 17:35:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:06,549 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-14 17:35:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:35:06,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-14 17:35:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:35:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 17:35:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:35:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 17:35:06,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-14 17:35:06,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:06,770 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:35:06,770 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:35:06,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:35:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:35:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:35:06,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:06,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:06,951 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:06,952 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:06,956 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:06,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:06,958 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:06,958 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:06,962 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:06,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:06,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:06,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:06,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-14 17:35:06,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2018-11-14 17:35:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:06,968 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-14 17:35:06,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:35:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:35:06,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:06,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:06,970 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:06,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:06,971 INFO L82 PathProgramCache]: Analyzing trace with hash 398186682, now seen corresponding path program 1 times [2018-11-14 17:35:06,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:06,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:06,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:06,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:07,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-14 17:35:07,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} ~__return_main~0 := 0;~__return_100~0 := 0; {133#true} is VALID [2018-11-14 17:35:07,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-14 17:35:07,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} #49#return; {133#true} is VALID [2018-11-14 17:35:07,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {133#true} call #t~ret2 := main(); {133#true} is VALID [2018-11-14 17:35:07,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {133#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__nlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {135#(<= 0 main_~main__i~0)} is VALID [2018-11-14 17:35:07,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {135#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {136#(and (<= 0 main_~main__i~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0))} is VALID [2018-11-14 17:35:07,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {136#(and (<= 0 main_~main__i~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0))} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {137#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 17:35:07,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#(and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0); {135#(<= 0 main_~main__i~0)} is VALID [2018-11-14 17:35:07,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {135#(<= 0 main_~main__i~0)} havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {138#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 17:35:07,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {138#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {134#false} is VALID [2018-11-14 17:35:07,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-14 17:35:07,223 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-14 17:35:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:07,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:35:07,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:07,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:07,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:07,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:07,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:07,282 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2018-11-14 17:35:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,033 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 17:35:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:08,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:35:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-14 17:35:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-14 17:35:08,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-11-14 17:35:08,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:08,093 INFO L225 Difference]: With dead ends: 19 [2018-11-14 17:35:08,093 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 17:35:08,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 17:35:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-14 17:35:08,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:08,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:08,118 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:08,118 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 16 states. [2018-11-14 17:35:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,120 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 17:35:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 17:35:08,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:08,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:08,121 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states. [2018-11-14 17:35:08,121 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states. [2018-11-14 17:35:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,123 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 17:35:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 17:35:08,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:08,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:08,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:08,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:35:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-14 17:35:08,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2018-11-14 17:35:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:08,127 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-14 17:35:08,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-14 17:35:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:35:08,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:08,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:08,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:08,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 405408254, now seen corresponding path program 1 times [2018-11-14 17:35:08,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:08,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-14 17:35:08,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} ~__return_main~0 := 0;~__return_100~0 := 0; {231#true} is VALID [2018-11-14 17:35:08,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-14 17:35:08,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #49#return; {231#true} is VALID [2018-11-14 17:35:08,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret2 := main(); {231#true} is VALID [2018-11-14 17:35:08,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~main__offset~0;havoc ~main__length~0;havoc ~main__nlen~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__nlen~0 := #t~nondet1;havoc #t~nondet1;havoc ~main__i~0;havoc ~main__j~0;~main__i~0 := 0; {231#true} is VALID [2018-11-14 17:35:08,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#true} assume ~main__i~0 < ~main__nlen~0;~main__j~0 := 0; {231#true} is VALID [2018-11-14 17:35:08,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#true} assume ~main__j~0 < 8;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {233#(or (and (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (< main_~main__nlen~0 (+ main_~main__i~0 1)) (= main_~__VERIFIER_assert__cond~0 0)))} is VALID [2018-11-14 17:35:08,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(or (and (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (< main_~main__nlen~0 (+ main_~main__i~0 1)) (= main_~__VERIFIER_assert__cond~0 0)))} assume !(~__VERIFIER_assert__cond~0 == 0); {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2018-11-14 17:35:08,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2018-11-14 17:35:08,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~main__j~0 := ~main__j~0 + 1; {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2018-11-14 17:35:08,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {234#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume ~main__j~0 < 8;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {235#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-14 17:35:08,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {235#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume ~__VERIFIER_assert__cond~2 == 0; {232#false} is VALID [2018-11-14 17:35:08,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-14 17:35:08,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-14 17:35:08,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:08,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:35:08,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 17:35:08,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:08,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:35:08,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:08,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:35:08,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:35:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:35:08,310 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-11-14 17:35:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,881 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-14 17:35:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:08,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 17:35:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:35:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-14 17:35:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:35:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-14 17:35:08,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2018-11-14 17:35:08,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:08,932 INFO L225 Difference]: With dead ends: 25 [2018-11-14 17:35:08,933 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:08,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:08,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:08,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:08,935 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:08,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,935 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:08,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:08,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:08,936 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:08,936 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:08,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:08,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:08,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:08,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:08,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-14 17:35:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:08,938 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:08,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:35:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:08,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:08,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:08,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:35:09,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:09,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:09,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:09,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:09,040 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:35:09,041 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:09,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:09,042 INFO L421 ceAbstractionStarter]: At program point L64(lines 34 84) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) [2018-11-14 17:35:09,042 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 97) no Hoare annotation was computed. [2018-11-14 17:35:09,042 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-14 17:35:09,043 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 91) no Hoare annotation was computed. [2018-11-14 17:35:09,043 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 97) no Hoare annotation was computed. [2018-11-14 17:35:09,043 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 80) no Hoare annotation was computed. [2018-11-14 17:35:09,043 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-14 17:35:09,043 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 97) the Hoare annotation is: true [2018-11-14 17:35:09,044 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 84) no Hoare annotation was computed. [2018-11-14 17:35:09,044 INFO L425 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-11-14 17:35:09,044 INFO L421 ceAbstractionStarter]: At program point L90(lines 9 97) the Hoare annotation is: (<= 0 main_~main__i~0) [2018-11-14 17:35:09,044 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 65) no Hoare annotation was computed. [2018-11-14 17:35:09,044 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2018-11-14 17:35:09,044 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2018-11-14 17:35:09,045 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-14 17:35:09,045 INFO L421 ceAbstractionStarter]: At program point L74(lines 47 82) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__i~0 1) main_~main__nlen~0) (not (= 0 main_~__VERIFIER_assert__cond~1))) [2018-11-14 17:35:09,045 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 82) no Hoare annotation was computed. [2018-11-14 17:35:09,047 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:09,048 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:35:09,049 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-14 17:35:09,050 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-11-14 17:35:09,051 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-11-14 17:35:09,051 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-11-14 17:35:09,051 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:09,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:09 BoogieIcfgContainer [2018-11-14 17:35:09,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:09,062 INFO L168 Benchmark]: Toolchain (without parser) took 4569.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -594.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:09,065 INFO L168 Benchmark]: CDTParser took 0.19 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-14 17:35:09,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.43 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-14 17:35:09,067 INFO L168 Benchmark]: Boogie Preprocessor took 32.88 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-14 17:35:09,067 INFO L168 Benchmark]: RCFGBuilder took 630.87 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:09,068 INFO L168 Benchmark]: TraceAbstraction took 3581.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:09,073 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.19 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. * CACSL2BoogieTranslator took 318.43 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 Preprocessor took 32.88 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 630.87 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3581.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 59]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 <= main__i - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((0 <= main__i && __VERIFIER_assert__cond == 1) && main__i + 1 <= main__nlen) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (0 <= main__i && __VERIFIER_assert__cond == 1) && main__i + 1 <= main__nlen - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 3 error locations. SAFE Result, 3.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 70 SDslu, 53 SDs, 0 SdLazy, 62 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 35 HoareAnnotationTreeSize, 7 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1085 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...