java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:34:03,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:03,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:03,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:03,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:03,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:03,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:03,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:03,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:03,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:03,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:03,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:03,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:03,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:03,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:03,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:03,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:03,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:03,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:03,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:03,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:03,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:03,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:03,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:03,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:03,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:03,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:03,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:03,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:03,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:03,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:03,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:03,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:03,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:03,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:03,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:03,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:34:03,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:03,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:03,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:03,307 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:03,307 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:03,307 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:03,308 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:03,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:03,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:03,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:03,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:03,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:03,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:03,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:03,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:03,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:03,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:03,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:03,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:03,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:03,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:03,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:03,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:03,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:03,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:03,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:03,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:03,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:03,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:03,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:03,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:03,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:03,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:03,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:03,383 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:03,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-14 17:34:03,451 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9ca1045/d7ea5358d969486889cad3e3d82cb622/FLAGb433aa423 [2018-11-14 17:34:03,938 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:03,939 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-14 17:34:03,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9ca1045/d7ea5358d969486889cad3e3d82cb622/FLAGb433aa423 [2018-11-14 17:34:03,962 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9ca1045/d7ea5358d969486889cad3e3d82cb622 [2018-11-14 17:34:03,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:03,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:03,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:03,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:03,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:03,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:03" (1/1) ... [2018-11-14 17:34:03,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38854913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:03, skipping insertion in model container [2018-11-14 17:34:03,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:03" (1/1) ... [2018-11-14 17:34:03,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:04,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:04,221 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:04,226 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:04,253 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:04,269 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:04,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04 WrapperNode [2018-11-14 17:34:04,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:04,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:04,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:04,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:04,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... [2018-11-14 17:34:04,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:04,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:04,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:04,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:04,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:34:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:05,366 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:05,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:05 BoogieIcfgContainer [2018-11-14 17:34:05,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:05,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:05,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:05,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:05,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:03" (1/3) ... [2018-11-14 17:34:05,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26de0cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:05, skipping insertion in model container [2018-11-14 17:34:05,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:04" (2/3) ... [2018-11-14 17:34:05,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26de0cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:05, skipping insertion in model container [2018-11-14 17:34:05,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:05" (3/3) ... [2018-11-14 17:34:05,377 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-14 17:34:05,387 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:05,399 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:34:05,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:34:05,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:05,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:05,452 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:05,452 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:05,452 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:05,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:05,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:05,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:05,453 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 17:34:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:34:05,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:05,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:05,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:05,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-11-14 17:34:05,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:05,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:05,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 17:34:05,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:34:05,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #96#return; {48#true} is VALID [2018-11-14 17:34:05,664 INFO L256 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48#true} is VALID [2018-11-14 17:34:05,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {48#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48#true} is VALID [2018-11-14 17:34:05,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {48#true} is VALID [2018-11-14 17:34:05,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48#true} is VALID [2018-11-14 17:34:05,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:34:05,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48#true} is VALID [2018-11-14 17:34:05,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 17:34:05,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume ~l~0 > 1; {49#false} is VALID [2018-11-14 17:34:05,667 INFO L256 TraceCheckUtils]: 11: Hoare triple {49#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {49#false} is VALID [2018-11-14 17:34:05,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-14 17:34:05,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume ~cond == 0; {49#false} is VALID [2018-11-14 17:34:05,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 17:34:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:05,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:05,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:34:05,679 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:34:05,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:05,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:34:05,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:05,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:34:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:34:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:34:05,801 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 17:34:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:06,117 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-11-14 17:34:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:34:06,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:34:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:34:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 141 transitions. [2018-11-14 17:34:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:34:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 141 transitions. [2018-11-14 17:34:06,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 141 transitions. [2018-11-14 17:34:06,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:06,815 INFO L225 Difference]: With dead ends: 83 [2018-11-14 17:34:06,815 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:34:06,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:34:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:34:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:34:07,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:07,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:34:07,123 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:34:07,123 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:34:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:07,132 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-14 17:34:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-14 17:34:07,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:07,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:07,134 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:34:07,134 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:34:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:07,141 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-11-14 17:34:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-14 17:34:07,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:07,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:07,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:07,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:34:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-11-14 17:34:07,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-11-14 17:34:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:07,152 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-14 17:34:07,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:34:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-14 17:34:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:07,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:07,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:07,154 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:07,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-11-14 17:34:07,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:07,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:07,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {311#true} call ULTIMATE.init(); {311#true} is VALID [2018-11-14 17:34:07,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2018-11-14 17:34:07,412 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #96#return; {311#true} is VALID [2018-11-14 17:34:07,412 INFO L256 TraceCheckUtils]: 3: Hoare triple {311#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {311#true} is VALID [2018-11-14 17:34:07,413 INFO L273 TraceCheckUtils]: 4: Hoare triple {311#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {311#true} is VALID [2018-11-14 17:34:07,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {311#true} is VALID [2018-11-14 17:34:07,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {311#true} is VALID [2018-11-14 17:34:07,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#true} assume true; {311#true} is VALID [2018-11-14 17:34:07,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {311#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {313#(<= 2 main_~r~0)} is VALID [2018-11-14 17:34:07,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#(<= 2 main_~r~0)} assume true; {313#(<= 2 main_~r~0)} is VALID [2018-11-14 17:34:07,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {313#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {313#(<= 2 main_~r~0)} is VALID [2018-11-14 17:34:07,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {313#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {314#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:07,474 INFO L256 TraceCheckUtils]: 12: Hoare triple {314#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {315#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:07,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {315#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {316#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:07,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {316#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {312#false} is VALID [2018-11-14 17:34:07,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {312#false} assume !false; {312#false} is VALID [2018-11-14 17:34:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:07,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:07,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:07,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:07,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:07,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:07,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:07,541 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-11-14 17:34:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:08,760 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-11-14 17:34:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:08,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:08,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-14 17:34:08,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:08,973 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:34:08,973 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:34:08,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:34:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-11-14 17:34:09,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:09,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 62 states. [2018-11-14 17:34:09,080 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 62 states. [2018-11-14 17:34:09,080 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 62 states. [2018-11-14 17:34:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:09,089 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-14 17:34:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2018-11-14 17:34:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:09,093 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 75 states. [2018-11-14 17:34:09,093 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 75 states. [2018-11-14 17:34:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:09,101 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2018-11-14 17:34:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2018-11-14 17:34:09,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:09,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:09,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:09,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:34:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-11-14 17:34:09,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-11-14 17:34:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-14 17:34:09,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-11-14 17:34:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:09,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:09,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:09,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:09,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-11-14 17:34:09,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:09,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:09,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2018-11-14 17:34:09,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2018-11-14 17:34:09,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #96#return; {681#true} is VALID [2018-11-14 17:34:09,287 INFO L256 TraceCheckUtils]: 3: Hoare triple {681#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {681#true} is VALID [2018-11-14 17:34:09,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {681#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {681#true} is VALID [2018-11-14 17:34:09,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {681#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {681#true} is VALID [2018-11-14 17:34:09,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {683#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:09,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#(<= 1 main_~l~0)} assume true; {683#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:09,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {683#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {684#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:09,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {684#(<= 2 main_~j~0)} assume true; {684#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:09,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {684#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {684#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:09,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {684#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {684#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:09,329 INFO L256 TraceCheckUtils]: 12: Hoare triple {684#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {685#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:09,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {685#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {686#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:09,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {686#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {682#false} is VALID [2018-11-14 17:34:09,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#false} assume !false; {682#false} is VALID [2018-11-14 17:34:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:09,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:09,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:09,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:09,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:09,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:09,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:09,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:09,353 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-11-14 17:34:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:10,435 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-14 17:34:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:10,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 17:34:10,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-14 17:34:10,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:10,626 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:34:10,627 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 17:34:10,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 17:34:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-11-14 17:34:10,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:10,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 112 states. [2018-11-14 17:34:10,774 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 112 states. [2018-11-14 17:34:10,774 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 112 states. [2018-11-14 17:34:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:10,786 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2018-11-14 17:34:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2018-11-14 17:34:10,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:10,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:10,788 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 119 states. [2018-11-14 17:34:10,788 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 119 states. [2018-11-14 17:34:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:10,799 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2018-11-14 17:34:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2018-11-14 17:34:10,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:10,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:10,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:10,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-14 17:34:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-11-14 17:34:10,812 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-11-14 17:34:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:10,812 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-11-14 17:34:10,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-11-14 17:34:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:34:10,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:10,813 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:10,814 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:10,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-11-14 17:34:10,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:10,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:10,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:10,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:10,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:10,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-14 17:34:10,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-14 17:34:10,981 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #96#return; {1282#true} is VALID [2018-11-14 17:34:10,981 INFO L256 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1282#true} is VALID [2018-11-14 17:34:10,982 INFO L273 TraceCheckUtils]: 4: Hoare triple {1282#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1282#true} is VALID [2018-11-14 17:34:10,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:10,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:10,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume true; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:10,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:10,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume true; {1284#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:10,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {1284#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:34:10,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {1285#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:34:10,993 INFO L256 TraceCheckUtils]: 12: Hoare triple {1285#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1282#true} is VALID [2018-11-14 17:34:10,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} ~cond := #in~cond; {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:10,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:10,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:10,998 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} {1285#(<= main_~j~0 main_~n~0)} #108#return; {1285#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:34:10,999 INFO L256 TraceCheckUtils]: 17: Hoare triple {1285#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:11,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1288#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:11,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {1288#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1283#false} is VALID [2018-11-14 17:34:11,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-14 17:34:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:11,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:11,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:13,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2018-11-14 17:34:13,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2018-11-14 17:34:13,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #96#return; {1282#true} is VALID [2018-11-14 17:34:13,225 INFO L256 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1282#true} is VALID [2018-11-14 17:34:13,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {1282#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1282#true} is VALID [2018-11-14 17:34:13,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {1282#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {1307#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 1 main_~n~0))} is VALID [2018-11-14 17:34:13,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {1307#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 1 main_~n~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-14 17:34:13,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume true; {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-14 17:34:13,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(and (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-14 17:34:13,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume true; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-14 17:34:13,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume !!(~j~0 <= ~r~0); {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-14 17:34:13,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} assume !(~j~0 < ~r~0); {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-14 17:34:13,230 INFO L256 TraceCheckUtils]: 12: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1282#true} is VALID [2018-11-14 17:34:13,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#true} ~cond := #in~cond; {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:13,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:13,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:13,234 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1287#(not (= |__VERIFIER_assert_#in~cond| 0))} {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} #108#return; {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} is VALID [2018-11-14 17:34:13,235 INFO L256 TraceCheckUtils]: 17: Hoare triple {1318#(exists ((main_~l~0 Int)) (and (= main_~j~0 (* 2 main_~l~0)) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {1346#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:13,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1350#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:13,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1283#false} is VALID [2018-11-14 17:34:13,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2018-11-14 17:34:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:13,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:13,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-11-14 17:34:13,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 17:34:13,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:13,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:34:13,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:13,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:34:13,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:34:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:13,348 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 12 states. [2018-11-14 17:34:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:19,864 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2018-11-14 17:34:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:34:19,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 17:34:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:34:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2018-11-14 17:34:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:34:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2018-11-14 17:34:19,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 194 transitions. [2018-11-14 17:34:20,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:20,274 INFO L225 Difference]: With dead ends: 245 [2018-11-14 17:34:20,274 INFO L226 Difference]: Without dead ends: 243 [2018-11-14 17:34:20,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:34:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-14 17:34:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2018-11-14 17:34:21,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:21,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 202 states. [2018-11-14 17:34:21,005 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 202 states. [2018-11-14 17:34:21,006 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 202 states. [2018-11-14 17:34:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:21,024 INFO L93 Difference]: Finished difference Result 243 states and 385 transitions. [2018-11-14 17:34:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 385 transitions. [2018-11-14 17:34:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:21,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:21,027 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 243 states. [2018-11-14 17:34:21,028 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 243 states. [2018-11-14 17:34:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:21,046 INFO L93 Difference]: Finished difference Result 243 states and 385 transitions. [2018-11-14 17:34:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 385 transitions. [2018-11-14 17:34:21,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:21,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:21,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:21,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-14 17:34:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 323 transitions. [2018-11-14 17:34:21,063 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 323 transitions. Word has length 21 [2018-11-14 17:34:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:21,063 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 323 transitions. [2018-11-14 17:34:21,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:34:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 323 transitions. [2018-11-14 17:34:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:34:21,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:21,065 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:21,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:21,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-11-14 17:34:21,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:21,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:21,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:21,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:21,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:21,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2018-11-14 17:34:21,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-14 17:34:21,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2548#true} {2548#true} #96#return; {2548#true} is VALID [2018-11-14 17:34:21,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {2548#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2548#true} is VALID [2018-11-14 17:34:21,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {2548#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2548#true} is VALID [2018-11-14 17:34:21,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {2548#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {2548#true} is VALID [2018-11-14 17:34:21,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {2548#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2550#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:21,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {2550#(<= 1 main_~l~0)} assume true; {2550#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:21,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {2550#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {2551#(<= 1 main_~i~0)} assume true; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {2551#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {2551#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,227 INFO L256 TraceCheckUtils]: 12: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {2548#true} is VALID [2018-11-14 17:34:21,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#true} ~cond := #in~cond; {2552#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:21,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {2552#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:21,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:21,237 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} {2551#(<= 1 main_~i~0)} #108#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,238 INFO L256 TraceCheckUtils]: 17: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {2548#true} is VALID [2018-11-14 17:34:21,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-14 17:34:21,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {2548#true} assume !(~cond == 0); {2548#true} is VALID [2018-11-14 17:34:21,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-14 17:34:21,240 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #110#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {2551#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {2551#(<= 1 main_~i~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,242 INFO L256 TraceCheckUtils]: 24: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:21,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {2553#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2554#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:21,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {2554#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {2549#false} is VALID [2018-11-14 17:34:21,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2018-11-14 17:34:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 17:34:21,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:21,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:21,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:21,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2018-11-14 17:34:21,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-14 17:34:21,384 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2548#true} {2548#true} #96#return; {2548#true} is VALID [2018-11-14 17:34:21,385 INFO L256 TraceCheckUtils]: 3: Hoare triple {2548#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2548#true} is VALID [2018-11-14 17:34:21,385 INFO L273 TraceCheckUtils]: 4: Hoare triple {2548#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2548#true} is VALID [2018-11-14 17:34:21,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {2548#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {2548#true} is VALID [2018-11-14 17:34:21,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {2548#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2550#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:21,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {2550#(<= 1 main_~l~0)} assume true; {2550#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:21,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {2550#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {2551#(<= 1 main_~i~0)} assume true; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {2551#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {2551#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,410 INFO L256 TraceCheckUtils]: 12: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {2548#true} is VALID [2018-11-14 17:34:21,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-14 17:34:21,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {2548#true} assume !(~cond == 0); {2548#true} is VALID [2018-11-14 17:34:21,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-14 17:34:21,412 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #108#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,412 INFO L256 TraceCheckUtils]: 17: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {2548#true} is VALID [2018-11-14 17:34:21,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2018-11-14 17:34:21,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {2548#true} assume !(~cond == 0); {2548#true} is VALID [2018-11-14 17:34:21,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {2548#true} assume true; {2548#true} is VALID [2018-11-14 17:34:21,423 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2548#true} {2551#(<= 1 main_~i~0)} #110#return; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {2551#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {2551#(<= 1 main_~i~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {2551#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:21,426 INFO L256 TraceCheckUtils]: 24: Hoare triple {2551#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {2630#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:21,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {2630#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2634#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:21,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {2634#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {2549#false} is VALID [2018-11-14 17:34:21,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2018-11-14 17:34:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:34:21,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:21,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-14 17:34:21,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-14 17:34:21,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:21,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:21,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:21,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:21,498 INFO L87 Difference]: Start difference. First operand 202 states and 323 transitions. Second operand 9 states. [2018-11-14 17:34:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:24,640 INFO L93 Difference]: Finished difference Result 260 states and 408 transitions. [2018-11-14 17:34:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:34:24,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-14 17:34:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 17:34:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 17:34:24,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2018-11-14 17:34:24,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:24,891 INFO L225 Difference]: With dead ends: 260 [2018-11-14 17:34:24,891 INFO L226 Difference]: Without dead ends: 258 [2018-11-14 17:34:24,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-14 17:34:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2018-11-14 17:34:25,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:25,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 235 states. [2018-11-14 17:34:25,808 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 235 states. [2018-11-14 17:34:25,809 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 235 states. [2018-11-14 17:34:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:25,826 INFO L93 Difference]: Finished difference Result 258 states and 406 transitions. [2018-11-14 17:34:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 406 transitions. [2018-11-14 17:34:25,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:25,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:25,829 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 258 states. [2018-11-14 17:34:25,829 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 258 states. [2018-11-14 17:34:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:25,845 INFO L93 Difference]: Finished difference Result 258 states and 406 transitions. [2018-11-14 17:34:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 406 transitions. [2018-11-14 17:34:25,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:25,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:25,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:25,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-14 17:34:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2018-11-14 17:34:25,862 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 28 [2018-11-14 17:34:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:25,862 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2018-11-14 17:34:25,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2018-11-14 17:34:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:34:25,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:25,864 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:25,864 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:25,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-11-14 17:34:25,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:25,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:26,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {3926#true} call ULTIMATE.init(); {3926#true} is VALID [2018-11-14 17:34:26,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,313 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3926#true} {3926#true} #96#return; {3926#true} is VALID [2018-11-14 17:34:26,314 INFO L256 TraceCheckUtils]: 3: Hoare triple {3926#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3926#true} is VALID [2018-11-14 17:34:26,314 INFO L273 TraceCheckUtils]: 4: Hoare triple {3926#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3926#true} is VALID [2018-11-14 17:34:26,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {3926#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,321 INFO L256 TraceCheckUtils]: 12: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {3926#true} ~cond := #in~cond; {3930#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:26,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {3930#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:26,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:26,324 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3929#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,324 INFO L256 TraceCheckUtils]: 17: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-14 17:34:26,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {3926#true} assume !(~cond == 0); {3926#true} is VALID [2018-11-14 17:34:26,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,326 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,326 INFO L256 TraceCheckUtils]: 22: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 + 1 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-14 17:34:26,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {3926#true} assume !(~cond == 0); {3926#true} is VALID [2018-11-14 17:34:26,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,332 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,333 INFO L256 TraceCheckUtils]: 27: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 + 1 <= ~n~0 then 1 else 0)); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:26,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3932#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:26,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {3932#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {3927#false} is VALID [2018-11-14 17:34:26,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {3927#false} assume !false; {3927#false} is VALID [2018-11-14 17:34:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:34:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:26,335 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-14 17:34:26,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:26,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:26,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {3926#true} call ULTIMATE.init(); {3926#true} is VALID [2018-11-14 17:34:26,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,443 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3926#true} {3926#true} #96#return; {3926#true} is VALID [2018-11-14 17:34:26,444 INFO L256 TraceCheckUtils]: 3: Hoare triple {3926#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3926#true} is VALID [2018-11-14 17:34:26,444 INFO L273 TraceCheckUtils]: 4: Hoare triple {3926#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3926#true} is VALID [2018-11-14 17:34:26,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {3926#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume true; {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3928#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:26,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {3928#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,449 INFO L256 TraceCheckUtils]: 12: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-14 17:34:26,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {3926#true} assume !(~cond == 0); {3926#true} is VALID [2018-11-14 17:34:26,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,451 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,452 INFO L256 TraceCheckUtils]: 17: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-14 17:34:26,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {3926#true} assume !(~cond == 0); {3926#true} is VALID [2018-11-14 17:34:26,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,453 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,454 INFO L256 TraceCheckUtils]: 22: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 + 1 then 1 else 0)); {3926#true} is VALID [2018-11-14 17:34:26,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {3926#true} ~cond := #in~cond; {3926#true} is VALID [2018-11-14 17:34:26,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {3926#true} assume !(~cond == 0); {3926#true} is VALID [2018-11-14 17:34:26,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {3926#true} assume true; {3926#true} is VALID [2018-11-14 17:34:26,460 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3926#true} {3929#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {3929#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:34:26,461 INFO L256 TraceCheckUtils]: 27: Hoare triple {3929#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 + 1 <= ~n~0 then 1 else 0)); {4017#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:26,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {4017#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4021#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:26,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {4021#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {3927#false} is VALID [2018-11-14 17:34:26,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {3927#false} assume !false; {3927#false} is VALID [2018-11-14 17:34:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 17:34:26,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:26,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-14 17:34:26,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 17:34:26,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:26,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:26,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:26,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:26,540 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand 9 states. [2018-11-14 17:34:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:29,905 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2018-11-14 17:34:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:29,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 17:34:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-14 17:34:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-14 17:34:29,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-14 17:34:30,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:30,260 INFO L225 Difference]: With dead ends: 317 [2018-11-14 17:34:30,260 INFO L226 Difference]: Without dead ends: 315 [2018-11-14 17:34:30,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-14 17:34:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2018-11-14 17:34:32,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:32,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand 288 states. [2018-11-14 17:34:32,119 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand 288 states. [2018-11-14 17:34:32,119 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 288 states. [2018-11-14 17:34:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,140 INFO L93 Difference]: Finished difference Result 315 states and 501 transitions. [2018-11-14 17:34:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 501 transitions. [2018-11-14 17:34:32,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,143 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand 315 states. [2018-11-14 17:34:32,143 INFO L87 Difference]: Start difference. First operand 288 states. Second operand 315 states. [2018-11-14 17:34:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:32,165 INFO L93 Difference]: Finished difference Result 315 states and 501 transitions. [2018-11-14 17:34:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 501 transitions. [2018-11-14 17:34:32,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:32,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:32,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:32,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-14 17:34:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 463 transitions. [2018-11-14 17:34:32,188 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 463 transitions. Word has length 31 [2018-11-14 17:34:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:32,188 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 463 transitions. [2018-11-14 17:34:32,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 463 transitions. [2018-11-14 17:34:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:34:32,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:32,190 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:32,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:32,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-11-14 17:34:32,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:32,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:32,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2018-11-14 17:34:32,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:32,622 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #96#return; {5602#true} is VALID [2018-11-14 17:34:32,623 INFO L256 TraceCheckUtils]: 3: Hoare triple {5602#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5602#true} is VALID [2018-11-14 17:34:32,623 INFO L273 TraceCheckUtils]: 4: Hoare triple {5602#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5602#true} is VALID [2018-11-14 17:34:32,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {5602#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {5604#(<= (* 2 main_~l~0) (+ main_~n~0 2))} is VALID [2018-11-14 17:34:32,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {5604#(<= (* 2 main_~l~0) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {5605#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {5605#(<= (+ main_~l~0 1) main_~n~0)} assume true; {5605#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {5605#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume true; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,629 INFO L256 TraceCheckUtils]: 12: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:32,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {5602#true} ~cond := #in~cond; {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:32,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:32,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:32,633 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} {5606#(<= (+ main_~i~0 1) main_~n~0)} #108#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,633 INFO L256 TraceCheckUtils]: 17: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:32,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-14 17:34:32,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#true} assume !(~cond == 0); {5602#true} is VALID [2018-11-14 17:34:32,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:32,640 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5602#true} {5606#(<= (+ main_~i~0 1) main_~n~0)} #110#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,644 INFO L256 TraceCheckUtils]: 24: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:32,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-14 17:34:32,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {5602#true} assume !(~cond == 0); {5602#true} is VALID [2018-11-14 17:34:32,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:32,646 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5602#true} {5606#(<= (+ main_~i~0 1) main_~n~0)} #112#return; {5606#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2018-11-14 17:34:32,648 INFO L256 TraceCheckUtils]: 29: Hoare triple {5606#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:32,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5609#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:32,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {5609#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {5603#false} is VALID [2018-11-14 17:34:32,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2018-11-14 17:34:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:34:32,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:32,651 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-14 17:34:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:32,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:33,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2018-11-14 17:34:33,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:33,127 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #96#return; {5602#true} is VALID [2018-11-14 17:34:33,127 INFO L256 TraceCheckUtils]: 3: Hoare triple {5602#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5602#true} is VALID [2018-11-14 17:34:33,127 INFO L273 TraceCheckUtils]: 4: Hoare triple {5602#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5602#true} is VALID [2018-11-14 17:34:33,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {5602#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {5628#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 1 main_~n~0))} is VALID [2018-11-14 17:34:33,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {5628#(and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= main_~r~0 main_~n~0) (<= 1 main_~n~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-14 17:34:33,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume true; {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} is VALID [2018-11-14 17:34:33,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {5632#(and (<= main_~r~0 main_~n~0) (< 0 main_~l~0) (<= main_~l~0 (div main_~n~0 2)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume true; {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume !!(~j~0 <= ~r~0); {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} assume !(~j~0 < ~r~0); {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,134 INFO L256 TraceCheckUtils]: 12: Hoare triple {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:33,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {5602#true} ~cond := #in~cond; {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:33,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {5607#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:33,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:33,143 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {5608#(not (= |__VERIFIER_assert_#in~cond| 0))} {5639#(and (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0))} #108#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,144 INFO L256 TraceCheckUtils]: 17: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:33,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-14 17:34:33,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#true} assume !(~cond == 0); {5602#true} is VALID [2018-11-14 17:34:33,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:33,145 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5602#true} {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} #110#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} assume !(#t~nondet5 != 0);havoc #t~nondet5; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,146 INFO L256 TraceCheckUtils]: 24: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {5602#true} is VALID [2018-11-14 17:34:33,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {5602#true} ~cond := #in~cond; {5602#true} is VALID [2018-11-14 17:34:33,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {5602#true} assume !(~cond == 0); {5602#true} is VALID [2018-11-14 17:34:33,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {5602#true} assume true; {5602#true} is VALID [2018-11-14 17:34:33,148 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5602#true} {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} #112#return; {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} is VALID [2018-11-14 17:34:33,149 INFO L256 TraceCheckUtils]: 29: Hoare triple {5664#(and (<= main_~i~0 (div main_~n~0 2)) (< 0 main_~i~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {5704#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:33,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {5704#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5708#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:33,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {5708#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {5603#false} is VALID [2018-11-14 17:34:33,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2018-11-14 17:34:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:34:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-11-14 17:34:33,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 17:34:33,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:33,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:34:33,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:33,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:34:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:34:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:33,221 INFO L87 Difference]: Start difference. First operand 288 states and 463 transitions. Second operand 14 states. [2018-11-14 17:34:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:38,706 INFO L93 Difference]: Finished difference Result 382 states and 598 transitions. [2018-11-14 17:34:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:34:38,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-14 17:34:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:34:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 250 transitions. [2018-11-14 17:34:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:34:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 250 transitions. [2018-11-14 17:34:38,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 250 transitions. [2018-11-14 17:34:39,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:39,208 INFO L225 Difference]: With dead ends: 382 [2018-11-14 17:34:39,208 INFO L226 Difference]: Without dead ends: 380 [2018-11-14 17:34:39,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:34:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-14 17:34:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 337. [2018-11-14 17:34:40,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:40,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand 337 states. [2018-11-14 17:34:40,242 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand 337 states. [2018-11-14 17:34:40,242 INFO L87 Difference]: Start difference. First operand 380 states. Second operand 337 states. [2018-11-14 17:34:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:40,267 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2018-11-14 17:34:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2018-11-14 17:34:40,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:40,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:40,271 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 380 states. [2018-11-14 17:34:40,271 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 380 states. [2018-11-14 17:34:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:40,295 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2018-11-14 17:34:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2018-11-14 17:34:40,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:40,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:40,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:40,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-14 17:34:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 531 transitions. [2018-11-14 17:34:40,319 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 531 transitions. Word has length 33 [2018-11-14 17:34:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:40,319 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 531 transitions. [2018-11-14 17:34:40,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:34:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 531 transitions. [2018-11-14 17:34:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:34:40,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:40,320 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:40,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:40,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1831965438, now seen corresponding path program 1 times [2018-11-14 17:34:40,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:40,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:40,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:40,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:40,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {7601#true} call ULTIMATE.init(); {7601#true} is VALID [2018-11-14 17:34:40,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,624 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7601#true} {7601#true} #96#return; {7601#true} is VALID [2018-11-14 17:34:40,624 INFO L256 TraceCheckUtils]: 3: Hoare triple {7601#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7601#true} is VALID [2018-11-14 17:34:40,624 INFO L273 TraceCheckUtils]: 4: Hoare triple {7601#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7601#true} is VALID [2018-11-14 17:34:40,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {7601#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {7601#true} is VALID [2018-11-14 17:34:40,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {7601#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7601#true} is VALID [2018-11-14 17:34:40,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {7601#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7601#true} is VALID [2018-11-14 17:34:40,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {7601#true} assume !(~j~0 <= ~r~0); {7601#true} is VALID [2018-11-14 17:34:40,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {7601#true} assume ~l~0 > 1; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,627 INFO L256 TraceCheckUtils]: 12: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7601#true} is VALID [2018-11-14 17:34:40,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {7601#true} ~cond := #in~cond; {7604#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:40,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {7604#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:40,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:40,629 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} {7603#(<= 2 main_~l~0)} #120#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,629 INFO L256 TraceCheckUtils]: 17: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7601#true} is VALID [2018-11-14 17:34:40,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-14 17:34:40,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {7601#true} assume !(~cond == 0); {7601#true} is VALID [2018-11-14 17:34:40,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,631 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #122#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {7603#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7606#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:40,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {7606#(<= 1 main_~l~0)} assume true; {7606#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:40,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {7606#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {7607#(<= 2 main_~j~0)} assume true; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {7607#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {7607#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,635 INFO L256 TraceCheckUtils]: 28: Hoare triple {7607#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:40,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {7605#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7608#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:40,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {7608#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {7602#false} is VALID [2018-11-14 17:34:40,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {7602#false} assume !false; {7602#false} is VALID [2018-11-14 17:34:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 17:34:40,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:40,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:40,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:40,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {7601#true} call ULTIMATE.init(); {7601#true} is VALID [2018-11-14 17:34:40,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,754 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7601#true} {7601#true} #96#return; {7601#true} is VALID [2018-11-14 17:34:40,754 INFO L256 TraceCheckUtils]: 3: Hoare triple {7601#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7601#true} is VALID [2018-11-14 17:34:40,755 INFO L273 TraceCheckUtils]: 4: Hoare triple {7601#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7601#true} is VALID [2018-11-14 17:34:40,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {7601#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {7601#true} is VALID [2018-11-14 17:34:40,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {7601#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7601#true} is VALID [2018-11-14 17:34:40,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {7601#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7601#true} is VALID [2018-11-14 17:34:40,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {7601#true} assume !(~j~0 <= ~r~0); {7601#true} is VALID [2018-11-14 17:34:40,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {7601#true} assume ~l~0 > 1; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,757 INFO L256 TraceCheckUtils]: 12: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7601#true} is VALID [2018-11-14 17:34:40,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-14 17:34:40,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {7601#true} assume !(~cond == 0); {7601#true} is VALID [2018-11-14 17:34:40,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,758 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #120#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,758 INFO L256 TraceCheckUtils]: 17: Hoare triple {7603#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7601#true} is VALID [2018-11-14 17:34:40,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {7601#true} ~cond := #in~cond; {7601#true} is VALID [2018-11-14 17:34:40,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {7601#true} assume !(~cond == 0); {7601#true} is VALID [2018-11-14 17:34:40,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {7601#true} assume true; {7601#true} is VALID [2018-11-14 17:34:40,759 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {7601#true} {7603#(<= 2 main_~l~0)} #122#return; {7603#(<= 2 main_~l~0)} is VALID [2018-11-14 17:34:40,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {7603#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7606#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:40,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {7606#(<= 1 main_~l~0)} assume true; {7606#(<= 1 main_~l~0)} is VALID [2018-11-14 17:34:40,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {7606#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {7607#(<= 2 main_~j~0)} assume true; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {7607#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {7607#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {7607#(<= 2 main_~j~0)} is VALID [2018-11-14 17:34:40,762 INFO L256 TraceCheckUtils]: 28: Hoare triple {7607#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7696#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:40,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {7696#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7700#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:40,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {7700#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {7602#false} is VALID [2018-11-14 17:34:40,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {7602#false} assume !false; {7602#false} is VALID [2018-11-14 17:34:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:34:40,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:40,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-14 17:34:40,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 17:34:40,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:40,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:34:40,815 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-14 17:34:40,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:34:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:34:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:40,816 INFO L87 Difference]: Start difference. First operand 337 states and 531 transitions. Second operand 10 states. [2018-11-14 17:34:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:43,802 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2018-11-14 17:34:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:34:43,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-14 17:34:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-14 17:34:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-14 17:34:43,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-14 17:34:44,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:44,263 INFO L225 Difference]: With dead ends: 351 [2018-11-14 17:34:44,264 INFO L226 Difference]: Without dead ends: 349 [2018-11-14 17:34:44,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-14 17:34:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-11-14 17:34:46,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:46,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand 345 states. [2018-11-14 17:34:46,247 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand 345 states. [2018-11-14 17:34:46,247 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 345 states. [2018-11-14 17:34:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,265 INFO L93 Difference]: Finished difference Result 349 states and 541 transitions. [2018-11-14 17:34:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 541 transitions. [2018-11-14 17:34:46,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,268 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand 349 states. [2018-11-14 17:34:46,268 INFO L87 Difference]: Start difference. First operand 345 states. Second operand 349 states. [2018-11-14 17:34:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,285 INFO L93 Difference]: Finished difference Result 349 states and 541 transitions. [2018-11-14 17:34:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 541 transitions. [2018-11-14 17:34:46,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:46,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-14 17:34:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2018-11-14 17:34:46,304 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 32 [2018-11-14 17:34:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:46,305 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2018-11-14 17:34:46,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:34:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2018-11-14 17:34:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:34:46,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:46,306 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:46,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:46,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-11-14 17:34:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:47,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-14 17:34:47,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,001 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9487#true} {9487#true} #96#return; {9487#true} is VALID [2018-11-14 17:34:47,001 INFO L256 TraceCheckUtils]: 3: Hoare triple {9487#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {9487#true} is VALID [2018-11-14 17:34:47,001 INFO L273 TraceCheckUtils]: 4: Hoare triple {9487#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9487#true} is VALID [2018-11-14 17:34:47,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {9489#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:47,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-14 17:34:47,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume true; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-14 17:34:47,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:47,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} assume true; {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:47,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {9491#(<= (+ (* 2 main_~i~0) main_~r~0 4) (+ main_~j~0 (* 2 main_~n~0)))} assume !!(~j~0 <= ~r~0); {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,007 INFO L256 TraceCheckUtils]: 12: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} ~cond := #in~cond; {9493#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:47,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {9493#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:47,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:47,015 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} {9492#(<= (+ main_~i~0 2) main_~n~0)} #108#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,015 INFO L256 TraceCheckUtils]: 17: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-14 17:34:47,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !(~cond == 0); {9487#true} is VALID [2018-11-14 17:34:47,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,018 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9487#true} {9492#(<= (+ main_~i~0 2) main_~n~0)} #110#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,019 INFO L256 TraceCheckUtils]: 24: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-14 17:34:47,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} assume !(~cond == 0); {9487#true} is VALID [2018-11-14 17:34:47,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,020 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9487#true} {9492#(<= (+ main_~i~0 2) main_~n~0)} #112#return; {9492#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2018-11-14 17:34:47,020 INFO L256 TraceCheckUtils]: 29: Hoare triple {9492#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:47,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {9494#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9495#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:47,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {9495#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {9488#false} is VALID [2018-11-14 17:34:47,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-14 17:34:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:34:47,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:47,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:47,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:47,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:47,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {9487#true} call ULTIMATE.init(); {9487#true} is VALID [2018-11-14 17:34:47,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,357 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9487#true} {9487#true} #96#return; {9487#true} is VALID [2018-11-14 17:34:47,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {9487#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {9487#true} is VALID [2018-11-14 17:34:47,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {9487#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9487#true} is VALID [2018-11-14 17:34:47,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {9487#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {9489#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:34:47,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {9489#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-14 17:34:47,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume true; {9490#(<= (+ main_~r~0 1) main_~n~0)} is VALID [2018-11-14 17:34:47,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {9490#(<= (+ main_~r~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} is VALID [2018-11-14 17:34:47,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} assume true; {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} is VALID [2018-11-14 17:34:47,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(and (< 1 main_~r~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0))} assume !!(~j~0 <= ~r~0); {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume !(~j~0 < ~r~0); {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,365 INFO L256 TraceCheckUtils]: 12: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-14 17:34:47,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {9487#true} assume !(~cond == 0); {9487#true} is VALID [2018-11-14 17:34:47,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,369 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #108#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,369 INFO L256 TraceCheckUtils]: 17: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-14 17:34:47,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {9487#true} assume !(~cond == 0); {9487#true} is VALID [2018-11-14 17:34:47,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,378 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #110#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} assume !(#t~nondet5 != 0);havoc #t~nondet5; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,381 INFO L256 TraceCheckUtils]: 24: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {9487#true} is VALID [2018-11-14 17:34:47,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {9487#true} ~cond := #in~cond; {9487#true} is VALID [2018-11-14 17:34:47,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {9487#true} assume !(~cond == 0); {9487#true} is VALID [2018-11-14 17:34:47,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {9487#true} assume true; {9487#true} is VALID [2018-11-14 17:34:47,384 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9487#true} {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} #112#return; {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} is VALID [2018-11-14 17:34:47,387 INFO L256 TraceCheckUtils]: 29: Hoare triple {9530#(and (<= 3 main_~n~0) (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0))))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {9588#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:47,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {9588#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9592#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:47,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {9592#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {9488#false} is VALID [2018-11-14 17:34:47,388 INFO L273 TraceCheckUtils]: 32: Hoare triple {9488#false} assume !false; {9488#false} is VALID [2018-11-14 17:34:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 17:34:47,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:47,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-11-14 17:34:47,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 17:34:47,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:47,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:34:47,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:47,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:34:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:34:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:34:47,504 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand 13 states. [2018-11-14 17:34:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:53,583 INFO L93 Difference]: Finished difference Result 570 states and 913 transitions. [2018-11-14 17:34:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:34:53,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 17:34:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:34:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2018-11-14 17:34:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:34:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2018-11-14 17:34:53,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 130 transitions. [2018-11-14 17:34:54,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:54,256 INFO L225 Difference]: With dead ends: 570 [2018-11-14 17:34:54,256 INFO L226 Difference]: Without dead ends: 568 [2018-11-14 17:34:54,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:34:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-11-14 17:35:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 533. [2018-11-14 17:35:00,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:00,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand 533 states. [2018-11-14 17:35:00,135 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand 533 states. [2018-11-14 17:35:00,135 INFO L87 Difference]: Start difference. First operand 568 states. Second operand 533 states. [2018-11-14 17:35:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,169 INFO L93 Difference]: Finished difference Result 568 states and 911 transitions. [2018-11-14 17:35:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 911 transitions. [2018-11-14 17:35:00,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,174 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand 568 states. [2018-11-14 17:35:00,174 INFO L87 Difference]: Start difference. First operand 533 states. Second operand 568 states. [2018-11-14 17:35:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,211 INFO L93 Difference]: Finished difference Result 568 states and 911 transitions. [2018-11-14 17:35:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 911 transitions. [2018-11-14 17:35:00,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:00,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-14 17:35:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2018-11-14 17:35:00,249 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 33 [2018-11-14 17:35:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:00,249 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2018-11-14 17:35:00,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:35:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2018-11-14 17:35:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:35:00,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:00,251 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:00,251 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:00,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-11-14 17:35:00,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:00,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:00,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:00,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:00,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:00,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {12467#true} call ULTIMATE.init(); {12467#true} is VALID [2018-11-14 17:35:00,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,653 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12467#true} {12467#true} #96#return; {12467#true} is VALID [2018-11-14 17:35:00,654 INFO L256 TraceCheckUtils]: 3: Hoare triple {12467#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12467#true} is VALID [2018-11-14 17:35:00,654 INFO L273 TraceCheckUtils]: 4: Hoare triple {12467#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12467#true} is VALID [2018-11-14 17:35:00,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {12467#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,657 INFO L256 TraceCheckUtils]: 12: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {12467#true} ~cond := #in~cond; {12471#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:35:00,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {12471#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:00,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:00,667 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} {12470#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,667 INFO L256 TraceCheckUtils]: 17: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,668 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,668 INFO L256 TraceCheckUtils]: 22: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 + 1 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,669 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,669 INFO L256 TraceCheckUtils]: 27: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 + 1 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,670 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #106#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume #t~nondet4 != 0;havoc #t~nondet4;~j~0 := ~j~0 + 1; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:35:00,671 INFO L256 TraceCheckUtils]: 34: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,672 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {12467#true} {12473#(<= main_~j~0 main_~n~0)} #108#return; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:35:00,673 INFO L256 TraceCheckUtils]: 39: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:00,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {12472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12474#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:35:00,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {12474#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {12468#false} is VALID [2018-11-14 17:35:00,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {12468#false} assume !false; {12468#false} is VALID [2018-11-14 17:35:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-14 17:35:00,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:00,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:35:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:00,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:00,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {12467#true} call ULTIMATE.init(); {12467#true} is VALID [2018-11-14 17:35:00,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,807 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12467#true} {12467#true} #96#return; {12467#true} is VALID [2018-11-14 17:35:00,808 INFO L256 TraceCheckUtils]: 3: Hoare triple {12467#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12467#true} is VALID [2018-11-14 17:35:00,808 INFO L273 TraceCheckUtils]: 4: Hoare triple {12467#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12467#true} is VALID [2018-11-14 17:35:00,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {12467#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume true; {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {12469#(<= main_~r~0 main_~n~0)} is VALID [2018-11-14 17:35:00,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {12469#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,812 INFO L256 TraceCheckUtils]: 12: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,813 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #100#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,813 INFO L256 TraceCheckUtils]: 17: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,814 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #102#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,814 INFO L256 TraceCheckUtils]: 22: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 + 1 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,815 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #104#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,816 INFO L256 TraceCheckUtils]: 27: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 + 1 <= ~n~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,816 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {12467#true} {12470#(<= (+ main_~j~0 1) main_~n~0)} #106#return; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12470#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2018-11-14 17:35:00,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {12470#(<= (+ main_~j~0 1) main_~n~0)} assume #t~nondet4 != 0;havoc #t~nondet4;~j~0 := ~j~0 + 1; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:35:00,817 INFO L256 TraceCheckUtils]: 34: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12467#true} is VALID [2018-11-14 17:35:00,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {12467#true} ~cond := #in~cond; {12467#true} is VALID [2018-11-14 17:35:00,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {12467#true} assume !(~cond == 0); {12467#true} is VALID [2018-11-14 17:35:00,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {12467#true} assume true; {12467#true} is VALID [2018-11-14 17:35:00,818 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {12467#true} {12473#(<= main_~j~0 main_~n~0)} #108#return; {12473#(<= main_~j~0 main_~n~0)} is VALID [2018-11-14 17:35:00,819 INFO L256 TraceCheckUtils]: 39: Hoare triple {12473#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12595#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:00,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {12595#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {12599#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:00,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {12599#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {12468#false} is VALID [2018-11-14 17:35:00,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {12468#false} assume !false; {12468#false} is VALID [2018-11-14 17:35:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 17:35:00,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-14 17:35:00,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-14 17:35:00,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:00,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:35:00,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:00,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:35:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:35:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:00,880 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand 10 states. [2018-11-14 17:35:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:08,966 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2018-11-14 17:35:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:35:08,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-14 17:35:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 17:35:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 17:35:08,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-14 17:35:09,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:09,471 INFO L225 Difference]: With dead ends: 609 [2018-11-14 17:35:09,472 INFO L226 Difference]: Without dead ends: 607 [2018-11-14 17:35:09,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-14 17:35:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2018-11-14 17:35:14,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:14,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand 537 states. [2018-11-14 17:35:14,891 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand 537 states. [2018-11-14 17:35:14,891 INFO L87 Difference]: Start difference. First operand 607 states. Second operand 537 states. [2018-11-14 17:35:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,925 INFO L93 Difference]: Finished difference Result 607 states and 970 transitions. [2018-11-14 17:35:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2018-11-14 17:35:14,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,929 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand 607 states. [2018-11-14 17:35:14,929 INFO L87 Difference]: Start difference. First operand 537 states. Second operand 607 states. [2018-11-14 17:35:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,963 INFO L93 Difference]: Finished difference Result 607 states and 970 transitions. [2018-11-14 17:35:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2018-11-14 17:35:14,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:14,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-14 17:35:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2018-11-14 17:35:14,996 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 43 [2018-11-14 17:35:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:14,996 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2018-11-14 17:35:14,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:35:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2018-11-14 17:35:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:35:14,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:14,998 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:14,998 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:14,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 351208904, now seen corresponding path program 1 times [2018-11-14 17:35:14,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:14,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:15,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {15609#true} call ULTIMATE.init(); {15609#true} is VALID [2018-11-14 17:35:15,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15609#true} {15609#true} #96#return; {15609#true} is VALID [2018-11-14 17:35:15,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {15609#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {15609#true} is VALID [2018-11-14 17:35:15,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {15609#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15609#true} is VALID [2018-11-14 17:35:15,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {15609#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {15609#true} is VALID [2018-11-14 17:35:15,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {15609#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {15609#true} is VALID [2018-11-14 17:35:15,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {15609#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15609#true} is VALID [2018-11-14 17:35:15,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {15609#true} assume !(~j~0 <= ~r~0); {15609#true} is VALID [2018-11-14 17:35:15,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {15609#true} assume ~l~0 > 1; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,357 INFO L256 TraceCheckUtils]: 12: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {15609#true} ~cond := #in~cond; {15612#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:35:15,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {15612#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:15,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:15,358 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} {15611#(<= 2 main_~l~0)} #120#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,358 INFO L256 TraceCheckUtils]: 17: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,359 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #122#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {15611#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {15614#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:15,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {15614#(<= 1 main_~l~0)} assume true; {15614#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:15,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {15614#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {15615#(<= 1 main_~i~0)} assume true; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {15615#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {15615#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,376 INFO L256 TraceCheckUtils]: 28: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,377 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #108#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,377 INFO L256 TraceCheckUtils]: 33: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,378 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #110#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {15615#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {15615#(<= 1 main_~i~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,379 INFO L256 TraceCheckUtils]: 40: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:15,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {15613#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:35:15,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {15616#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {15610#false} is VALID [2018-11-14 17:35:15,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {15610#false} assume !false; {15610#false} is VALID [2018-11-14 17:35:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:35:15,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:15,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:35:15,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:15,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:15,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {15609#true} call ULTIMATE.init(); {15609#true} is VALID [2018-11-14 17:35:15,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15609#true} {15609#true} #96#return; {15609#true} is VALID [2018-11-14 17:35:15,486 INFO L256 TraceCheckUtils]: 3: Hoare triple {15609#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {15609#true} is VALID [2018-11-14 17:35:15,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {15609#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15609#true} is VALID [2018-11-14 17:35:15,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {15609#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {15609#true} is VALID [2018-11-14 17:35:15,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {15609#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {15609#true} is VALID [2018-11-14 17:35:15,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {15609#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15609#true} is VALID [2018-11-14 17:35:15,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {15609#true} assume !(~j~0 <= ~r~0); {15609#true} is VALID [2018-11-14 17:35:15,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {15609#true} assume ~l~0 > 1; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,488 INFO L256 TraceCheckUtils]: 12: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,489 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #120#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,489 INFO L256 TraceCheckUtils]: 17: Hoare triple {15611#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,490 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {15609#true} {15611#(<= 2 main_~l~0)} #122#return; {15611#(<= 2 main_~l~0)} is VALID [2018-11-14 17:35:15,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {15611#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {15614#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:15,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {15614#(<= 1 main_~l~0)} assume true; {15614#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:15,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {15614#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {15615#(<= 1 main_~i~0)} assume true; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {15615#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {15615#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,493 INFO L256 TraceCheckUtils]: 28: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,495 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #108#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,495 INFO L256 TraceCheckUtils]: 33: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {15609#true} is VALID [2018-11-14 17:35:15,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {15609#true} ~cond := #in~cond; {15609#true} is VALID [2018-11-14 17:35:15,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {15609#true} assume !(~cond == 0); {15609#true} is VALID [2018-11-14 17:35:15,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {15609#true} assume true; {15609#true} is VALID [2018-11-14 17:35:15,496 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {15609#true} {15615#(<= 1 main_~i~0)} #110#return; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {15615#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,497 INFO L273 TraceCheckUtils]: 39: Hoare triple {15615#(<= 1 main_~i~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {15615#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:15,498 INFO L256 TraceCheckUtils]: 40: Hoare triple {15615#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {15740#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:15,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {15740#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {15744#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:35:15,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {15744#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {15610#false} is VALID [2018-11-14 17:35:15,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {15610#false} assume !false; {15610#false} is VALID [2018-11-14 17:35:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 17:35:15,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:15,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-11-14 17:35:15,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 17:35:15,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:15,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:35:15,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:35:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:35:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:15,630 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand 10 states. [2018-11-14 17:35:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:21,165 INFO L93 Difference]: Finished difference Result 573 states and 918 transitions. [2018-11-14 17:35:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:35:21,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 17:35:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2018-11-14 17:35:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2018-11-14 17:35:21,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 103 transitions. [2018-11-14 17:35:21,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:21,326 INFO L225 Difference]: With dead ends: 573 [2018-11-14 17:35:21,326 INFO L226 Difference]: Without dead ends: 571 [2018-11-14 17:35:21,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-14 17:35:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2018-11-14 17:35:26,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:26,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand 541 states. [2018-11-14 17:35:26,820 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand 541 states. [2018-11-14 17:35:26,820 INFO L87 Difference]: Start difference. First operand 571 states. Second operand 541 states. [2018-11-14 17:35:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:26,848 INFO L93 Difference]: Finished difference Result 571 states and 916 transitions. [2018-11-14 17:35:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 916 transitions. [2018-11-14 17:35:26,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:26,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:26,852 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand 571 states. [2018-11-14 17:35:26,852 INFO L87 Difference]: Start difference. First operand 541 states. Second operand 571 states. [2018-11-14 17:35:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:26,884 INFO L93 Difference]: Finished difference Result 571 states and 916 transitions. [2018-11-14 17:35:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 916 transitions. [2018-11-14 17:35:26,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:26,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:26,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:26,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-14 17:35:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 869 transitions. [2018-11-14 17:35:26,918 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 869 transitions. Word has length 44 [2018-11-14 17:35:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:26,918 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 869 transitions. [2018-11-14 17:35:26,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:35:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 869 transitions. [2018-11-14 17:35:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-14 17:35:26,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:26,922 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:26,923 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:26,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 506108398, now seen corresponding path program 1 times [2018-11-14 17:35:26,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:27,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {18641#true} call ULTIMATE.init(); {18641#true} is VALID [2018-11-14 17:35:27,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18641#true} {18641#true} #96#return; {18641#true} is VALID [2018-11-14 17:35:27,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {18641#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {18641#true} is VALID [2018-11-14 17:35:27,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {18641#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18641#true} is VALID [2018-11-14 17:35:27,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {18641#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {18641#true} is VALID [2018-11-14 17:35:27,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {18641#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {18641#true} is VALID [2018-11-14 17:35:27,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {18641#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {18641#true} is VALID [2018-11-14 17:35:27,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {18641#true} assume !!(~j~0 <= ~r~0); {18641#true} is VALID [2018-11-14 17:35:27,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {18641#true} assume !(~j~0 < ~r~0); {18641#true} is VALID [2018-11-14 17:35:27,339 INFO L256 TraceCheckUtils]: 12: Hoare triple {18641#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {18641#true} ~cond := #in~cond; {18643#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:35:27,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {18643#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:27,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:27,340 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} {18641#true} #108#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,340 INFO L256 TraceCheckUtils]: 17: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,341 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #110#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {18645#(<= 1 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {18645#(<= 1 main_~j~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,342 INFO L256 TraceCheckUtils]: 24: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,343 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #112#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,343 INFO L256 TraceCheckUtils]: 29: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,344 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #114#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,344 INFO L256 TraceCheckUtils]: 34: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,345 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #116#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,346 INFO L256 TraceCheckUtils]: 39: Hoare triple {18645#(<= 1 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,347 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18641#true} {18645#(<= 1 main_~j~0)} #118#return; {18645#(<= 1 main_~j~0)} is VALID [2018-11-14 17:35:27,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {18645#(<= 1 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {18646#(<= 1 main_~i~0)} assume true; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {18646#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {18646#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,349 INFO L256 TraceCheckUtils]: 48: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,350 INFO L273 TraceCheckUtils]: 50: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,350 INFO L273 TraceCheckUtils]: 51: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,351 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {18641#true} {18646#(<= 1 main_~i~0)} #108#return; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,351 INFO L256 TraceCheckUtils]: 53: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,351 INFO L273 TraceCheckUtils]: 54: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,351 INFO L273 TraceCheckUtils]: 55: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,352 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18641#true} {18646#(<= 1 main_~i~0)} #110#return; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {18646#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,353 INFO L273 TraceCheckUtils]: 59: Hoare triple {18646#(<= 1 main_~i~0)} assume !(#t~nondet5 != 0);havoc #t~nondet5; {18646#(<= 1 main_~i~0)} is VALID [2018-11-14 17:35:27,353 INFO L256 TraceCheckUtils]: 60: Hoare triple {18646#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:35:27,354 INFO L273 TraceCheckUtils]: 61: Hoare triple {18644#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18647#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:35:27,354 INFO L273 TraceCheckUtils]: 62: Hoare triple {18647#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {18642#false} is VALID [2018-11-14 17:35:27,354 INFO L273 TraceCheckUtils]: 63: Hoare triple {18642#false} assume !false; {18642#false} is VALID [2018-11-14 17:35:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-14 17:35:27,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:27,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:35:27,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:27,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:27,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {18641#true} call ULTIMATE.init(); {18641#true} is VALID [2018-11-14 17:35:27,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18641#true} {18641#true} #96#return; {18641#true} is VALID [2018-11-14 17:35:27,889 INFO L256 TraceCheckUtils]: 3: Hoare triple {18641#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {18641#true} is VALID [2018-11-14 17:35:27,889 INFO L273 TraceCheckUtils]: 4: Hoare triple {18641#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18641#true} is VALID [2018-11-14 17:35:27,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {18641#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := (if ~n~0 < 0 && ~n~0 % 2 != 0 then ~n~0 / 2 + 1 else ~n~0 / 2) + 1;~r~0 := ~n~0; {18641#true} is VALID [2018-11-14 17:35:27,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {18641#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {18669#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:27,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {18669#(<= 1 main_~l~0)} assume true; {18669#(<= 1 main_~l~0)} is VALID [2018-11-14 17:35:27,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {18669#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-14 17:35:27,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume true; {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-14 17:35:27,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume !!(~j~0 <= ~r~0); {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} is VALID [2018-11-14 17:35:27,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {18676#(exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))} assume !(~j~0 < ~r~0); {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,909 INFO L256 TraceCheckUtils]: 12: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,914 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #108#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,915 INFO L256 TraceCheckUtils]: 17: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,915 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #110#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} assume !(#t~nondet5 != 0);havoc #t~nondet5; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,916 INFO L256 TraceCheckUtils]: 24: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,917 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #112#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,918 INFO L256 TraceCheckUtils]: 29: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,919 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #114#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,919 INFO L256 TraceCheckUtils]: 34: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,920 INFO L273 TraceCheckUtils]: 37: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,920 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #116#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,921 INFO L256 TraceCheckUtils]: 39: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18641#true} is VALID [2018-11-14 17:35:27,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {18641#true} ~cond := #in~cond; {18641#true} is VALID [2018-11-14 17:35:27,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {18641#true} assume !(~cond == 0); {18641#true} is VALID [2018-11-14 17:35:27,921 INFO L273 TraceCheckUtils]: 42: Hoare triple {18641#true} assume true; {18641#true} is VALID [2018-11-14 17:35:27,922 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18641#true} {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} #118#return; {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} is VALID [2018-11-14 17:35:27,923 INFO L273 TraceCheckUtils]: 44: Hoare triple {18686#(and (<= main_~r~0 main_~j~0) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} is VALID [2018-11-14 17:35:27,923 INFO L273 TraceCheckUtils]: 45: Hoare triple {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} assume true; {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} is VALID [2018-11-14 17:35:27,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {18786#(exists ((v_main_~j~0_28 Int) (main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_28) (<= (* 2 v_main_~j~0_28) main_~j~0) (<= main_~r~0 v_main_~j~0_28)))} assume !!(~j~0 <= ~r~0); {18642#false} is VALID [2018-11-14 17:35:27,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {18642#false} assume !(~j~0 < ~r~0); {18642#false} is VALID [2018-11-14 17:35:27,924 INFO L256 TraceCheckUtils]: 48: Hoare triple {18642#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {18642#false} is VALID [2018-11-14 17:35:27,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-14 17:35:27,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {18642#false} assume !(~cond == 0); {18642#false} is VALID [2018-11-14 17:35:27,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {18642#false} assume true; {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {18642#false} {18642#false} #108#return; {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L256 TraceCheckUtils]: 53: Hoare triple {18642#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {18642#false} assume !(~cond == 0); {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {18642#false} assume true; {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18642#false} {18642#false} #110#return; {18642#false} is VALID [2018-11-14 17:35:27,925 INFO L273 TraceCheckUtils]: 58: Hoare triple {18642#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {18642#false} is VALID [2018-11-14 17:35:27,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {18642#false} assume !(#t~nondet5 != 0);havoc #t~nondet5; {18642#false} is VALID [2018-11-14 17:35:27,926 INFO L256 TraceCheckUtils]: 60: Hoare triple {18642#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {18642#false} is VALID [2018-11-14 17:35:27,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {18642#false} ~cond := #in~cond; {18642#false} is VALID [2018-11-14 17:35:27,926 INFO L273 TraceCheckUtils]: 62: Hoare triple {18642#false} assume ~cond == 0; {18642#false} is VALID [2018-11-14 17:35:27,926 INFO L273 TraceCheckUtils]: 63: Hoare triple {18642#false} assume !false; {18642#false} is VALID [2018-11-14 17:35:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-14 17:35:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:27,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-14 17:35:27,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-14 17:35:27,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:27,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:35:28,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:28,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:35:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:35:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:28,033 INFO L87 Difference]: Start difference. First operand 541 states and 869 transitions. Second operand 11 states.