/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:55,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:55,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:55,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:55,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:55,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:55,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:55,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:55,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:55,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:55,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:55,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:55,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:55,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:55,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:55,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:55,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:55,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:55,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:55,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:55,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:55,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:55,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:55,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:55,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:55,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:55,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:55,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:55,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:55,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:55,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:55,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:55,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:55,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:55,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:55,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:55,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:55,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:55,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:55,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:55,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:55,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:55,330 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:55,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:55,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:55,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:55,332 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:55,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:55,332 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:55,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:55,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:55,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:55,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:55,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:55,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:55,334 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:55,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:55,334 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:55,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:55,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:55,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:55,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:55,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:55,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:55,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:55,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:55,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:55,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:55,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:55,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:55,337 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:55,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:55,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:55,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:55,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:55,648 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:55,648 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:55,649 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-10 15:28:55,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7909471/59777baa83e94efe891a7ee3e8740b86/FLAGa3918ebea [2020-07-10 15:28:56,202 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:56,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-10 15:28:56,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7909471/59777baa83e94efe891a7ee3e8740b86/FLAGa3918ebea [2020-07-10 15:28:56,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7909471/59777baa83e94efe891a7ee3e8740b86 [2020-07-10 15:28:56,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:56,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:56,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:56,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:56,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:56,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:56,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56, skipping insertion in model container [2020-07-10 15:28:56,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:56,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:56,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:56,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:56,916 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:56,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:56,970 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:56,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56 WrapperNode [2020-07-10 15:28:56,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:56,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:56,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:56,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:56,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:56,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (1/1) ... [2020-07-10 15:28:57,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:57,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:57,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:57,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:57,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (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 [2020-07-10 15:28:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:57,556 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:57,557 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:28:57,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:57 BoogieIcfgContainer [2020-07-10 15:28:57,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:57,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:57,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:57,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:57,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:56" (1/3) ... [2020-07-10 15:28:57,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f2277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:57, skipping insertion in model container [2020-07-10 15:28:57,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:56" (2/3) ... [2020-07-10 15:28:57,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f2277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:57, skipping insertion in model container [2020-07-10 15:28:57,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:57" (3/3) ... [2020-07-10 15:28:57,570 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2020-07-10 15:28:57,582 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:57,590 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:57,607 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:57,632 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:57,632 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:57,632 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:57,633 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:57,633 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:57,633 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:57,633 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:57,634 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 15:28:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:28:57,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:57,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:57,668 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 404168940, now seen corresponding path program 1 times [2020-07-10 15:28:57,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:57,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999752114] [2020-07-10 15:28:57,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:57,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:28:57,967 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #84#return; {32#true} is VALID [2020-07-10 15:28:57,969 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-10 15:28:57,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:28:57,970 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #84#return; {32#true} is VALID [2020-07-10 15:28:57,970 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2020-07-10 15:28:57,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32#true} is VALID [2020-07-10 15:28:57,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} assume !!(~n~0 < 1000000); {32#true} is VALID [2020-07-10 15:28:57,974 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~k~0 == ~n~0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 15:28:57,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 15:28:57,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 15:28:57,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 15:28:57,979 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {36#(<= main_~n~0 main_~k~0)} is VALID [2020-07-10 15:28:57,981 INFO L263 TraceCheckUtils]: 11: Hoare triple {36#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:57,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:57,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {33#false} is VALID [2020-07-10 15:28:57,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 15:28:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:57,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999752114] [2020-07-10 15:28:57,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:57,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:57,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243941532] [2020-07-10 15:28:57,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:28:58,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:58,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:58,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:58,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:58,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:58,051 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2020-07-10 15:28:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:58,336 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2020-07-10 15:28:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:58,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:28:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2020-07-10 15:28:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2020-07-10 15:28:58,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2020-07-10 15:28:58,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:58,508 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:28:58,508 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:28:58,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:28:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:28:58,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:58,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:58,573 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:58,573 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:58,587 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 15:28:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:28:58,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:58,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:58,589 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:58,589 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:28:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:58,596 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 15:28:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:28:58,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:58,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:58,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:28:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 15:28:58,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2020-07-10 15:28:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:58,606 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 15:28:58,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:28:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:28:58,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:58,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:58,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:58,611 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -849304486, now seen corresponding path program 1 times [2020-07-10 15:28:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:58,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899751159] [2020-07-10 15:28:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:58,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-10 15:28:58,730 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #84#return; {218#true} is VALID [2020-07-10 15:28:58,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-10 15:28:58,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-10 15:28:58,731 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #84#return; {218#true} is VALID [2020-07-10 15:28:58,732 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret6 := main(); {218#true} is VALID [2020-07-10 15:28:58,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {218#true} is VALID [2020-07-10 15:28:58,732 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} assume !!(~n~0 < 1000000); {218#true} is VALID [2020-07-10 15:28:58,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#true} assume ~k~0 == ~n~0; {218#true} is VALID [2020-07-10 15:28:58,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#true} ~i~0 := 0; {218#true} is VALID [2020-07-10 15:28:58,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {222#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 15:28:58,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {222#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 15:28:58,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {222#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {223#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 15:28:58,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {223#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-10 15:28:58,738 INFO L263 TraceCheckUtils]: 12: Hoare triple {223#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {224#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:58,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {224#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {225#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:58,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {225#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-10 15:28:58,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-10 15:28:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:58,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899751159] [2020-07-10 15:28:58,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:58,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:58,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141040426] [2020-07-10 15:28:58,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:58,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:58,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:58,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:58,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:58,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:58,768 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-07-10 15:28:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,114 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-07-10 15:28:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:59,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:28:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 15:28:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 15:28:59,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-10 15:28:59,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:59,204 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:28:59,205 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:28:59,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:28:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-10 15:28:59,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:59,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2020-07-10 15:28:59,243 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2020-07-10 15:28:59,244 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2020-07-10 15:28:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,249 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-10 15:28:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-10 15:28:59,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:59,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:59,253 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2020-07-10 15:28:59,254 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2020-07-10 15:28:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,263 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-10 15:28:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-10 15:28:59,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:59,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:59,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:59,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:28:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:28:59,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2020-07-10 15:28:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:59,272 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:28:59,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:28:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:28:59,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:59,277 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:59,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:59,277 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1573212483, now seen corresponding path program 1 times [2020-07-10 15:28:59,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:59,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355749209] [2020-07-10 15:28:59,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:28:59,356 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #84#return; {409#true} is VALID [2020-07-10 15:28:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-10 15:28:59,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-10 15:28:59,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:28:59,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {409#true} {413#(<= main_~k~0 main_~n~0)} #90#return; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,367 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-10 15:28:59,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:28:59,368 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #84#return; {409#true} is VALID [2020-07-10 15:28:59,368 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret6 := main(); {409#true} is VALID [2020-07-10 15:28:59,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {409#true} is VALID [2020-07-10 15:28:59,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {409#true} assume !!(~n~0 < 1000000); {409#true} is VALID [2020-07-10 15:28:59,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {409#true} assume ~k~0 == ~n~0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {413#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {413#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,374 INFO L263 TraceCheckUtils]: 11: Hoare triple {413#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {409#true} is VALID [2020-07-10 15:28:59,374 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-10 15:28:59,375 INFO L280 TraceCheckUtils]: 13: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-10 15:28:59,375 INFO L280 TraceCheckUtils]: 14: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-10 15:28:59,376 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {409#true} {413#(<= main_~k~0 main_~n~0)} #90#return; {413#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:28:59,378 INFO L263 TraceCheckUtils]: 16: Hoare triple {413#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {418#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:59,380 INFO L280 TraceCheckUtils]: 17: Hoare triple {418#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {419#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:59,382 INFO L280 TraceCheckUtils]: 18: Hoare triple {419#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-10 15:28:59,382 INFO L280 TraceCheckUtils]: 19: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-10 15:28:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:59,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355749209] [2020-07-10 15:28:59,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:59,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:59,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144749572] [2020-07-10 15:28:59,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:28:59,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:59,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:59,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:59,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:59,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:59,413 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2020-07-10 15:28:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,659 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2020-07-10 15:28:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:59,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:28:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-10 15:28:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-10 15:28:59,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-10 15:28:59,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:59,720 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:28:59,720 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:28:59,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:28:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-10 15:28:59,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:59,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:59,751 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:59,751 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,755 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-10 15:28:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-10 15:28:59,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:59,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:59,756 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:59,756 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:28:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:59,759 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-10 15:28:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-10 15:28:59,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:59,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:59,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:59,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:28:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-10 15:28:59,764 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2020-07-10 15:28:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:59,764 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-10 15:28:59,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-10 15:28:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:28:59,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:59,766 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:59,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:59,766 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1604756500, now seen corresponding path program 1 times [2020-07-10 15:28:59,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:59,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798032444] [2020-07-10 15:28:59,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 15:28:59,822 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {634#true} {634#true} #84#return; {634#true} is VALID [2020-07-10 15:28:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 15:28:59,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 15:28:59,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 15:28:59,829 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {635#false} #90#return; {635#false} is VALID [2020-07-10 15:28:59,829 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-10 15:28:59,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 15:28:59,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #84#return; {634#true} is VALID [2020-07-10 15:28:59,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {634#true} call #t~ret6 := main(); {634#true} is VALID [2020-07-10 15:28:59,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {634#true} is VALID [2020-07-10 15:28:59,831 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} assume !!(~n~0 < 1000000); {634#true} is VALID [2020-07-10 15:28:59,831 INFO L280 TraceCheckUtils]: 6: Hoare triple {634#true} assume ~k~0 == ~n~0; {634#true} is VALID [2020-07-10 15:28:59,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {634#true} ~i~0 := 0; {638#(<= main_~i~0 0)} is VALID [2020-07-10 15:28:59,833 INFO L280 TraceCheckUtils]: 8: Hoare triple {638#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {639#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 15:28:59,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {639#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {639#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-10 15:28:59,834 INFO L280 TraceCheckUtils]: 10: Hoare triple {639#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {640#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 15:28:59,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {640#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {635#false} is VALID [2020-07-10 15:28:59,836 INFO L280 TraceCheckUtils]: 12: Hoare triple {635#false} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {635#false} is VALID [2020-07-10 15:28:59,836 INFO L280 TraceCheckUtils]: 13: Hoare triple {635#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {635#false} is VALID [2020-07-10 15:28:59,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {635#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {635#false} is VALID [2020-07-10 15:28:59,837 INFO L263 TraceCheckUtils]: 15: Hoare triple {635#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {634#true} is VALID [2020-07-10 15:28:59,837 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 15:28:59,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 15:28:59,837 INFO L280 TraceCheckUtils]: 18: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 15:28:59,838 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {634#true} {635#false} #90#return; {635#false} is VALID [2020-07-10 15:28:59,838 INFO L263 TraceCheckUtils]: 20: Hoare triple {635#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {635#false} is VALID [2020-07-10 15:28:59,838 INFO L280 TraceCheckUtils]: 21: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2020-07-10 15:28:59,838 INFO L280 TraceCheckUtils]: 22: Hoare triple {635#false} assume 0 == ~cond; {635#false} is VALID [2020-07-10 15:28:59,839 INFO L280 TraceCheckUtils]: 23: Hoare triple {635#false} assume !false; {635#false} is VALID [2020-07-10 15:28:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:59,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798032444] [2020-07-10 15:28:59,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:59,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:59,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201461578] [2020-07-10 15:28:59,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:28:59,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:59,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:59,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:59,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:59,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:59,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:59,872 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2020-07-10 15:29:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,206 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2020-07-10 15:29:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:00,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:29:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-10 15:29:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-10 15:29:00,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-10 15:29:00,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:00,316 INFO L225 Difference]: With dead ends: 97 [2020-07-10 15:29:00,317 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:29:00,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:29:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2020-07-10 15:29:00,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:00,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 46 states. [2020-07-10 15:29:00,383 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 46 states. [2020-07-10 15:29:00,383 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 46 states. [2020-07-10 15:29:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,390 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2020-07-10 15:29:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2020-07-10 15:29:00,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:00,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:00,392 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 62 states. [2020-07-10 15:29:00,395 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 62 states. [2020-07-10 15:29:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,403 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2020-07-10 15:29:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2020-07-10 15:29:00,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:00,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:00,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:00,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:29:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2020-07-10 15:29:00,408 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2020-07-10 15:29:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:00,412 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2020-07-10 15:29:00,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:29:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2020-07-10 15:29:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:29:00,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:00,421 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-07-10 15:29:00,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:29:00,421 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1598241856, now seen corresponding path program 1 times [2020-07-10 15:29:00,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:00,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268814707] [2020-07-10 15:29:00,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,530 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-10 15:29:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:29:00,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:29:00,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,545 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:29:00,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:29:00,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,554 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {986#false} #90#return; {986#false} is VALID [2020-07-10 15:29:00,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:29:00,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-10 15:29:00,555 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret6 := main(); {985#true} is VALID [2020-07-10 15:29:00,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {985#true} is VALID [2020-07-10 15:29:00,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !!(~n~0 < 1000000); {985#true} is VALID [2020-07-10 15:29:00,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume ~k~0 == ~n~0; {985#true} is VALID [2020-07-10 15:29:00,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} ~i~0 := 0; {985#true} is VALID [2020-07-10 15:29:00,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {985#true} is VALID [2020-07-10 15:29:00,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {985#true} is VALID [2020-07-10 15:29:00,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,558 INFO L263 TraceCheckUtils]: 12: Hoare triple {989#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {985#true} is VALID [2020-07-10 15:29:00,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:29:00,559 INFO L280 TraceCheckUtils]: 14: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:29:00,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,560 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,561 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(<= main_~k~0 main_~j~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {994#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2020-07-10 15:29:00,563 INFO L280 TraceCheckUtils]: 18: Hoare triple {994#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {995#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-10 15:29:00,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {995#(<= main_~n~0 (+ main_~j~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {996#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 15:29:00,566 INFO L280 TraceCheckUtils]: 20: Hoare triple {996#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {986#false} is VALID [2020-07-10 15:29:00,566 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {986#false} is VALID [2020-07-10 15:29:00,567 INFO L263 TraceCheckUtils]: 22: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {985#true} is VALID [2020-07-10 15:29:00,567 INFO L280 TraceCheckUtils]: 23: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:29:00,567 INFO L280 TraceCheckUtils]: 24: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:29:00,567 INFO L280 TraceCheckUtils]: 25: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,577 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {985#true} {986#false} #90#return; {986#false} is VALID [2020-07-10 15:29:00,578 INFO L263 TraceCheckUtils]: 27: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:29:00,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:29:00,580 INFO L280 TraceCheckUtils]: 29: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:29:00,580 INFO L280 TraceCheckUtils]: 30: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:29:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:29:00,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268814707] [2020-07-10 15:29:00,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76146704] [2020-07-10 15:29:00,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:29:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:00,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:00,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:29:00,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,772 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #84#return; {985#true} is VALID [2020-07-10 15:29:00,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret6 := main(); {985#true} is VALID [2020-07-10 15:29:00,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {985#true} is VALID [2020-07-10 15:29:00,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !!(~n~0 < 1000000); {985#true} is VALID [2020-07-10 15:29:00,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume ~k~0 == ~n~0; {985#true} is VALID [2020-07-10 15:29:00,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} ~i~0 := 0; {985#true} is VALID [2020-07-10 15:29:00,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {985#true} is VALID [2020-07-10 15:29:00,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {985#true} is VALID [2020-07-10 15:29:00,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(<= main_~k~0 main_~j~0)} assume !!(~k~0 < ~n~0); {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,775 INFO L263 TraceCheckUtils]: 12: Hoare triple {989#(<= main_~k~0 main_~j~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {985#true} is VALID [2020-07-10 15:29:00,775 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:29:00,776 INFO L280 TraceCheckUtils]: 14: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:29:00,776 INFO L280 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:29:00,777 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {985#true} {989#(<= main_~k~0 main_~j~0)} #88#return; {989#(<= main_~k~0 main_~j~0)} is VALID [2020-07-10 15:29:00,778 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(<= main_~k~0 main_~j~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {994#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2020-07-10 15:29:00,779 INFO L280 TraceCheckUtils]: 18: Hoare triple {994#(<= main_~k~0 (+ main_~j~0 1))} assume !(~k~0 < ~n~0); {995#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2020-07-10 15:29:00,780 INFO L280 TraceCheckUtils]: 19: Hoare triple {995#(<= main_~n~0 (+ main_~j~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {996#(<= main_~n~0 main_~j~0)} is VALID [2020-07-10 15:29:00,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {996#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {986#false} is VALID [2020-07-10 15:29:00,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {986#false} is VALID [2020-07-10 15:29:00,781 INFO L263 TraceCheckUtils]: 22: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:29:00,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:29:00,781 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} assume !(0 == ~cond); {986#false} is VALID [2020-07-10 15:29:00,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {986#false} assume true; {986#false} is VALID [2020-07-10 15:29:00,782 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {986#false} {986#false} #90#return; {986#false} is VALID [2020-07-10 15:29:00,782 INFO L263 TraceCheckUtils]: 27: Hoare triple {986#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:29:00,782 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:29:00,783 INFO L280 TraceCheckUtils]: 29: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:29:00,783 INFO L280 TraceCheckUtils]: 30: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:29:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:29:00,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:00,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-10 15:29:00,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660119363] [2020-07-10 15:29:00,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 15:29:00,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:00,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:00,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:00,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:00,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:00,831 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2020-07-10 15:29:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,094 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2020-07-10 15:29:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:01,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 15:29:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:29:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:29:01,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-10 15:29:01,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:01,179 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:29:01,180 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 15:29:01,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 15:29:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-07-10 15:29:01,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:01,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2020-07-10 15:29:01,253 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2020-07-10 15:29:01,253 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2020-07-10 15:29:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,258 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 15:29:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-07-10 15:29:01,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:01,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:01,259 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2020-07-10 15:29:01,259 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2020-07-10 15:29:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,265 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 15:29:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2020-07-10 15:29:01,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:01,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:01,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:01,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:29:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2020-07-10 15:29:01,272 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 31 [2020-07-10 15:29:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:01,272 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2020-07-10 15:29:01,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2020-07-10 15:29:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:29:01,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:01,275 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 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] [2020-07-10 15:29:01,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:01,476 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2099424040, now seen corresponding path program 1 times [2020-07-10 15:29:01,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:01,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821495244] [2020-07-10 15:29:01,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,574 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1398#true} {1398#true} #84#return; {1398#true} is VALID [2020-07-10 15:29:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {1398#true} ~cond := #in~cond; {1398#true} is VALID [2020-07-10 15:29:01,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {1398#true} assume !(0 == ~cond); {1398#true} is VALID [2020-07-10 15:29:01,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1398#true} {1404#(<= main_~k~0 main_~i~0)} #88#return; {1404#(<= main_~k~0 main_~i~0)} is VALID [2020-07-10 15:29:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {1398#true} ~cond := #in~cond; {1398#true} is VALID [2020-07-10 15:29:01,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {1398#true} assume !(0 == ~cond); {1398#true} is VALID [2020-07-10 15:29:01,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,600 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1398#true} {1399#false} #90#return; {1399#false} is VALID [2020-07-10 15:29:01,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {1398#true} call ULTIMATE.init(); {1398#true} is VALID [2020-07-10 15:29:01,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1398#true} {1398#true} #84#return; {1398#true} is VALID [2020-07-10 15:29:01,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {1398#true} call #t~ret6 := main(); {1398#true} is VALID [2020-07-10 15:29:01,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {1398#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1398#true} is VALID [2020-07-10 15:29:01,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {1398#true} assume !!(~n~0 < 1000000); {1398#true} is VALID [2020-07-10 15:29:01,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1398#true} assume ~k~0 == ~n~0; {1398#true} is VALID [2020-07-10 15:29:01,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {1398#true} ~i~0 := 0; {1402#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {1402#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1403#(<= main_~j~0 main_~i~0)} is VALID [2020-07-10 15:29:01,605 INFO L280 TraceCheckUtils]: 9: Hoare triple {1403#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1403#(<= main_~j~0 main_~i~0)} is VALID [2020-07-10 15:29:01,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {1403#(<= main_~j~0 main_~i~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1404#(<= main_~k~0 main_~i~0)} is VALID [2020-07-10 15:29:01,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {1404#(<= main_~k~0 main_~i~0)} assume !!(~k~0 < ~n~0); {1404#(<= main_~k~0 main_~i~0)} is VALID [2020-07-10 15:29:01,609 INFO L263 TraceCheckUtils]: 12: Hoare triple {1404#(<= main_~k~0 main_~i~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1398#true} is VALID [2020-07-10 15:29:01,609 INFO L280 TraceCheckUtils]: 13: Hoare triple {1398#true} ~cond := #in~cond; {1398#true} is VALID [2020-07-10 15:29:01,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {1398#true} assume !(0 == ~cond); {1398#true} is VALID [2020-07-10 15:29:01,610 INFO L280 TraceCheckUtils]: 15: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,611 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1398#true} {1404#(<= main_~k~0 main_~i~0)} #88#return; {1404#(<= main_~k~0 main_~i~0)} is VALID [2020-07-10 15:29:01,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {1404#(<= main_~k~0 main_~i~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1409#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:29:01,613 INFO L280 TraceCheckUtils]: 18: Hoare triple {1409#(<= main_~k~0 (+ main_~i~0 1))} assume !(~k~0 < ~n~0); {1410#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:29:01,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {1410#(<= main_~n~0 (+ main_~i~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1410#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:29:01,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {1410#(<= main_~n~0 (+ main_~i~0 1))} assume !(~j~0 < ~n~0); {1410#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2020-07-10 15:29:01,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {1410#(<= main_~n~0 (+ main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1411#(<= main_~n~0 main_~i~0)} is VALID [2020-07-10 15:29:01,625 INFO L280 TraceCheckUtils]: 22: Hoare triple {1411#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1399#false} is VALID [2020-07-10 15:29:01,625 INFO L280 TraceCheckUtils]: 23: Hoare triple {1399#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1399#false} is VALID [2020-07-10 15:29:01,625 INFO L280 TraceCheckUtils]: 24: Hoare triple {1399#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {1399#false} is VALID [2020-07-10 15:29:01,626 INFO L263 TraceCheckUtils]: 25: Hoare triple {1399#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1398#true} is VALID [2020-07-10 15:29:01,626 INFO L280 TraceCheckUtils]: 26: Hoare triple {1398#true} ~cond := #in~cond; {1398#true} is VALID [2020-07-10 15:29:01,627 INFO L280 TraceCheckUtils]: 27: Hoare triple {1398#true} assume !(0 == ~cond); {1398#true} is VALID [2020-07-10 15:29:01,627 INFO L280 TraceCheckUtils]: 28: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,627 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1398#true} {1399#false} #90#return; {1399#false} is VALID [2020-07-10 15:29:01,628 INFO L263 TraceCheckUtils]: 30: Hoare triple {1399#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1399#false} is VALID [2020-07-10 15:29:01,628 INFO L280 TraceCheckUtils]: 31: Hoare triple {1399#false} ~cond := #in~cond; {1399#false} is VALID [2020-07-10 15:29:01,629 INFO L280 TraceCheckUtils]: 32: Hoare triple {1399#false} assume 0 == ~cond; {1399#false} is VALID [2020-07-10 15:29:01,629 INFO L280 TraceCheckUtils]: 33: Hoare triple {1399#false} assume !false; {1399#false} is VALID [2020-07-10 15:29:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:29:01,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821495244] [2020-07-10 15:29:01,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011376303] [2020-07-10 15:29:01,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:29:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:01,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {1398#true} call ULTIMATE.init(); {1398#true} is VALID [2020-07-10 15:29:01,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,954 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1398#true} {1398#true} #84#return; {1398#true} is VALID [2020-07-10 15:29:01,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {1398#true} call #t~ret6 := main(); {1398#true} is VALID [2020-07-10 15:29:01,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {1398#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1398#true} is VALID [2020-07-10 15:29:01,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {1398#true} assume !!(~n~0 < 1000000); {1398#true} is VALID [2020-07-10 15:29:01,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {1398#true} assume ~k~0 == ~n~0; {1398#true} is VALID [2020-07-10 15:29:01,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {1398#true} ~i~0 := 0; {1402#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {1402#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1443#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:01,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {1443#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1443#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:01,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {1443#(and (<= main_~i~0 0) (<= main_~j~0 (* 2 main_~i~0)))} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:01,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} assume !!(~k~0 < ~n~0); {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:01,958 INFO L263 TraceCheckUtils]: 12: Hoare triple {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1398#true} is VALID [2020-07-10 15:29:01,958 INFO L280 TraceCheckUtils]: 13: Hoare triple {1398#true} ~cond := #in~cond; {1398#true} is VALID [2020-07-10 15:29:01,958 INFO L280 TraceCheckUtils]: 14: Hoare triple {1398#true} assume !(0 == ~cond); {1398#true} is VALID [2020-07-10 15:29:01,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {1398#true} assume true; {1398#true} is VALID [2020-07-10 15:29:01,959 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1398#true} {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} #88#return; {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:01,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {1450#(and (<= main_~i~0 0) (<= main_~k~0 (* 2 main_~i~0)))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1472#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-10 15:29:01,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {1472#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* 2 main_~i~0) 1)))} assume !(~k~0 < ~n~0); {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-10 15:29:01,962 INFO L280 TraceCheckUtils]: 19: Hoare triple {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-10 15:29:01,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} assume !(~j~0 < ~n~0); {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} is VALID [2020-07-10 15:29:01,963 INFO L280 TraceCheckUtils]: 21: Hoare triple {1476#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* 2 main_~i~0) 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1486#(and (<= (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 0) (<= (+ (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 1) main_~i~0))} is VALID [2020-07-10 15:29:01,964 INFO L280 TraceCheckUtils]: 22: Hoare triple {1486#(and (<= (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 0) (<= (+ (div (+ (* main_~n~0 (- 1)) 1) (- 2)) 1) main_~i~0))} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1399#false} is VALID [2020-07-10 15:29:01,964 INFO L280 TraceCheckUtils]: 23: Hoare triple {1399#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1399#false} is VALID [2020-07-10 15:29:01,964 INFO L280 TraceCheckUtils]: 24: Hoare triple {1399#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {1399#false} is VALID [2020-07-10 15:29:01,965 INFO L263 TraceCheckUtils]: 25: Hoare triple {1399#false} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1399#false} is VALID [2020-07-10 15:29:01,965 INFO L280 TraceCheckUtils]: 26: Hoare triple {1399#false} ~cond := #in~cond; {1399#false} is VALID [2020-07-10 15:29:01,966 INFO L280 TraceCheckUtils]: 27: Hoare triple {1399#false} assume !(0 == ~cond); {1399#false} is VALID [2020-07-10 15:29:01,966 INFO L280 TraceCheckUtils]: 28: Hoare triple {1399#false} assume true; {1399#false} is VALID [2020-07-10 15:29:01,966 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1399#false} {1399#false} #90#return; {1399#false} is VALID [2020-07-10 15:29:01,967 INFO L263 TraceCheckUtils]: 30: Hoare triple {1399#false} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1399#false} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 31: Hoare triple {1399#false} ~cond := #in~cond; {1399#false} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 32: Hoare triple {1399#false} assume 0 == ~cond; {1399#false} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 33: Hoare triple {1399#false} assume !false; {1399#false} is VALID [2020-07-10 15:29:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:29:01,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:01,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-10 15:29:01,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717775417] [2020-07-10 15:29:01,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-10 15:29:01,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:01,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:29:02,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:02,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:29:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:29:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:29:02,033 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 13 states. [2020-07-10 15:29:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:02,670 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2020-07-10 15:29:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:29:02,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-10 15:29:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2020-07-10 15:29:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2020-07-10 15:29:02,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2020-07-10 15:29:02,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:02,815 INFO L225 Difference]: With dead ends: 120 [2020-07-10 15:29:02,815 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 15:29:02,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:29:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 15:29:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2020-07-10 15:29:02,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:02,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 56 states. [2020-07-10 15:29:02,912 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 56 states. [2020-07-10 15:29:02,912 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 56 states. [2020-07-10 15:29:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:02,918 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2020-07-10 15:29:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2020-07-10 15:29:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:02,920 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 86 states. [2020-07-10 15:29:02,920 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 86 states. [2020-07-10 15:29:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:02,925 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2020-07-10 15:29:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2020-07-10 15:29:02,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:02,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:02,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:02,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:29:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-07-10 15:29:02,929 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 34 [2020-07-10 15:29:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:02,929 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-07-10 15:29:02,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-10 15:29:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:29:02,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:02,930 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:03,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:03,147 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1702845076, now seen corresponding path program 2 times [2020-07-10 15:29:03,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:03,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235300162] [2020-07-10 15:29:03,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,222 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1966#true} {1966#true} #84#return; {1966#true} is VALID [2020-07-10 15:29:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #88#return; {1966#true} is VALID [2020-07-10 15:29:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,235 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1974#(<= (+ main_~k~0 1) main_~n~0)} #88#return; {1974#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 15:29:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,242 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1979#(<= main_~k~0 main_~n~0)} #90#return; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2020-07-10 15:29:03,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,243 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1966#true} {1966#true} #84#return; {1966#true} is VALID [2020-07-10 15:29:03,244 INFO L263 TraceCheckUtils]: 3: Hoare triple {1966#true} call #t~ret6 := main(); {1966#true} is VALID [2020-07-10 15:29:03,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {1966#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1966#true} is VALID [2020-07-10 15:29:03,244 INFO L280 TraceCheckUtils]: 5: Hoare triple {1966#true} assume !!(~n~0 < 1000000); {1966#true} is VALID [2020-07-10 15:29:03,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {1966#true} assume ~k~0 == ~n~0; {1966#true} is VALID [2020-07-10 15:29:03,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {1966#true} ~i~0 := 0; {1966#true} is VALID [2020-07-10 15:29:03,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {1966#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1966#true} is VALID [2020-07-10 15:29:03,245 INFO L280 TraceCheckUtils]: 9: Hoare triple {1966#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1966#true} is VALID [2020-07-10 15:29:03,245 INFO L280 TraceCheckUtils]: 10: Hoare triple {1966#true} assume 0 != #t~nondet4;havoc #t~nondet4;~k~0 := ~j~0; {1966#true} is VALID [2020-07-10 15:29:03,246 INFO L280 TraceCheckUtils]: 11: Hoare triple {1966#true} assume !!(~k~0 < ~n~0); {1966#true} is VALID [2020-07-10 15:29:03,246 INFO L263 TraceCheckUtils]: 12: Hoare triple {1966#true} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1966#true} is VALID [2020-07-10 15:29:03,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,246 INFO L280 TraceCheckUtils]: 15: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,247 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1966#true} {1966#true} #88#return; {1966#true} is VALID [2020-07-10 15:29:03,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {1966#true} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1966#true} is VALID [2020-07-10 15:29:03,248 INFO L280 TraceCheckUtils]: 18: Hoare triple {1966#true} assume !!(~k~0 < ~n~0); {1974#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 15:29:03,248 INFO L263 TraceCheckUtils]: 19: Hoare triple {1974#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1966#true} is VALID [2020-07-10 15:29:03,248 INFO L280 TraceCheckUtils]: 20: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,249 INFO L280 TraceCheckUtils]: 21: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,249 INFO L280 TraceCheckUtils]: 22: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,250 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1966#true} {1974#(<= (+ main_~k~0 1) main_~n~0)} #88#return; {1974#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-10 15:29:03,251 INFO L280 TraceCheckUtils]: 24: Hoare triple {1974#(<= (+ main_~k~0 1) main_~n~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,251 INFO L280 TraceCheckUtils]: 25: Hoare triple {1979#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,252 INFO L280 TraceCheckUtils]: 26: Hoare triple {1979#(<= main_~k~0 main_~n~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,252 INFO L280 TraceCheckUtils]: 27: Hoare triple {1979#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,253 INFO L280 TraceCheckUtils]: 28: Hoare triple {1979#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,253 INFO L263 TraceCheckUtils]: 29: Hoare triple {1979#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {1966#true} is VALID [2020-07-10 15:29:03,253 INFO L280 TraceCheckUtils]: 30: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2020-07-10 15:29:03,254 INFO L280 TraceCheckUtils]: 31: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2020-07-10 15:29:03,254 INFO L280 TraceCheckUtils]: 32: Hoare triple {1966#true} assume true; {1966#true} is VALID [2020-07-10 15:29:03,255 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1966#true} {1979#(<= main_~k~0 main_~n~0)} #90#return; {1979#(<= main_~k~0 main_~n~0)} is VALID [2020-07-10 15:29:03,256 INFO L263 TraceCheckUtils]: 34: Hoare triple {1979#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {1984#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:03,256 INFO L280 TraceCheckUtils]: 35: Hoare triple {1984#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1985#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:03,257 INFO L280 TraceCheckUtils]: 36: Hoare triple {1985#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1967#false} is VALID [2020-07-10 15:29:03,257 INFO L280 TraceCheckUtils]: 37: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2020-07-10 15:29:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-10 15:29:03,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235300162] [2020-07-10 15:29:03,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:03,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:29:03,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562756840] [2020-07-10 15:29:03,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:29:03,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:03,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:03,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:03,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:03,293 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 6 states. [2020-07-10 15:29:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,515 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-07-10 15:29:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:03,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:29:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 15:29:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-10 15:29:03,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-10 15:29:03,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:03,558 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:29:03,558 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:03,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:03,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:03,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:03,560 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:03,560 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,560 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:03,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:03,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:03,561 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:03,561 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,561 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:03,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:03,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:03,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:03,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:03,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-10 15:29:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:03,563 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:03,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:03,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:03,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:29:03,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:04,077 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:04,077 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:04,077 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:04,077 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:04,077 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point L31(lines 23 33) no Hoare annotation was computed. [2020-07-10 15:29:04,078 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2020-07-10 15:29:04,079 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 33) the Hoare annotation is: (let ((.cse2 (* 2 main_~i~0))) (let ((.cse0 (<= main_~n~0 main_~k~0)) (.cse1 (<= .cse2 main_~j~0))) (or (and (<= main_~k~0 main_~n~0) .cse0 .cse1) (and (<= main_~i~0 0) (<= main_~k~0 (+ .cse2 1)) (<= main_~k~0 main_~j~0) .cse0 .cse1)))) [2020-07-10 15:29:04,079 INFO L268 CegarLoopResult]: For program point L24(lines 24 32) no Hoare annotation was computed. [2020-07-10 15:29:04,079 INFO L264 CegarLoopResult]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0))) [2020-07-10 15:29:04,079 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:04,079 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2020-07-10 15:29:04,079 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 15:29:04,080 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2020-07-10 15:29:04,080 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 15:29:04,080 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~k~0) (<= .cse0 main_~j~0))) [2020-07-10 15:29:04,080 INFO L268 CegarLoopResult]: For program point L26-1(lines 25 27) no Hoare annotation was computed. [2020-07-10 15:29:04,080 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 34) no Hoare annotation was computed. [2020-07-10 15:29:04,080 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 34) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0)) (.cse3 (<= main_~n~0 main_~j~0))) (or (and (<= main_~i~0 0) .cse0 .cse1) (let ((.cse2 (div (+ (* main_~n~0 (- 1)) 1) (- 2)))) (and (<= .cse2 0) (<= (+ .cse2 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse1 .cse3)) (and .cse0 .cse1 .cse3))) [2020-07-10 15:29:04,080 INFO L268 CegarLoopResult]: For program point L18(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L271 CegarLoopResult]: At program point L35(lines 13 37) the Hoare annotation is: true [2020-07-10 15:29:04,081 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:04,081 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:04,086 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:04,087 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:29:04,088 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:04,088 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:04,088 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:04,088 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:29:04,090 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:29:04,091 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 15:29:04,091 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:04,091 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:04,091 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 15:29:04,091 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:04,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:04 BoogieIcfgContainer [2020-07-10 15:29:04,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:04,111 INFO L168 Benchmark]: Toolchain (without parser) took 7527.02 ms. Allocated memory was 136.8 MB in the beginning and 292.6 MB in the end (delta: 155.7 MB). Free memory was 100.4 MB in the beginning and 112.9 MB in the end (delta: -12.5 MB). Peak memory consumption was 143.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,112 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.21 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 90.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,113 INFO L168 Benchmark]: Boogie Preprocessor took 62.03 ms. Allocated memory is still 136.8 MB. Free memory was 90.2 MB in the beginning and 88.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,114 INFO L168 Benchmark]: RCFGBuilder took 525.95 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 88.6 MB in the beginning and 158.6 MB in the end (delta: -70.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,114 INFO L168 Benchmark]: TraceAbstraction took 6544.52 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 157.9 MB in the beginning and 112.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:04,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.21 ms. Allocated memory is still 136.8 MB. Free memory was 100.2 MB in the beginning and 90.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.03 ms. Allocated memory is still 136.8 MB. Free memory was 90.2 MB in the beginning and 88.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 525.95 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 88.6 MB in the beginning and 158.6 MB in the end (delta: -70.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6544.52 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 157.9 MB in the beginning and 112.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((j + 1 <= n && 2 * i <= k) && k <= n) && 2 * i <= j - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((i <= 0 && k <= n) && n <= k) || (((((n * -1 + 1) / -2 <= 0 && (n * -1 + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j)) || ((k <= n && n <= k) && n <= j) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((k <= n && n <= k) && 2 * i <= j) || ((((i <= 0 && k <= 2 * i + 1) && k <= j) && n <= k) && 2 * i <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 186 SDtfs, 96 SDslu, 477 SDs, 0 SdLazy, 354 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 33 PreInvPairs, 56 NumberOfFragments, 166 HoareAnnotationTreeSize, 33 FomulaSimplifications, 1784 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 469 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 14154 SizeOfPredicates, 7 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 73/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...