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-lit/bhmr2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:11,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:11,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:11,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:11,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:11,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:11,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:11,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:11,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:11,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:11,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:11,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:11,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:11,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:11,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:11,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:11,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:11,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:11,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:11,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:11,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:11,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:11,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:11,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:11,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:11,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:11,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:11,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:11,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:11,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:11,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:11,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:11,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:11,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:11,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:11,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:11,613 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:11,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:11,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:11,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:11,640 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:11,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:11,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:11,641 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:11,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:11,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:11,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:11,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:11,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:11,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:11,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:11,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:11,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:11,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:11,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:11,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:11,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:11,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:11,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:11,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:11,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:11,647 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:11,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:11,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:11,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:11,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:11,715 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:11,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 17:35:11,780 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26962422b/149b2fd8b0dc41e6a54d755ebb9e21db/FLAG3fff4bec2 [2018-11-14 17:35:12,181 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:12,182 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 17:35:12,188 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26962422b/149b2fd8b0dc41e6a54d755ebb9e21db/FLAG3fff4bec2 [2018-11-14 17:35:12,201 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26962422b/149b2fd8b0dc41e6a54d755ebb9e21db [2018-11-14 17:35:12,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:12,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:12,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:12,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:12,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:12,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:12" (1/1) ... [2018-11-14 17:35:12,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc47982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:12, skipping insertion in model container [2018-11-14 17:35:12,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:12" (1/1) ... [2018-11-14 17:35:12,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:12,256 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:12,485 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:12,490 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:12,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:12,528 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:12,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:12 WrapperNode [2018-11-14 17:35:12,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:12,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:12,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:12,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:12,545 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:12" (1/1) ... [2018-11-14 17:35:12,546 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:12" (1/1) ... [2018-11-14 17:35:12,552 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:12" (1/1) ... [2018-11-14 17:35:12,552 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:12" (1/1) ... [2018-11-14 17:35:12,558 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:12" (1/1) ... [2018-11-14 17:35:12,564 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:12" (1/1) ... [2018-11-14 17:35:12,565 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:12" (1/1) ... [2018-11-14 17:35:12,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:12,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:12,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:12,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:12,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:12" (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:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:35:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:13,163 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:13,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:13 BoogieIcfgContainer [2018-11-14 17:35:13,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:13,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:13,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:13,169 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:13,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:12" (1/3) ... [2018-11-14 17:35:13,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:13, skipping insertion in model container [2018-11-14 17:35:13,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:12" (2/3) ... [2018-11-14 17:35:13,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:13, skipping insertion in model container [2018-11-14 17:35:13,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:13" (3/3) ... [2018-11-14 17:35:13,173 INFO L112 eAbstractionObserver]: Analyzing ICFG bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 17:35:13,184 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:13,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:13,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:13,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:13,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:13,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:13,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:13,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:13,247 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:13,247 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:13,247 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:13,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 17:35:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:35:13,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:13,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:13,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:13,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1421497933, now seen corresponding path program 1 times [2018-11-14 17:35:13,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:13,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:13,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:13,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:13,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 17:35:13,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 17:35:13,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2018-11-14 17:35:13,514 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2018-11-14 17:35:13,515 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-14 17:35:13,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {25#true} is VALID [2018-11-14 17:35:13,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 17:35:13,532 INFO L256 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {26#false} is VALID [2018-11-14 17:35:13,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 17:35:13,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~cond == 0; {26#false} is VALID [2018-11-14 17:35:13,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 17:35:13,536 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:13,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:13,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:35:13,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:35:13,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:13,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:35:13,647 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 17:35:13,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:35:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:35:13,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:35:13,658 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 17:35:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:13,768 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 17:35:13,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:35:13,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:35:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-14 17:35:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-14 17:35:13,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2018-11-14 17:35:14,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:14,181 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:35:14,181 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 17:35:14,185 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 17:35:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 17:35:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 17:35:14,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:14,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:14,313 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:14,314 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,322 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 17:35:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 17:35:14,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,323 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:14,324 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 17:35:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,331 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 17:35:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 17:35:14,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:14,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:35:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-14 17:35:14,340 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-14 17:35:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:14,341 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-14 17:35:14,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:35:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 17:35:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:35:14,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:14,342 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:14,342 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:14,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1574385422, now seen corresponding path program 1 times [2018-11-14 17:35:14,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:14,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:14,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:14,680 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-14 17:35:14,902 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-14 17:35:15,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {124#true} call ULTIMATE.init(); {124#true} is VALID [2018-11-14 17:35:15,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#true} assume true; {124#true} is VALID [2018-11-14 17:35:15,083 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} #44#return; {124#true} is VALID [2018-11-14 17:35:15,083 INFO L256 TraceCheckUtils]: 3: Hoare triple {124#true} call #t~ret3 := main(); {124#true} is VALID [2018-11-14 17:35:15,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {124#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {126#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} is VALID [2018-11-14 17:35:15,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {126#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {127#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:15,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume true; {127#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:15,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {128#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:15,096 INFO L256 TraceCheckUtils]: 8: Hoare triple {128#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {129#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:15,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {129#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {130#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:15,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {130#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {125#false} is VALID [2018-11-14 17:35:15,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {125#false} assume !false; {125#false} is VALID [2018-11-14 17:35:15,107 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:15,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:15,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:35:15,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 17:35:15,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:15,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:35:15,163 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:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:35:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:35:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:35:15,167 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-11-14 17:35:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:15,818 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:35:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:15,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 17:35:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 17:35:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 17:35:15,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2018-11-14 17:35:15,889 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 17:35:15,891 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:35:15,892 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:35:15,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:35:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 17:35:15,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:15,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 17:35:15,913 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 17:35:15,914 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 17:35:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:15,916 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:15,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:15,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:15,917 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 17:35:15,917 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 17:35:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:15,919 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:15,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:15,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:15,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:15,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:35:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 17:35:15,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-11-14 17:35:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:15,923 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 17:35:15,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:35:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:35:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:35:15,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:15,925 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:15,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:15,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1592010396, now seen corresponding path program 1 times [2018-11-14 17:35:15,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:15,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:15,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:15,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:15,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:16,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2018-11-14 17:35:16,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {229#true} assume true; {229#true} is VALID [2018-11-14 17:35:16,299 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {229#true} {229#true} #44#return; {229#true} is VALID [2018-11-14 17:35:16,300 INFO L256 TraceCheckUtils]: 3: Hoare triple {229#true} call #t~ret3 := main(); {229#true} is VALID [2018-11-14 17:35:16,301 INFO L273 TraceCheckUtils]: 4: Hoare triple {229#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:16,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:16,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume true; {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:16,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {232#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:16,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {232#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume #t~nondet2 != 0;havoc #t~nondet2;~a~0 := ~a~0 + 1;~b~0 := ~b~0 + 2; {233#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:16,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := ~i~0 + 1; {234#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:16,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {234#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume true; {234#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:16,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {234#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {235#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:16,320 INFO L256 TraceCheckUtils]: 12: Hoare triple {235#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {236#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:16,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {236#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {237#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:16,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {237#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {230#false} is VALID [2018-11-14 17:35:16,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {230#false} assume !false; {230#false} is VALID [2018-11-14 17:35:16,325 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 17:35:16,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:16,326 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 17:35:16,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:16,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:16,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2018-11-14 17:35:16,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {229#true} assume true; {229#true} is VALID [2018-11-14 17:35:16,811 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {229#true} {229#true} #44#return; {229#true} is VALID [2018-11-14 17:35:16,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {229#true} call #t~ret3 := main(); {229#true} is VALID [2018-11-14 17:35:16,813 INFO L273 TraceCheckUtils]: 4: Hoare triple {229#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:16,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:16,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume true; {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:16,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {253#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {263#(and (= main_~b~0 0) (< main_~i~0 main_~n~0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:16,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {263#(and (= main_~b~0 0) (< main_~i~0 main_~n~0) (= main_~a~0 0) (= main_~i~0 0))} assume #t~nondet2 != 0;havoc #t~nondet2;~a~0 := ~a~0 + 1;~b~0 := ~b~0 + 2; {267#(and (< main_~i~0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (= main_~i~0 0))} is VALID [2018-11-14 17:35:16,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#(and (< main_~i~0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (= main_~i~0 0))} ~i~0 := ~i~0 + 1; {271#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} is VALID [2018-11-14 17:35:16,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {271#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} assume true; {271#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} is VALID [2018-11-14 17:35:16,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {271#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {278#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~n~0 1))} is VALID [2018-11-14 17:35:16,829 INFO L256 TraceCheckUtils]: 12: Hoare triple {278#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {236#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:16,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {236#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {237#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:16,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {237#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {230#false} is VALID [2018-11-14 17:35:16,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {230#false} assume !false; {230#false} is VALID [2018-11-14 17:35:16,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 17:35:16,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:16,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-14 17:35:16,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-14 17:35:16,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:16,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:35:16,923 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 17:35:16,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:35:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:35:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:16,925 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-11-14 17:35:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:17,877 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:35:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:35:17,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-14 17:35:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-11-14 17:35:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-11-14 17:35:17,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 37 transitions. [2018-11-14 17:35:18,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:18,044 INFO L225 Difference]: With dead ends: 32 [2018-11-14 17:35:18,045 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:35:18,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:35:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:35:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-14 17:35:18,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:18,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-14 17:35:18,072 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-14 17:35:18,073 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-14 17:35:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:18,075 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 17:35:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 17:35:18,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:18,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:18,077 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-14 17:35:18,077 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-14 17:35:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:18,079 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 17:35:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 17:35:18,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:18,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:18,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:18,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:35:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-14 17:35:18,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-14 17:35:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:18,083 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-14 17:35:18,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:35:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 17:35:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:35:18,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:18,084 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:18,085 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:18,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2103962116, now seen corresponding path program 1 times [2018-11-14 17:35:18,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:18,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:18,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2018-11-14 17:35:18,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2018-11-14 17:35:18,488 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #44#return; {432#true} is VALID [2018-11-14 17:35:18,488 INFO L256 TraceCheckUtils]: 3: Hoare triple {432#true} call #t~ret3 := main(); {432#true} is VALID [2018-11-14 17:35:18,489 INFO L273 TraceCheckUtils]: 4: Hoare triple {432#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume true; {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(#t~nondet2 != 0);havoc #t~nondet2;~a~0 := ~a~0 + 2;~b~0 := ~b~0 + 1; {435#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)) (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {435#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)) (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)))} ~i~0 := ~i~0 + 1; {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume true; {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {434#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {436#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {436#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume #t~nondet2 != 0;havoc #t~nondet2;~a~0 := ~a~0 + 1;~b~0 := ~b~0 + 2; {437#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:18,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {437#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := ~i~0 + 1; {438#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:18,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume true; {438#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-14 17:35:18,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {439#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-14 17:35:18,506 INFO L256 TraceCheckUtils]: 16: Hoare triple {439#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {440#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:18,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {440#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {441#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:18,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {441#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {433#false} is VALID [2018-11-14 17:35:18,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {433#false} assume !false; {433#false} is VALID [2018-11-14 17:35:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:35:18,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:18,512 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 17:35:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:18,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:19,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2018-11-14 17:35:19,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2018-11-14 17:35:19,200 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #44#return; {432#true} is VALID [2018-11-14 17:35:19,200 INFO L256 TraceCheckUtils]: 3: Hoare triple {432#true} call #t~ret3 := main(); {432#true} is VALID [2018-11-14 17:35:19,200 INFO L273 TraceCheckUtils]: 4: Hoare triple {432#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:19,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:19,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume true; {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:19,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:35:19,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !(#t~nondet2 != 0);havoc #t~nondet2;~a~0 := ~a~0 + 2;~b~0 := ~b~0 + 1; {470#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:35:19,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 0))} ~i~0 := ~i~0 + 1; {474#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} is VALID [2018-11-14 17:35:19,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} assume true; {474#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} is VALID [2018-11-14 17:35:19,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {474#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {481#(and (= main_~a~0 2) (= main_~b~0 1) (< main_~i~0 main_~n~0) (= main_~i~0 1))} is VALID [2018-11-14 17:35:19,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#(and (= main_~a~0 2) (= main_~b~0 1) (< main_~i~0 main_~n~0) (= main_~i~0 1))} assume #t~nondet2 != 0;havoc #t~nondet2;~a~0 := ~a~0 + 1;~b~0 := ~b~0 + 2; {485#(and (< main_~i~0 main_~n~0) (= main_~b~0 3) (= main_~i~0 1) (= main_~a~0 3))} is VALID [2018-11-14 17:35:19,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {485#(and (< main_~i~0 main_~n~0) (= main_~b~0 3) (= main_~i~0 1) (= main_~a~0 3))} ~i~0 := ~i~0 + 1; {489#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} is VALID [2018-11-14 17:35:19,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} assume true; {489#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} is VALID [2018-11-14 17:35:19,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {489#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} assume !(~i~0 < ~n~0); {496#(and (< 1 main_~n~0) (= main_~b~0 3) (<= main_~n~0 2) (= main_~a~0 3))} is VALID [2018-11-14 17:35:19,213 INFO L256 TraceCheckUtils]: 16: Hoare triple {496#(and (< 1 main_~n~0) (= main_~b~0 3) (<= main_~n~0 2) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {440#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:19,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {440#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {441#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:19,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {441#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {433#false} is VALID [2018-11-14 17:35:19,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {433#false} assume !false; {433#false} is VALID [2018-11-14 17:35:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-14 17:35:19,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-11-14 17:35:19,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:19,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:35:19,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:19,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:35:19,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:35:19,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:35:19,282 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 17 states. [2018-11-14 17:35:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:20,493 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-14 17:35:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:35:20,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-11-14 17:35:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:35:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-14 17:35:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:35:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-14 17:35:20,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2018-11-14 17:35:20,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:20,552 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:35:20,552 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:20,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:35:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:20,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:20,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:20,555 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:20,556 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:20,556 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:20,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:20,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:20,556 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:20,557 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:20,557 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:20,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:20,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:20,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:20,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:20,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-14 17:35:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:20,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:20,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:35:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:20,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:20,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:20,723 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:35:20,724 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 26) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-14 17:35:20,724 INFO L425 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. [2018-11-14 17:35:20,725 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 26) no Hoare annotation was computed. [2018-11-14 17:35:20,725 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 26) the Hoare annotation is: true [2018-11-14 17:35:20,725 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-14 17:35:20,725 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 23) no Hoare annotation was computed. [2018-11-14 17:35:20,725 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~i~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 (* 3 main_~n~0)))) [2018-11-14 17:35:20,725 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~n~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2018-11-14 17:35:20,726 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:35:20,726 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:35:20,726 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:35:20,726 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:35:20,726 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:35:20,726 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:35:20,728 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:20,728 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:35:20,728 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:20,728 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:20,729 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 17:35:20,730 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:35:20,730 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:35:20,730 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:35:20,730 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:20,730 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:35:20,731 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-14 17:35:20,731 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:20,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:20 BoogieIcfgContainer [2018-11-14 17:35:20,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:20,744 INFO L168 Benchmark]: Toolchain (without parser) took 8531.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -196.8 MB). Peak memory consumption was 510.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:20,745 INFO L168 Benchmark]: CDTParser took 0.30 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:20,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.98 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:20,747 INFO L168 Benchmark]: Boogie Preprocessor took 37.03 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:20,747 INFO L168 Benchmark]: RCFGBuilder took 596.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:20,748 INFO L168 Benchmark]: TraceAbstraction took 7576.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 545.8 MB). Peak memory consumption was 545.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:20,753 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.30 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 314.98 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 37.03 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 596.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7576.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 545.8 MB). Peak memory consumption was 545.8 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: (a + b <= 3 * i && 3 * i <= a + b) && a + b <= 3 * n - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 25 SDslu, 198 SDs, 0 SdLazy, 302 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 42 HoareAnnotationTreeSize, 12 FomulaSimplifications, 97 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 145 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 12196 SizeOfPredicates, 6 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...