java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:09,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:09,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:09,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:09,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:09,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:09,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:09,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:09,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:09,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:09,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:09,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:09,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:09,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:09,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:09,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:09,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:09,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:09,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:09,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:09,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:09,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:09,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:09,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:09,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:09,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:09,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:09,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:09,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:09,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:09,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:09,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:09,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:09,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:09,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:09,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:09,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:10:09,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:09,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:09,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:09,270 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:09,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:09,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:09,270 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:09,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:09,271 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:09,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:09,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:09,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:09,273 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:09,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:09,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:09,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:09,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:09,274 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:09,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:09,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:09,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:09,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:09,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:09,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:09,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:09,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:09,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:09,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:09,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:09,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:09,341 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:09,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-23 13:10:09,412 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0f2eff7/7b996ab03d7e4973b0a769163316d872/FLAG065164da6 [2018-11-23 13:10:09,862 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:09,862 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-23 13:10:09,869 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0f2eff7/7b996ab03d7e4973b0a769163316d872/FLAG065164da6 [2018-11-23 13:10:10,240 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0f2eff7/7b996ab03d7e4973b0a769163316d872 [2018-11-23 13:10:10,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:10,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:10,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:10,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:10,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:10,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d21da5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10, skipping insertion in model container [2018-11-23 13:10:10,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:10,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:10,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:10,507 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:10,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:10,555 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:10,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10 WrapperNode [2018-11-23 13:10:10,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:10,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:10,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:10,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:10,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:10,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:10,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:10,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:10,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... [2018-11-23 13:10:10,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:10,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:10,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:10,620 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:10,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:10,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:10,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:10,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:10:10,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:10:11,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:11,421 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:10:11,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:11 BoogieIcfgContainer [2018-11-23 13:10:11,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:11,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:11,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:11,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:11,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:10" (1/3) ... [2018-11-23 13:10:11,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605e7e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:11, skipping insertion in model container [2018-11-23 13:10:11,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:10" (2/3) ... [2018-11-23 13:10:11,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605e7e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:11, skipping insertion in model container [2018-11-23 13:10:11,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:11" (3/3) ... [2018-11-23 13:10:11,430 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2018-11-23 13:10:11,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:11,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:10:11,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:10:11,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:11,492 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:11,492 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:11,492 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:11,492 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:11,492 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:11,492 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:11,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:11,493 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 13:10:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:10:11,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:11,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:11,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:11,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 576145336, now seen corresponding path program 1 times [2018-11-23 13:10:11,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:11,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:11,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 13:10:11,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 13:10:11,667 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2018-11-23 13:10:11,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {28#true} is VALID [2018-11-23 13:10:11,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {28#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2018-11-23 13:10:11,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {28#true} is VALID [2018-11-23 13:10:11,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 13:10:11,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~j~0 := 0; {29#false} is VALID [2018-11-23 13:10:11,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~j~0 < ~n~0); {29#false} is VALID [2018-11-23 13:10:11,669 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {29#false} is VALID [2018-11-23 13:10:11,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 13:10:11,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 13:10:11,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 13:10:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:11,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:11,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:10:11,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:10:11,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:11,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:10:11,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:11,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:10:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:10:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:10:11,776 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 13:10:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:11,899 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 13:10:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:10:11,900 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:10:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:10:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 13:10:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:10:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 13:10:11,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 13:10:12,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:12,314 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:10:12,314 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:10:12,318 INFO L631 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-23 13:10:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:10:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:10:12,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:12,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:10:12,361 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:10:12,362 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:10:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:12,366 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 13:10:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:10:12,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:12,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:12,367 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:10:12,367 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:10:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:12,370 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 13:10:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:10:12,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:12,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:12,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:12,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:10:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 13:10:12,376 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2018-11-23 13:10:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:12,376 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 13:10:12,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:10:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:10:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:10:12,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:12,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:12,378 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:12,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:12,378 INFO L82 PathProgramCache]: Analyzing trace with hash 893444581, now seen corresponding path program 1 times [2018-11-23 13:10:12,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:12,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:12,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:12,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 13:10:12,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 13:10:12,598 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #65#return; {151#true} is VALID [2018-11-23 13:10:12,598 INFO L256 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {151#true} is VALID [2018-11-23 13:10:12,598 INFO L273 TraceCheckUtils]: 4: Hoare triple {151#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {151#true} is VALID [2018-11-23 13:10:12,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {153#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:12,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(<= main_~i~0 0)} assume !(~i~0 < ~n~0); {154#(<= main_~n~0 0)} is VALID [2018-11-23 13:10:12,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#(<= main_~n~0 0)} ~j~0 := 0; {155#(<= main_~n~0 main_~j~0)} is VALID [2018-11-23 13:10:12,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {152#false} is VALID [2018-11-23 13:10:12,602 INFO L256 TraceCheckUtils]: 9: Hoare triple {152#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {152#false} is VALID [2018-11-23 13:10:12,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2018-11-23 13:10:12,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2018-11-23 13:10:12,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 13:10:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:12,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:10:12,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:12,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:12,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:12,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:12,656 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-23 13:10:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:13,246 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:10:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:13,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:10:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:10:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:10:13,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 13:10:13,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:13,367 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:10:13,367 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:10:13,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:10:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:10:13,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:13,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:10:13,382 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:10:13,382 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:10:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:13,384 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:10:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:10:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:13,386 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:10:13,386 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:10:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:13,388 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:10:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:10:13,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:13,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:13,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:13,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:10:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 13:10:13,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2018-11-23 13:10:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:13,391 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 13:10:13,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:10:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:10:13,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:13,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:13,393 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:13,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash -884671747, now seen corresponding path program 1 times [2018-11-23 13:10:13,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:13,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:13,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 13:10:13,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 13:10:13,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #65#return; {279#true} is VALID [2018-11-23 13:10:13,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {279#true} is VALID [2018-11-23 13:10:13,561 INFO L273 TraceCheckUtils]: 4: Hoare triple {279#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {281#(<= 4000 main_~c1~0)} is VALID [2018-11-23 13:10:13,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {281#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {282#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-23 13:10:13,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {282#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {282#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-23 13:10:13,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {282#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {282#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-23 13:10:13,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= 4000 (+ main_~c1~0 main_~k~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:13,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {283#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:13,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#(<= 4000 main_~k~0)} ~j~0 := 0; {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:13,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {283#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:13,607 INFO L256 TraceCheckUtils]: 12: Hoare triple {283#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {284#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:13,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {284#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {285#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:13,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {280#false} is VALID [2018-11-23 13:10:13,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 13:10:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:13,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:13,614 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-23 13:10:13,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:14,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 13:10:14,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 13:10:14,043 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #65#return; {279#true} is VALID [2018-11-23 13:10:14,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {279#true} is VALID [2018-11-23 13:10:14,046 INFO L273 TraceCheckUtils]: 4: Hoare triple {279#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {281#(<= 4000 main_~c1~0)} is VALID [2018-11-23 13:10:14,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {281#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:14,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:14,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:14,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:14,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {283#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:14,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#(<= 4000 main_~k~0)} ~j~0 := 0; {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:14,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {283#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {283#(<= 4000 main_~k~0)} is VALID [2018-11-23 13:10:14,057 INFO L256 TraceCheckUtils]: 12: Hoare triple {283#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {284#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:14,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {284#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {285#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:14,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {280#false} is VALID [2018-11-23 13:10:14,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 13:10:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:14,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:14,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:10:14,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 13:10:14,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:14,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:10:14,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:14,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:10:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:10:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:14,251 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2018-11-23 13:10:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:15,057 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 13:10:15,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:15,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 13:10:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:15,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 13:10:15,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:15,162 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:10:15,162 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:10:15,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:10:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-11-23 13:10:15,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:15,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 31 states. [2018-11-23 13:10:15,199 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 31 states. [2018-11-23 13:10:15,199 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 31 states. [2018-11-23 13:10:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:15,203 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 13:10:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 13:10:15,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:15,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:15,205 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 39 states. [2018-11-23 13:10:15,205 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 39 states. [2018-11-23 13:10:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:15,209 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 13:10:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 13:10:15,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:15,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:15,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:15,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:10:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 13:10:15,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2018-11-23 13:10:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:15,213 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 13:10:15,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:10:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:10:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:10:15,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:15,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:15,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:15,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash 213378718, now seen corresponding path program 1 times [2018-11-23 13:10:15,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:15,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-23 13:10:15,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-23 13:10:15,342 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {516#true} {516#true} #65#return; {516#true} is VALID [2018-11-23 13:10:15,343 INFO L256 TraceCheckUtils]: 3: Hoare triple {516#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {516#true} is VALID [2018-11-23 13:10:15,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {516#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {518#(<= 2000 main_~c2~0)} is VALID [2018-11-23 13:10:15,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {518#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {519#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-23 13:10:15,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {519#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-23 13:10:15,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {519#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-23 13:10:15,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(0 == ~v~0); {519#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-23 13:10:15,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {519#(<= 2000 (+ main_~c2~0 main_~k~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= 2000 main_~k~0)} ~j~0 := 0; {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,358 INFO L256 TraceCheckUtils]: 13: Hoare triple {520#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {521#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:15,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {522#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:15,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {522#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {517#false} is VALID [2018-11-23 13:10:15,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-23 13:10:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:15,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:15,362 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-23 13:10:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:15,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:15,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-23 13:10:15,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-23 13:10:15,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {516#true} {516#true} #65#return; {516#true} is VALID [2018-11-23 13:10:15,507 INFO L256 TraceCheckUtils]: 3: Hoare triple {516#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {516#true} is VALID [2018-11-23 13:10:15,508 INFO L273 TraceCheckUtils]: 4: Hoare triple {516#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {518#(<= 2000 main_~c2~0)} is VALID [2018-11-23 13:10:15,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {518#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:15,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:15,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:15,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:15,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= 2000 main_~k~0)} ~j~0 := 0; {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {520#(<= 2000 main_~k~0)} is VALID [2018-11-23 13:10:15,516 INFO L256 TraceCheckUtils]: 13: Hoare triple {520#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {521#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:15,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {522#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:15,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {522#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {517#false} is VALID [2018-11-23 13:10:15,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-23 13:10:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:15,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:15,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:10:15,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:10:15,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:15,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:10:15,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:15,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:10:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:10:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:15,569 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 8 states. [2018-11-23 13:10:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:16,252 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 13:10:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:16,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:10:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:16,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 13:10:16,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:16,359 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:10:16,359 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:10:16,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:10:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2018-11-23 13:10:16,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:16,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2018-11-23 13:10:16,402 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2018-11-23 13:10:16,402 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2018-11-23 13:10:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:16,407 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:10:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:10:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:16,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:16,409 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2018-11-23 13:10:16,409 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2018-11-23 13:10:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:16,413 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:10:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:10:16,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:16,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:16,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:16,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:10:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-11-23 13:10:16,417 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 17 [2018-11-23 13:10:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-11-23 13:10:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:10:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 13:10:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:10:16,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:16,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:16,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:16,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -595967908, now seen corresponding path program 1 times [2018-11-23 13:10:16,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:16,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:16,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:16,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {797#true} is VALID [2018-11-23 13:10:16,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {797#true} assume true; {797#true} is VALID [2018-11-23 13:10:16,568 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {797#true} {797#true} #65#return; {797#true} is VALID [2018-11-23 13:10:16,569 INFO L256 TraceCheckUtils]: 3: Hoare triple {797#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {797#true} is VALID [2018-11-23 13:10:16,570 INFO L273 TraceCheckUtils]: 4: Hoare triple {797#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {799#(<= 10000 main_~c3~0)} is VALID [2018-11-23 13:10:16,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {800#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-23 13:10:16,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {800#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {800#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-23 13:10:16,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {800#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {800#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-23 13:10:16,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {800#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(0 == ~v~0); {800#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-23 13:10:16,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {800#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {801#(<= 10000 main_~k~0)} ~j~0 := 0; {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {801#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,582 INFO L256 TraceCheckUtils]: 13: Hoare triple {801#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {802#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:16,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {802#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {803#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:16,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {803#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {798#false} is VALID [2018-11-23 13:10:16,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {798#false} assume !false; {798#false} is VALID [2018-11-23 13:10:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:16,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:16,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:16,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:16,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:16,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {797#true} is VALID [2018-11-23 13:10:16,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {797#true} assume true; {797#true} is VALID [2018-11-23 13:10:16,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {797#true} {797#true} #65#return; {797#true} is VALID [2018-11-23 13:10:16,741 INFO L256 TraceCheckUtils]: 3: Hoare triple {797#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {797#true} is VALID [2018-11-23 13:10:16,742 INFO L273 TraceCheckUtils]: 4: Hoare triple {797#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {799#(<= 10000 main_~c3~0)} is VALID [2018-11-23 13:10:16,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:16,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:16,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:16,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-23 13:10:16,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {822#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {801#(<= 10000 main_~k~0)} ~j~0 := 0; {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {801#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {801#(<= 10000 main_~k~0)} is VALID [2018-11-23 13:10:16,770 INFO L256 TraceCheckUtils]: 13: Hoare triple {801#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {802#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:16,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {802#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {803#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:16,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {803#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {798#false} is VALID [2018-11-23 13:10:16,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {798#false} assume !false; {798#false} is VALID [2018-11-23 13:10:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:16,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:16,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:10:16,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:10:16,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:16,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:10:16,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:10:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:10:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:10:16,826 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 8 states. [2018-11-23 13:10:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:17,495 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-11-23 13:10:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:10:17,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:10:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:10:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 13:10:17,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 13:10:17,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:17,566 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:10:17,566 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:10:17,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:10:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-11-23 13:10:17,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:17,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 42 states. [2018-11-23 13:10:17,641 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 42 states. [2018-11-23 13:10:17,642 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 42 states. [2018-11-23 13:10:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:17,646 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 13:10:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2018-11-23 13:10:17,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:17,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:17,647 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 53 states. [2018-11-23 13:10:17,647 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 53 states. [2018-11-23 13:10:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:17,651 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 13:10:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2018-11-23 13:10:17,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:17,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:17,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:17,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:10:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 13:10:17,655 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2018-11-23 13:10:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:17,656 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-11-23 13:10:17,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:10:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 13:10:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:10:17,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:17,657 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:17,657 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:17,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1650045878, now seen corresponding path program 1 times [2018-11-23 13:10:17,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:17,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:17,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:10:17,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:10:17,726 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1097#true} {1097#true} #65#return; {1097#true} is VALID [2018-11-23 13:10:17,727 INFO L256 TraceCheckUtils]: 3: Hoare triple {1097#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1097#true} is VALID [2018-11-23 13:10:17,727 INFO L273 TraceCheckUtils]: 4: Hoare triple {1097#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1097#true} is VALID [2018-11-23 13:10:17,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1099#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:17,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1100#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:17,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1101#(<= main_~n~0 main_~i~0)} is VALID [2018-11-23 13:10:17,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {1101#(<= main_~n~0 main_~i~0)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1101#(<= main_~n~0 main_~i~0)} is VALID [2018-11-23 13:10:17,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {1101#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1098#false} is VALID [2018-11-23 13:10:17,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1098#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1098#false} is VALID [2018-11-23 13:10:17,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {1098#false} assume !(0 == ~v~0); {1098#false} is VALID [2018-11-23 13:10:17,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {1098#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1098#false} is VALID [2018-11-23 13:10:17,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {1098#false} assume !(~i~0 < ~n~0); {1098#false} is VALID [2018-11-23 13:10:17,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {1098#false} ~j~0 := 0; {1098#false} is VALID [2018-11-23 13:10:17,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {1098#false} assume !!(~j~0 < ~n~0); {1098#false} is VALID [2018-11-23 13:10:17,737 INFO L256 TraceCheckUtils]: 16: Hoare triple {1098#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:10:17,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:10:17,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:10:17,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:10:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:17,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:17,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:17,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:17,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:17,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:10:17,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:10:17,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1097#true} {1097#true} #65#return; {1097#true} is VALID [2018-11-23 13:10:17,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {1097#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1097#true} is VALID [2018-11-23 13:10:17,875 INFO L273 TraceCheckUtils]: 4: Hoare triple {1097#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1097#true} is VALID [2018-11-23 13:10:17,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1099#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:17,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1100#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:17,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1126#(and (<= 1 main_~i~0) (< main_~n~0 2))} is VALID [2018-11-23 13:10:17,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {1126#(and (<= 1 main_~i~0) (< main_~n~0 2))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1126#(and (<= 1 main_~i~0) (< main_~n~0 2))} is VALID [2018-11-23 13:10:17,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {1126#(and (<= 1 main_~i~0) (< main_~n~0 2))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1098#false} is VALID [2018-11-23 13:10:17,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1098#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1098#false} is VALID [2018-11-23 13:10:17,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {1098#false} assume !(0 == ~v~0); {1098#false} is VALID [2018-11-23 13:10:17,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {1098#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1098#false} is VALID [2018-11-23 13:10:17,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {1098#false} assume !(~i~0 < ~n~0); {1098#false} is VALID [2018-11-23 13:10:17,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1098#false} ~j~0 := 0; {1098#false} is VALID [2018-11-23 13:10:17,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {1098#false} assume !!(~j~0 < ~n~0); {1098#false} is VALID [2018-11-23 13:10:17,881 INFO L256 TraceCheckUtils]: 16: Hoare triple {1098#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:10:17,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:10:17,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:10:17,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:10:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:17,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:10:17,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-23 13:10:17,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:10:17,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:17,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:17,932 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-23 13:10:17,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:17,933 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2018-11-23 13:10:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,185 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 13:10:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:18,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:10:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 13:10:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 13:10:18,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2018-11-23 13:10:18,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:18,351 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:10:18,352 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:10:18,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:10:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 13:10:18,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:18,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 13:10:18,427 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 13:10:18,427 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 13:10:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,429 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:10:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:10:18,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,431 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 13:10:18,431 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 13:10:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,432 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:10:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:10:18,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:18,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:10:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 13:10:18,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2018-11-23 13:10:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:18,435 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:10:18,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:10:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:10:18,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:18,436 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:18,437 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -785465255, now seen corresponding path program 1 times [2018-11-23 13:10:18,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:18,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2018-11-23 13:10:18,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2018-11-23 13:10:18,593 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #65#return; {1344#true} is VALID [2018-11-23 13:10:18,593 INFO L256 TraceCheckUtils]: 3: Hoare triple {1344#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1344#true} is VALID [2018-11-23 13:10:18,594 INFO L273 TraceCheckUtils]: 4: Hoare triple {1344#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1344#true} is VALID [2018-11-23 13:10:18,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {1344#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1344#true} is VALID [2018-11-23 13:10:18,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {1344#true} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1344#true} is VALID [2018-11-23 13:10:18,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {1344#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {1346#(<= main_~n~0 1)} is VALID [2018-11-23 13:10:18,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {1346#(<= main_~n~0 1)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1346#(<= main_~n~0 1)} is VALID [2018-11-23 13:10:18,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {1346#(<= main_~n~0 1)} assume !(~i~0 < ~n~0); {1346#(<= main_~n~0 1)} is VALID [2018-11-23 13:10:18,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {1346#(<= main_~n~0 1)} ~j~0 := 0; {1347#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-23 13:10:18,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {1347#(<= main_~n~0 (+ main_~j~0 1))} assume !!(~j~0 < ~n~0); {1347#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-23 13:10:18,598 INFO L256 TraceCheckUtils]: 12: Hoare triple {1347#(<= main_~n~0 (+ main_~j~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1344#true} is VALID [2018-11-23 13:10:18,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {1344#true} ~cond := #in~cond; {1344#true} is VALID [2018-11-23 13:10:18,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {1344#true} assume !(0 == ~cond); {1344#true} is VALID [2018-11-23 13:10:18,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {1344#true} assume true; {1344#true} is VALID [2018-11-23 13:10:18,600 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1344#true} {1347#(<= main_~n~0 (+ main_~j~0 1))} #69#return; {1347#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-23 13:10:18,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {1347#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1348#(<= main_~n~0 main_~j~0)} is VALID [2018-11-23 13:10:18,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {1345#false} is VALID [2018-11-23 13:10:18,603 INFO L256 TraceCheckUtils]: 19: Hoare triple {1345#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1345#false} is VALID [2018-11-23 13:10:18,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {1345#false} ~cond := #in~cond; {1345#false} is VALID [2018-11-23 13:10:18,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {1345#false} assume 0 == ~cond; {1345#false} is VALID [2018-11-23 13:10:18,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2018-11-23 13:10:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:18,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:18,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:10:18,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 13:10:18,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:18,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:10:18,628 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-23 13:10:18,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:10:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:10:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:18,629 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-11-23 13:10:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,778 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:10:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:18,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 13:10:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 13:10:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:10:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 13:10:18,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 13:10:18,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:18,866 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:10:18,866 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:10:18,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:10:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:10:18,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:18,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:18,869 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:18,869 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,869 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:18,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,870 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:18,870 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,870 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:18,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:18,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:10:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:10:18,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-23 13:10:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:18,872 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:10:18,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:10:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:18,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:10:19,285 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-11-23 13:10:19,291 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:10:19,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:19,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:19,292 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:10:19,292 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:10:19,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:10:19,292 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= main_~n~0 1) (<= main_~n~0 (+ main_~j~0 1))) [2018-11-23 13:10:19,293 INFO L448 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-23 13:10:19,293 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2018-11-23 13:10:19,293 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-23 13:10:19,293 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-23 13:10:19,293 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2018-11-23 13:10:19,293 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 36) the Hoare annotation is: (let ((.cse1 (<= 10000 main_~c3~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= 4000 main_~c1~0)) (.cse0 (<= 1 main_~i~0)) (.cse4 (<= main_~n~0 1)) (.cse5 (<= main_~n~0 main_~j~0))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 (<= 2000 main_~k~0))) .cse4 (<= main_~n~0 (+ main_~j~0 1))) (and (<= main_~n~0 0) (<= main_~i~0 0) .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5))) [2018-11-23 13:10:19,294 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-11-23 13:10:19,294 INFO L444 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 4000 main_~c1~0))) (or (and (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0)) (<= main_~n~0 1)) (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)))) [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2018-11-23 13:10:19,294 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:19,294 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:10:19,295 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:10:19,295 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:10:19,295 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:19,296 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:10:19,296 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:19,297 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:10:19,298 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:10:19,299 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 13:10:19,299 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:10:19,300 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:10:19,300 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-23 13:10:19,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:10:19 BoogieIcfgContainer [2018-11-23 13:10:19,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:10:19,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:10:19,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:10:19,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:10:19,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:11" (3/4) ... [2018-11-23 13:10:19,324 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:10:19,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:10:19,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:10:19,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:10:19,337 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:10:19,337 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:10:19,337 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:10:19,392 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:10:19,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:10:19,394 INFO L168 Benchmark]: Toolchain (without parser) took 9144.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -142.5 MB). Peak memory consumption was 560.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:19,395 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:19,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:19,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:19,397 INFO L168 Benchmark]: Boogie Preprocessor took 36.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:19,397 INFO L168 Benchmark]: RCFGBuilder took 802.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -736.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:19,398 INFO L168 Benchmark]: TraceAbstraction took 7896.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 583.7 MB). Peak memory consumption was 583.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:19,399 INFO L168 Benchmark]: Witness Printer took 73.37 ms. Allocated memory is still 2.2 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:19,409 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.24 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 301.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.17 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 802.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -736.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7896.21 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 583.7 MB). Peak memory consumption was 583.7 MB. Max. memory is 7.1 GB. * Witness Printer took 73.37 ms. Allocated memory is still 2.2 GB. Free memory is still 1.5 GB. There was no memory consumed. 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: 20]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) && n <= 1) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 0 <= i) && 0 <= k) && i <= 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((1 <= i && 10000 <= c3 && (2000 <= c2 && 4000 <= c1) && 2000 <= k) && n <= 1) && n <= j + 1) || ((n <= 0 && i <= 0) && n <= j)) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && n <= 1) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 7.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 105 SDslu, 394 SDs, 0 SdLazy, 225 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, 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, 7 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 127 HoareAnnotationTreeSize, 13 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 101 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 6982 SizeOfPredicates, 10 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 14/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...