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-Const.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:22:38,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:22:38,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:22:38,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:22:38,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:22:38,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:22:38,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:22:38,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:22:38,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:22:38,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:22:38,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:22:38,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:22:38,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:22:38,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:22:38,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:22:38,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:22:38,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:22:38,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:22:38,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:22:38,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:22:38,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:22:38,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:22:38,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:22:38,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:22:38,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:22:38,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:22:38,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:22:38,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:22:38,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:22:38,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:22:38,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:22:38,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:22:38,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:22:38,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:22:38,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:22:38,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:22:38,919 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:22:38,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:22:38,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:22:38,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:22:38,949 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:22:38,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:22:38,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:22:38,953 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:22:38,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:22:38,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:22:38,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:22:38,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:22:38,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:22:38,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:22:38,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:22:38,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:22:38,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:22:38,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:22:38,958 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:22:38,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:22:38,959 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:22:38,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:22:38,959 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:22:38,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:22:38,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:22:38,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:22:38,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:22:38,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:22:38,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:22:38,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:22:38,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:22:38,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:22:39,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:22:39,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:22:39,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:22:39,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:22:39,048 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:22:39,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-14 19:22:39,109 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5c4c129/71c23b51276b46539623a9dcffeefd38/FLAG8c928a3d9 [2018-11-14 19:22:39,555 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:22:39,555 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-14 19:22:39,569 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5c4c129/71c23b51276b46539623a9dcffeefd38/FLAG8c928a3d9 [2018-11-14 19:22:39,599 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da5c4c129/71c23b51276b46539623a9dcffeefd38 [2018-11-14 19:22:39,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:22:39,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:22:39,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:39,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:22:39,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:22:39,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b52ee5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39, skipping insertion in model container [2018-11-14 19:22:39,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:22:39,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:22:39,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:39,851 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:22:39,871 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:39,888 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:22:39,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39 WrapperNode [2018-11-14 19:22:39,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:39,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:22:39,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:22:39,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:22:39,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (1/1) ... [2018-11-14 19:22:39,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:22:39,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:22:39,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:22:39,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:22:39,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (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 19:22:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:22:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:22:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:22:40,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:22:40,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:22:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:22:40,623 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:22:40,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:40 BoogieIcfgContainer [2018-11-14 19:22:40,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:22:40,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:22:40,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:22:40,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:22:40,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:22:39" (1/3) ... [2018-11-14 19:22:40,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7cf32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:40, skipping insertion in model container [2018-11-14 19:22:40,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:39" (2/3) ... [2018-11-14 19:22:40,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7cf32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:40, skipping insertion in model container [2018-11-14 19:22:40,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:40" (3/3) ... [2018-11-14 19:22:40,632 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007b_true-unreach-call_true-termination.c.i [2018-11-14 19:22:40,643 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:22:40,652 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:22:40,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:22:40,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:22:40,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:22:40,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:22:40,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:22:40,703 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:22:40,703 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:22:40,703 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:22:40,703 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:22:40,703 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:22:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 19:22:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:22:40,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:40,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:40,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 425736256, now seen corresponding path program 1 times [2018-11-14 19:22:40,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:40,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:40,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:40,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 19:22:40,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 19:22:40,922 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #41#return; {25#true} is VALID [2018-11-14 19:22:40,923 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2018-11-14 19:22:40,923 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-14 19:22:40,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 19:22:40,927 INFO L256 TraceCheckUtils]: 6: Hoare triple {26#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {26#false} is VALID [2018-11-14 19:22:40,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 19:22:40,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume ~cond == 0; {26#false} is VALID [2018-11-14 19:22:40,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 19:22:40,931 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 19:22:40,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:40,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:22:40,938 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:22:40,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:40,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:22:40,985 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 19:22:40,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:22:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:22:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:22:40,996 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 19:22:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:41,115 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-14 19:22:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:22:41,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:22:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:22:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2018-11-14 19:22:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:22:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2018-11-14 19:22:41,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2018-11-14 19:22:41,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:41,514 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:22:41,515 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 19:22:41,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:22:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 19:22:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 19:22:41,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:41,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 19:22:41,576 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:22:41,578 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:22:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:41,583 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 19:22:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:22:41,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:41,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:41,584 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:22:41,584 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:22:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:41,588 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 19:22:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:22:41,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:41,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:41,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:41,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:22:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-14 19:22:41,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-11-14 19:22:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:41,594 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-14 19:22:41,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:22:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:22:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:22:41,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:41,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:41,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:41,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash -145623935, now seen corresponding path program 1 times [2018-11-14 19:22:41,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:41,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:41,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:41,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2018-11-14 19:22:41,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {134#true} assume true; {134#true} is VALID [2018-11-14 19:22:41,757 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {134#true} {134#true} #41#return; {134#true} is VALID [2018-11-14 19:22:41,757 INFO L256 TraceCheckUtils]: 3: Hoare triple {134#true} call #t~ret3 := main(); {134#true} is VALID [2018-11-14 19:22:41,766 INFO L273 TraceCheckUtils]: 4: Hoare triple {134#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {136#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:41,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {136#(<= 0 main_~m~0)} assume true; {136#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:41,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {136#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {136#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:41,799 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {137#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 19:22:41,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {138#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:22:41,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {138#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {135#false} is VALID [2018-11-14 19:22:41,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {135#false} assume !false; {135#false} is VALID [2018-11-14 19:22:41,802 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 19:22:41,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:41,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:22:41,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 19:22:41,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:41,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:22:41,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:41,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:22:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:22:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:22:41,854 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2018-11-14 19:22:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:42,213 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 19:22:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:22:42,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 19:22:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-14 19:22:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:22:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-14 19:22:42,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2018-11-14 19:22:42,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:42,505 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:22:42,505 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 19:22:42,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 19:22:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-14 19:22:42,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:42,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-14 19:22:42,659 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-14 19:22:42,659 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-14 19:22:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:42,662 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:22:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 19:22:42,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:42,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:42,664 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-14 19:22:42,664 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-14 19:22:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:42,667 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:22:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 19:22:42,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:42,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:42,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:42,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:22:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-14 19:22:42,672 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2018-11-14 19:22:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:42,672 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-14 19:22:42,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:22:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 19:22:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:22:42,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:42,674 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:42,674 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:42,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1098814237, now seen corresponding path program 1 times [2018-11-14 19:22:42,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:42,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:42,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2018-11-14 19:22:42,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2018-11-14 19:22:42,964 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #41#return; {275#true} is VALID [2018-11-14 19:22:42,964 INFO L256 TraceCheckUtils]: 3: Hoare triple {275#true} call #t~ret3 := main(); {275#true} is VALID [2018-11-14 19:22:42,965 INFO L273 TraceCheckUtils]: 4: Hoare triple {275#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} is VALID [2018-11-14 19:22:42,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} assume true; {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} is VALID [2018-11-14 19:22:42,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} assume !(~x~0 < ~n~0); {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} is VALID [2018-11-14 19:22:42,967 INFO L256 TraceCheckUtils]: 7: Hoare triple {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {275#true} is VALID [2018-11-14 19:22:42,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {275#true} ~cond := #in~cond; {278#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 19:22:42,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 19:22:42,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {279#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 19:22:42,972 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {279#(not (= |__VERIFIER_assert_#in~cond| 0))} {277#(and (<= 0 main_~m~0) (<= main_~m~0 0))} #45#return; {280#(or (<= main_~n~0 0) (<= main_~m~0 0))} is VALID [2018-11-14 19:22:42,976 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#(or (<= main_~n~0 0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 19:22:42,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {281#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 19:22:42,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {281#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {276#false} is VALID [2018-11-14 19:22:42,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {276#false} assume !false; {276#false} is VALID [2018-11-14 19:22:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:22:42,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:22:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:43,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:22:43,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2018-11-14 19:22:43,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2018-11-14 19:22:43,286 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #41#return; {275#true} is VALID [2018-11-14 19:22:43,286 INFO L256 TraceCheckUtils]: 3: Hoare triple {275#true} call #t~ret3 := main(); {275#true} is VALID [2018-11-14 19:22:43,287 INFO L273 TraceCheckUtils]: 4: Hoare triple {275#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {297#(<= main_~x~0 0)} is VALID [2018-11-14 19:22:43,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#(<= main_~x~0 0)} assume true; {297#(<= main_~x~0 0)} is VALID [2018-11-14 19:22:43,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {304#(<= main_~n~0 0)} is VALID [2018-11-14 19:22:43,288 INFO L256 TraceCheckUtils]: 7: Hoare triple {304#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {275#true} is VALID [2018-11-14 19:22:43,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2018-11-14 19:22:43,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {275#true} assume !(~cond == 0); {275#true} is VALID [2018-11-14 19:22:43,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {275#true} assume true; {275#true} is VALID [2018-11-14 19:22:43,291 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {275#true} {304#(<= main_~n~0 0)} #45#return; {304#(<= main_~n~0 0)} is VALID [2018-11-14 19:22:43,292 INFO L256 TraceCheckUtils]: 12: Hoare triple {304#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {323#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:22:43,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {327#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:22:43,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {327#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {276#false} is VALID [2018-11-14 19:22:43,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {276#false} assume !false; {276#false} is VALID [2018-11-14 19:22:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:22:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-14 19:22:43,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-14 19:22:43,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:43,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:22:43,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:43,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:22:43,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:22:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:22:43,461 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 11 states. [2018-11-14 19:22:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:44,423 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-14 19:22:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:22:44,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-14 19:22:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:22:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 19:22:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:22:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 19:22:44,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-14 19:22:44,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:44,520 INFO L225 Difference]: With dead ends: 46 [2018-11-14 19:22:44,520 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 19:22:44,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:22:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 19:22:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-14 19:22:44,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:44,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-14 19:22:44,547 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-14 19:22:44,548 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-14 19:22:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:44,551 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-14 19:22:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-14 19:22:44,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:44,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:44,552 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-14 19:22:44,553 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-14 19:22:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:44,556 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-14 19:22:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-14 19:22:44,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:44,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:44,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:44,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 19:22:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-14 19:22:44,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 16 [2018-11-14 19:22:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:44,561 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-14 19:22:44,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:22:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-14 19:22:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:22:44,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:44,562 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:44,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:44,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1093455445, now seen corresponding path program 1 times [2018-11-14 19:22:44,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:44,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:44,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {511#true} is VALID [2018-11-14 19:22:44,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#true} assume true; {511#true} is VALID [2018-11-14 19:22:44,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {511#true} {511#true} #41#return; {511#true} is VALID [2018-11-14 19:22:44,668 INFO L256 TraceCheckUtils]: 3: Hoare triple {511#true} call #t~ret3 := main(); {511#true} is VALID [2018-11-14 19:22:44,675 INFO L273 TraceCheckUtils]: 4: Hoare triple {511#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {513#(<= 0 main_~x~0)} assume true; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {513#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {513#(<= 0 main_~x~0)} assume #t~nondet2 != 0;havoc #t~nondet2;~m~0 := ~x~0; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(<= 0 main_~m~0)} ~x~0 := ~x~0 + 1; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(<= 0 main_~m~0)} assume true; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {514#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,688 INFO L256 TraceCheckUtils]: 11: Hoare triple {514#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {515#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:22:44,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {516#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:22:44,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {512#false} is VALID [2018-11-14 19:22:44,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {512#false} assume !false; {512#false} is VALID [2018-11-14 19:22:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:44,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:22:44,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:22:44,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:44,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:22:44,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {511#true} is VALID [2018-11-14 19:22:44,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#true} assume true; {511#true} is VALID [2018-11-14 19:22:44,837 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {511#true} {511#true} #41#return; {511#true} is VALID [2018-11-14 19:22:44,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {511#true} call #t~ret3 := main(); {511#true} is VALID [2018-11-14 19:22:44,838 INFO L273 TraceCheckUtils]: 4: Hoare triple {511#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {513#(<= 0 main_~x~0)} assume true; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {513#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {513#(<= 0 main_~x~0)} is VALID [2018-11-14 19:22:44,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {513#(<= 0 main_~x~0)} assume #t~nondet2 != 0;havoc #t~nondet2;~m~0 := ~x~0; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(<= 0 main_~m~0)} ~x~0 := ~x~0 + 1; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(<= 0 main_~m~0)} assume true; {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {514#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {514#(<= 0 main_~m~0)} is VALID [2018-11-14 19:22:44,845 INFO L256 TraceCheckUtils]: 11: Hoare triple {514#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {515#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:22:44,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {516#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:22:44,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {512#false} is VALID [2018-11-14 19:22:44,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {512#false} assume !false; {512#false} is VALID [2018-11-14 19:22:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:44,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:22:44,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 19:22:44,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:44,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:44,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:44,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:44,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:44,908 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 6 states. [2018-11-14 19:22:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,221 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-14 19:22:45,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:22:45,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:22:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-14 19:22:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-14 19:22:45,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2018-11-14 19:22:45,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:45,289 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:22:45,289 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 19:22:45,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 19:22:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 19:22:45,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:45,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 19:22:45,326 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 19:22:45,327 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 19:22:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,331 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:22:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 19:22:45,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:45,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:45,332 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 19:22:45,332 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 19:22:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,334 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:22:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 19:22:45,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:45,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:45,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:45,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:22:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 19:22:45,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2018-11-14 19:22:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:45,338 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 19:22:45,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 19:22:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 19:22:45,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:45,339 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:45,340 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:45,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 260502089, now seen corresponding path program 1 times [2018-11-14 19:22:45,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:45,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:45,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:45,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-14 19:22:45,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:22:45,446 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {710#true} {710#true} #41#return; {710#true} is VALID [2018-11-14 19:22:45,446 INFO L256 TraceCheckUtils]: 3: Hoare triple {710#true} call #t~ret3 := main(); {710#true} is VALID [2018-11-14 19:22:45,446 INFO L273 TraceCheckUtils]: 4: Hoare triple {710#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {710#true} is VALID [2018-11-14 19:22:45,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:22:45,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {710#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {710#true} is VALID [2018-11-14 19:22:45,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {710#true} assume #t~nondet2 != 0;havoc #t~nondet2;~m~0 := ~x~0; {710#true} is VALID [2018-11-14 19:22:45,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#true} ~x~0 := ~x~0 + 1; {710#true} is VALID [2018-11-14 19:22:45,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:22:45,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {710#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {712#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {712#(<= (+ main_~x~0 1) main_~n~0)} assume #t~nondet2 != 0;havoc #t~nondet2;~m~0 := ~x~0; {713#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {713#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := ~x~0 + 1; {713#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {713#(<= (+ main_~m~0 1) main_~n~0)} assume true; {713#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {713#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {713#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,459 INFO L256 TraceCheckUtils]: 15: Hoare triple {713#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {710#true} is VALID [2018-11-14 19:22:45,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#true} ~cond := #in~cond; {710#true} is VALID [2018-11-14 19:22:45,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#true} assume !(~cond == 0); {710#true} is VALID [2018-11-14 19:22:45,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:22:45,460 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {710#true} {713#(<= (+ main_~m~0 1) main_~n~0)} #45#return; {713#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-14 19:22:45,461 INFO L256 TraceCheckUtils]: 20: Hoare triple {713#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {714#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:22:45,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {714#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {715#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:22:45,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {715#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {711#false} is VALID [2018-11-14 19:22:45,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-14 19:22:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:22:45,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:22:45,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 19:22:45,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:45,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:45,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:45,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:45,520 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-11-14 19:22:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,724 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:22:45,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:45,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 19:22:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 19:22:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 19:22:45,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2018-11-14 19:22:45,785 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-14 19:22:45,785 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:22:45,785 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:22:45,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:22:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:22:45,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:45,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:45,786 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:45,787 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,787 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:45,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:45,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:45,788 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:45,788 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:45,788 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:45,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:45,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:45,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:45,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:22:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:22:45,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-14 19:22:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:45,789 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:22:45,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:45,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:45,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:22:45,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 19:22:46,048 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-11-14 19:22:46,118 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 19:22:46,118 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:46,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:46,119 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:22:46,119 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:46,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:46,119 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-14 19:22:46,119 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (or (<= main_~n~0 0) (<= main_~m~0 0) (and (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0))) [2018-11-14 19:22:46,120 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 19) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L425 ceAbstractionStarter]: For program point L15-2(lines 15 17) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-14 19:22:46,120 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 19) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and .cse0 (<= (+ main_~m~0 1) main_~n~0) .cse1))) [2018-11-14 19:22:46,121 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 19) the Hoare annotation is: (let ((.cse1 (<= 0 main_~x~0)) (.cse0 (<= 0 main_~m~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and .cse0 (<= (+ main_~m~0 1) main_~n~0) .cse1) (and .cse0 (<= main_~m~0 0)))) [2018-11-14 19:22:46,121 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 19:22:46,121 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 19:22:46,121 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 19:22:46,121 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 19:22:46,121 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 19:22:46,121 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 19:22:46,123 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:46,124 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:22:46,124 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:46,124 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:46,124 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:22:46,125 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:22:46,126 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:22:46,127 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:22:46,127 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-14 19:22:46,127 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 19:22:46,127 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:46,127 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:22:46,127 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:22:46,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:22:46 BoogieIcfgContainer [2018-11-14 19:22:46,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:22:46,138 INFO L168 Benchmark]: Toolchain (without parser) took 6527.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -442.6 MB). Peak memory consumption was 317.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:46,139 INFO L168 Benchmark]: CDTParser took 0.22 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-14 19:22:46,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.89 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 19:22:46,141 INFO L168 Benchmark]: Boogie Preprocessor took 39.20 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 19:22:46,141 INFO L168 Benchmark]: RCFGBuilder took 694.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:46,143 INFO L168 Benchmark]: TraceAbstraction took 5511.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 354.9 MB). Peak memory consumption was 354.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:46,147 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.22 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 276.89 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 39.20 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 694.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5511.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 354.9 MB). Peak memory consumption was 354.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((n <= 0 && 0 <= m) && 0 <= x) || ((0 <= m && m + 1 <= n) && 0 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 49 SDslu, 226 SDs, 0 SdLazy, 186 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 28 NumberOfFragments, 74 HoareAnnotationTreeSize, 17 FomulaSimplifications, 85 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 3550 SizeOfPredicates, 6 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 13/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...