/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:31:29,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:29,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:29,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:29,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:29,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:29,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:29,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:29,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:29,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:29,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:29,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:29,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:29,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:29,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:29,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:29,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:29,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:29,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:29,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:29,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:29,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:29,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:29,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:29,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:29,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:29,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:29,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:29,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:29,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:29,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:29,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:29,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:29,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:29,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:29,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:29,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:29,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:29,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:29,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:29,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:29,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:29,639 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:29,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:29,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:29,643 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:29,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:29,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:29,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:29,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:29,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:29,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:29,645 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:29,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:29,645 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:29,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:29,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:29,646 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:29,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:29,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:29,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:29,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:29,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:29,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:29,649 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:29,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:29,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:29,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:29,935 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:29,935 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:29,936 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-11 02:31:30,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e018c543c/ea58aa2b831d450f97049fcb3983c6ab/FLAGecfd75310 [2020-07-11 02:31:30,439 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:30,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2020-07-11 02:31:30,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e018c543c/ea58aa2b831d450f97049fcb3983c6ab/FLAGecfd75310 [2020-07-11 02:31:30,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e018c543c/ea58aa2b831d450f97049fcb3983c6ab [2020-07-11 02:31:30,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:30,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:30,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:30,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:30,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:30,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:30" (1/1) ... [2020-07-11 02:31:30,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487f54f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:30, skipping insertion in model container [2020-07-11 02:31:30,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:30" (1/1) ... [2020-07-11 02:31:30,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:30,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:31,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:31,040 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:31,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:31,085 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:31,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31 WrapperNode [2020-07-11 02:31:31,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:31,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:31,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:31,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:31,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (1/1) ... [2020-07-11 02:31:31,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:31,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:31,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:31,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:31,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (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-11 02:31:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:31,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:31,268 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:31,269 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:31,699 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:31,700 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:31:31,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:31 BoogieIcfgContainer [2020-07-11 02:31:31,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:31,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:31,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:31,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:31,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:30" (1/3) ... [2020-07-11 02:31:31,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c85b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:31, skipping insertion in model container [2020-07-11 02:31:31,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:31" (2/3) ... [2020-07-11 02:31:31,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c85b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:31, skipping insertion in model container [2020-07-11 02:31:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:31" (3/3) ... [2020-07-11 02:31:31,712 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2020-07-11 02:31:31,722 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:31,729 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:31,742 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:31,763 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:31,763 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:31,763 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:31,763 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:31,763 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:31,763 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:31,764 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:31,764 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-11 02:31:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:31:31,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:31,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:31,791 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2127483765, now seen corresponding path program 1 times [2020-07-11 02:31:31,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:31,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6720566] [2020-07-11 02:31:31,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:32,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-11 02:31:32,063 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-11 02:31:32,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2020-07-11 02:31:32,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-11 02:31:32,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #106#return; {53#true} is VALID [2020-07-11 02:31:32,067 INFO L263 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret6 := main(); {53#true} is VALID [2020-07-11 02:31:32,067 INFO L280 TraceCheckUtils]: 4: Hoare triple {53#true} havoc ~i~0; {53#true} is VALID [2020-07-11 02:31:32,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {53#true} havoc ~j~0; {53#true} is VALID [2020-07-11 02:31:32,068 INFO L280 TraceCheckUtils]: 6: Hoare triple {53#true} havoc ~k~0; {53#true} is VALID [2020-07-11 02:31:32,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#true} havoc ~n~0; {53#true} is VALID [2020-07-11 02:31:32,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {53#true} is VALID [2020-07-11 02:31:32,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {53#true} ~k~0 := #t~nondet0; {53#true} is VALID [2020-07-11 02:31:32,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {53#true} havoc #t~nondet0; {53#true} is VALID [2020-07-11 02:31:32,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {53#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {53#true} is VALID [2020-07-11 02:31:32,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#true} ~n~0 := #t~nondet1; {53#true} is VALID [2020-07-11 02:31:32,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {53#true} havoc #t~nondet1; {53#true} is VALID [2020-07-11 02:31:32,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {53#true} assume !!(~n~0 < 1000000); {53#true} is VALID [2020-07-11 02:31:32,073 INFO L280 TraceCheckUtils]: 15: Hoare triple {53#true} assume ~k~0 == ~n~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {57#(<= main_~n~0 main_~k~0)} ~j~0 := 2 * ~i~0; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,080 INFO L280 TraceCheckUtils]: 20: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,082 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet4); {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,083 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(<= main_~n~0 main_~k~0)} havoc #t~nondet4; {57#(<= main_~n~0 main_~k~0)} is VALID [2020-07-11 02:31:32,085 INFO L263 TraceCheckUtils]: 23: Hoare triple {57#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:32,086 INFO L280 TraceCheckUtils]: 24: Hoare triple {58#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {59#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:32,087 INFO L280 TraceCheckUtils]: 25: Hoare triple {59#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {54#false} is VALID [2020-07-11 02:31:32,087 INFO L280 TraceCheckUtils]: 26: Hoare triple {54#false} assume !false; {54#false} is VALID [2020-07-11 02:31:32,091 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-11 02:31:32,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6720566] [2020-07-11 02:31:32,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:32,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:31:32,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114838841] [2020-07-11 02:31:32,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:31:32,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:32,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:32,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:32,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:32,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:32,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:32,170 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2020-07-11 02:31:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:32,569 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2020-07-11 02:31:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:32,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:31:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-11 02:31:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2020-07-11 02:31:32,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2020-07-11 02:31:32,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:32,745 INFO L225 Difference]: With dead ends: 89 [2020-07-11 02:31:32,746 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 02:31:32,750 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-11 02:31:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 02:31:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-11 02:31:32,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:32,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-11 02:31:32,825 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-11 02:31:32,825 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-11 02:31:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:32,832 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-11 02:31:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-11 02:31:32,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:32,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:32,834 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-11 02:31:32,834 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-11 02:31:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:32,839 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-11 02:31:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-11 02:31:32,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:32,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:32,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:32,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-11 02:31:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-11 02:31:32,846 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2020-07-11 02:31:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:32,847 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-11 02:31:32,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:32,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2020-07-11 02:31:32,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-11 02:31:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 02:31:32,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:32,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:32,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:32,911 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1763359327, now seen corresponding path program 1 times [2020-07-11 02:31:32,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:32,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796743294] [2020-07-11 02:31:32,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:33,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:31:33,001 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-11 02:31:33,002 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-11 02:31:33,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:31:33,002 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #106#return; {434#true} is VALID [2020-07-11 02:31:33,003 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret6 := main(); {434#true} is VALID [2020-07-11 02:31:33,003 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-11 02:31:33,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~j~0; {434#true} is VALID [2020-07-11 02:31:33,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} havoc ~k~0; {434#true} is VALID [2020-07-11 02:31:33,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc ~n~0; {434#true} is VALID [2020-07-11 02:31:33,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {434#true} is VALID [2020-07-11 02:31:33,005 INFO L280 TraceCheckUtils]: 9: Hoare triple {434#true} ~k~0 := #t~nondet0; {434#true} is VALID [2020-07-11 02:31:33,005 INFO L280 TraceCheckUtils]: 10: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-11 02:31:33,005 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {434#true} is VALID [2020-07-11 02:31:33,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#true} ~n~0 := #t~nondet1; {434#true} is VALID [2020-07-11 02:31:33,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {434#true} havoc #t~nondet1; {434#true} is VALID [2020-07-11 02:31:33,006 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#true} assume !!(~n~0 < 1000000); {434#true} is VALID [2020-07-11 02:31:33,007 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#true} assume ~k~0 == ~n~0; {434#true} is VALID [2020-07-11 02:31:33,007 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#true} ~i~0 := 0; {434#true} is VALID [2020-07-11 02:31:33,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {434#true} assume !!(~i~0 < ~n~0); {434#true} is VALID [2020-07-11 02:31:33,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {434#true} ~j~0 := 2 * ~i~0; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:33,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:33,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:33,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:33,011 INFO L280 TraceCheckUtils]: 22: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {438#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:33,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {438#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:33,013 INFO L280 TraceCheckUtils]: 24: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {439#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:33,014 INFO L263 TraceCheckUtils]: 25: Hoare triple {439#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:33,015 INFO L280 TraceCheckUtils]: 26: Hoare triple {440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {441#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:33,016 INFO L280 TraceCheckUtils]: 27: Hoare triple {441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-11 02:31:33,016 INFO L280 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-11 02:31:33,018 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-11 02:31:33,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796743294] [2020-07-11 02:31:33,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:33,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:33,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560648711] [2020-07-11 02:31:33,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 02:31:33,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:33,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:33,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:33,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:33,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:33,057 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-07-11 02:31:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:33,599 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2020-07-11 02:31:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:31:33,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 02:31:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-11 02:31:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-11 02:31:33,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2020-07-11 02:31:33,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:33,733 INFO L225 Difference]: With dead ends: 90 [2020-07-11 02:31:33,733 INFO L226 Difference]: Without dead ends: 88 [2020-07-11 02:31:33,734 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-11 02:31:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-11 02:31:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2020-07-11 02:31:33,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:33,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 59 states. [2020-07-11 02:31:33,799 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 59 states. [2020-07-11 02:31:33,799 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 59 states. [2020-07-11 02:31:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:33,806 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-11 02:31:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-11 02:31:33,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:33,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:33,808 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 88 states. [2020-07-11 02:31:33,808 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 88 states. [2020-07-11 02:31:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:33,814 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-07-11 02:31:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2020-07-11 02:31:33,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:33,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:33,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:33,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-11 02:31:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-07-11 02:31:33,820 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2020-07-11 02:31:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:33,820 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-07-11 02:31:33,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:33,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2020-07-11 02:31:33,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-07-11 02:31:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 02:31:33,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:33,896 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:33,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:33,897 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2139784298, now seen corresponding path program 1 times [2020-07-11 02:31:33,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:33,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127228191] [2020-07-11 02:31:33,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-11 02:31:34,007 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-11 02:31:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-11 02:31:34,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-11 02:31:34,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-11 02:31:34,016 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,016 INFO L263 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2020-07-11 02:31:34,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-11 02:31:34,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #106#return; {922#true} is VALID [2020-07-11 02:31:34,017 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2020-07-11 02:31:34,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} havoc ~i~0; {922#true} is VALID [2020-07-11 02:31:34,017 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~j~0; {922#true} is VALID [2020-07-11 02:31:34,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} havoc ~k~0; {922#true} is VALID [2020-07-11 02:31:34,018 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#true} havoc ~n~0; {922#true} is VALID [2020-07-11 02:31:34,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {922#true} is VALID [2020-07-11 02:31:34,019 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} ~k~0 := #t~nondet0; {922#true} is VALID [2020-07-11 02:31:34,019 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} havoc #t~nondet0; {922#true} is VALID [2020-07-11 02:31:34,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {922#true} is VALID [2020-07-11 02:31:34,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~n~0 := #t~nondet1; {922#true} is VALID [2020-07-11 02:31:34,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} havoc #t~nondet1; {922#true} is VALID [2020-07-11 02:31:34,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume !!(~n~0 < 1000000); {922#true} is VALID [2020-07-11 02:31:34,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {922#true} assume ~k~0 == ~n~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,024 INFO L280 TraceCheckUtils]: 17: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,025 INFO L280 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~k~0 main_~n~0)} ~j~0 := 2 * ~i~0; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,027 INFO L280 TraceCheckUtils]: 19: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,028 INFO L280 TraceCheckUtils]: 20: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,029 INFO L280 TraceCheckUtils]: 21: Hoare triple {926#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,029 INFO L280 TraceCheckUtils]: 22: Hoare triple {926#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,030 INFO L263 TraceCheckUtils]: 23: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {922#true} is VALID [2020-07-11 02:31:34,030 INFO L280 TraceCheckUtils]: 24: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2020-07-11 02:31:34,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2020-07-11 02:31:34,031 INFO L280 TraceCheckUtils]: 26: Hoare triple {922#true} assume true; {922#true} is VALID [2020-07-11 02:31:34,032 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {922#true} {926#(<= main_~k~0 main_~n~0)} #112#return; {926#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:34,033 INFO L263 TraceCheckUtils]: 28: Hoare triple {926#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:34,033 INFO L280 TraceCheckUtils]: 29: Hoare triple {931#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {932#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:34,034 INFO L280 TraceCheckUtils]: 30: Hoare triple {932#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {923#false} is VALID [2020-07-11 02:31:34,034 INFO L280 TraceCheckUtils]: 31: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-11 02:31:34,036 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-11 02:31:34,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127228191] [2020-07-11 02:31:34,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:34,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:31:34,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462020155] [2020-07-11 02:31:34,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-11 02:31:34,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:34,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:31:34,068 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-11 02:31:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:31:34,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:31:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:31:34,069 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2020-07-11 02:31:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:34,430 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2020-07-11 02:31:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:31:34,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-11 02:31:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-11 02:31:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:31:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-11 02:31:34,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-11 02:31:34,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:34,530 INFO L225 Difference]: With dead ends: 86 [2020-07-11 02:31:34,531 INFO L226 Difference]: Without dead ends: 84 [2020-07-11 02:31:34,531 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-11 02:31:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-11 02:31:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2020-07-11 02:31:34,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:34,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2020-07-11 02:31:34,661 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2020-07-11 02:31:34,661 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2020-07-11 02:31:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:34,665 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-11 02:31:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-11 02:31:34,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:34,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:34,667 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2020-07-11 02:31:34,667 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2020-07-11 02:31:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:34,672 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-11 02:31:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-11 02:31:34,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:34,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:34,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:34,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-11 02:31:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2020-07-11 02:31:34,677 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 32 [2020-07-11 02:31:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:34,677 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2020-07-11 02:31:34,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:31:34,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 92 transitions. [2020-07-11 02:31:34,794 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-11 02:31:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2020-07-11 02:31:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 02:31:34,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:34,796 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:34,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:31:34,797 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:34,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash -268568898, now seen corresponding path program 1 times [2020-07-11 02:31:34,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:34,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865502775] [2020-07-11 02:31:34,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:31:34,906 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-11 02:31:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:34,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-11 02:31:34,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-11 02:31:34,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:31:34,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:34,917 INFO L263 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2020-07-11 02:31:34,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:31:34,918 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1437#true} {1437#true} #106#return; {1437#true} is VALID [2020-07-11 02:31:34,918 INFO L263 TraceCheckUtils]: 3: Hoare triple {1437#true} call #t~ret6 := main(); {1437#true} is VALID [2020-07-11 02:31:34,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} havoc ~i~0; {1437#true} is VALID [2020-07-11 02:31:34,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {1437#true} havoc ~j~0; {1437#true} is VALID [2020-07-11 02:31:34,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {1437#true} havoc ~k~0; {1437#true} is VALID [2020-07-11 02:31:34,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {1437#true} havoc ~n~0; {1437#true} is VALID [2020-07-11 02:31:34,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {1437#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1437#true} is VALID [2020-07-11 02:31:34,920 INFO L280 TraceCheckUtils]: 9: Hoare triple {1437#true} ~k~0 := #t~nondet0; {1437#true} is VALID [2020-07-11 02:31:34,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {1437#true} havoc #t~nondet0; {1437#true} is VALID [2020-07-11 02:31:34,920 INFO L280 TraceCheckUtils]: 11: Hoare triple {1437#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1437#true} is VALID [2020-07-11 02:31:34,920 INFO L280 TraceCheckUtils]: 12: Hoare triple {1437#true} ~n~0 := #t~nondet1; {1437#true} is VALID [2020-07-11 02:31:34,921 INFO L280 TraceCheckUtils]: 13: Hoare triple {1437#true} havoc #t~nondet1; {1437#true} is VALID [2020-07-11 02:31:34,921 INFO L280 TraceCheckUtils]: 14: Hoare triple {1437#true} assume !!(~n~0 < 1000000); {1437#true} is VALID [2020-07-11 02:31:34,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {1437#true} assume ~k~0 == ~n~0; {1437#true} is VALID [2020-07-11 02:31:34,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#true} ~i~0 := 0; {1437#true} is VALID [2020-07-11 02:31:34,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#true} assume !!(~i~0 < ~n~0); {1437#true} is VALID [2020-07-11 02:31:34,922 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#true} ~j~0 := 2 * ~i~0; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:34,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:34,924 INFO L280 TraceCheckUtils]: 20: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:34,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} assume 0 != #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:34,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {1441#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:34,934 INFO L280 TraceCheckUtils]: 23: Hoare triple {1441#(<= (* 2 main_~i~0) main_~j~0)} ~k~0 := ~j~0; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:34,935 INFO L280 TraceCheckUtils]: 24: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} assume !!(~k~0 < ~n~0); {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:34,935 INFO L263 TraceCheckUtils]: 25: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1437#true} is VALID [2020-07-11 02:31:34,935 INFO L280 TraceCheckUtils]: 26: Hoare triple {1437#true} ~cond := #in~cond; {1437#true} is VALID [2020-07-11 02:31:34,935 INFO L280 TraceCheckUtils]: 27: Hoare triple {1437#true} assume !(0 == ~cond); {1437#true} is VALID [2020-07-11 02:31:34,936 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:31:34,938 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1442#(<= (* 2 main_~i~0) main_~k~0)} #110#return; {1442#(<= (* 2 main_~i~0) main_~k~0)} is VALID [2020-07-11 02:31:34,946 INFO L280 TraceCheckUtils]: 30: Hoare triple {1442#(<= (* 2 main_~i~0) main_~k~0)} #t~post5 := ~k~0; {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} is VALID [2020-07-11 02:31:34,948 INFO L280 TraceCheckUtils]: 31: Hoare triple {1447#(<= (* 2 main_~i~0) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:34,948 INFO L280 TraceCheckUtils]: 32: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} havoc #t~post5; {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:34,952 INFO L280 TraceCheckUtils]: 33: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:34,954 INFO L263 TraceCheckUtils]: 34: Hoare triple {1448#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:34,958 INFO L280 TraceCheckUtils]: 35: Hoare triple {1449#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1450#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:34,958 INFO L280 TraceCheckUtils]: 36: Hoare triple {1450#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1438#false} is VALID [2020-07-11 02:31:34,958 INFO L280 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2020-07-11 02:31:34,962 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-11 02:31:34,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865502775] [2020-07-11 02:31:34,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:34,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:31:34,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753389510] [2020-07-11 02:31:34,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-11 02:31:34,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:34,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:35,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:35,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:35,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:35,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:35,018 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 8 states. [2020-07-11 02:31:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:35,930 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2020-07-11 02:31:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:31:35,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-11 02:31:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-11 02:31:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2020-07-11 02:31:35,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 121 transitions. [2020-07-11 02:31:36,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:36,096 INFO L225 Difference]: With dead ends: 137 [2020-07-11 02:31:36,096 INFO L226 Difference]: Without dead ends: 135 [2020-07-11 02:31:36,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:31:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-11 02:31:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-07-11 02:31:36,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:36,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 83 states. [2020-07-11 02:31:36,221 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 83 states. [2020-07-11 02:31:36,222 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 83 states. [2020-07-11 02:31:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:36,231 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-11 02:31:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-11 02:31:36,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:36,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:36,233 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 135 states. [2020-07-11 02:31:36,233 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 135 states. [2020-07-11 02:31:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:36,239 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2020-07-11 02:31:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2020-07-11 02:31:36,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:36,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:36,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:36,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-11 02:31:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2020-07-11 02:31:36,244 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 38 [2020-07-11 02:31:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:36,244 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2020-07-11 02:31:36,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:36,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 95 transitions. [2020-07-11 02:31:36,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2020-07-11 02:31:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 02:31:36,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:36,382 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2020-07-11 02:31:36,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:31:36,382 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash -360550748, now seen corresponding path program 1 times [2020-07-11 02:31:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:36,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708606423] [2020-07-11 02:31:36,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:36,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-11 02:31:36,448 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-11 02:31:36,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2020-07-11 02:31:36,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {2173#true} assume true; {2173#true} is VALID [2020-07-11 02:31:36,449 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2173#true} {2173#true} #106#return; {2173#true} is VALID [2020-07-11 02:31:36,449 INFO L263 TraceCheckUtils]: 3: Hoare triple {2173#true} call #t~ret6 := main(); {2173#true} is VALID [2020-07-11 02:31:36,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {2173#true} havoc ~i~0; {2173#true} is VALID [2020-07-11 02:31:36,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~j~0; {2173#true} is VALID [2020-07-11 02:31:36,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {2173#true} havoc ~k~0; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {2173#true} havoc ~n~0; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {2173#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {2173#true} ~k~0 := #t~nondet0; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {2173#true} havoc #t~nondet0; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {2173#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2173#true} is VALID [2020-07-11 02:31:36,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {2173#true} ~n~0 := #t~nondet1; {2173#true} is VALID [2020-07-11 02:31:36,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {2173#true} havoc #t~nondet1; {2173#true} is VALID [2020-07-11 02:31:36,451 INFO L280 TraceCheckUtils]: 14: Hoare triple {2173#true} assume !!(~n~0 < 1000000); {2173#true} is VALID [2020-07-11 02:31:36,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {2173#true} assume ~k~0 == ~n~0; {2173#true} is VALID [2020-07-11 02:31:36,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {2173#true} ~i~0 := 0; {2177#(<= main_~i~0 0)} is VALID [2020-07-11 02:31:36,452 INFO L280 TraceCheckUtils]: 17: Hoare triple {2177#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-11 02:31:36,453 INFO L280 TraceCheckUtils]: 18: Hoare triple {2178#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,454 INFO L280 TraceCheckUtils]: 19: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,454 INFO L280 TraceCheckUtils]: 20: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,454 INFO L280 TraceCheckUtils]: 21: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,455 INFO L280 TraceCheckUtils]: 22: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {2179#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,456 INFO L280 TraceCheckUtils]: 23: Hoare triple {2179#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {2180#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-11 02:31:36,457 INFO L280 TraceCheckUtils]: 24: Hoare triple {2180#(<= (+ main_~k~0 1) main_~n~0)} assume !(~k~0 < ~n~0); {2174#false} is VALID [2020-07-11 02:31:36,457 INFO L280 TraceCheckUtils]: 25: Hoare triple {2174#false} #t~post3 := ~j~0; {2174#false} is VALID [2020-07-11 02:31:36,457 INFO L280 TraceCheckUtils]: 26: Hoare triple {2174#false} ~j~0 := 1 + #t~post3; {2174#false} is VALID [2020-07-11 02:31:36,457 INFO L280 TraceCheckUtils]: 27: Hoare triple {2174#false} havoc #t~post3; {2174#false} is VALID [2020-07-11 02:31:36,457 INFO L280 TraceCheckUtils]: 28: Hoare triple {2174#false} assume !!(~j~0 < ~n~0); {2174#false} is VALID [2020-07-11 02:31:36,458 INFO L280 TraceCheckUtils]: 29: Hoare triple {2174#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2174#false} is VALID [2020-07-11 02:31:36,458 INFO L280 TraceCheckUtils]: 30: Hoare triple {2174#false} assume 0 != #t~nondet4; {2174#false} is VALID [2020-07-11 02:31:36,458 INFO L280 TraceCheckUtils]: 31: Hoare triple {2174#false} havoc #t~nondet4; {2174#false} is VALID [2020-07-11 02:31:36,458 INFO L280 TraceCheckUtils]: 32: Hoare triple {2174#false} ~k~0 := ~j~0; {2174#false} is VALID [2020-07-11 02:31:36,458 INFO L280 TraceCheckUtils]: 33: Hoare triple {2174#false} assume !!(~k~0 < ~n~0); {2174#false} is VALID [2020-07-11 02:31:36,459 INFO L263 TraceCheckUtils]: 34: Hoare triple {2174#false} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {2174#false} is VALID [2020-07-11 02:31:36,459 INFO L280 TraceCheckUtils]: 35: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2020-07-11 02:31:36,459 INFO L280 TraceCheckUtils]: 36: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2020-07-11 02:31:36,459 INFO L280 TraceCheckUtils]: 37: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2020-07-11 02:31:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:36,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708606423] [2020-07-11 02:31:36,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284586648] [2020-07-11 02:31:36,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-11 02:31:36,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:36,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:36,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:36,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:36,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:36,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:36,501 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 6 states. [2020-07-11 02:31:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:37,170 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-07-11 02:31:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:31:37,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-11 02:31:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-11 02:31:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2020-07-11 02:31:37,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2020-07-11 02:31:37,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:37,304 INFO L225 Difference]: With dead ends: 194 [2020-07-11 02:31:37,305 INFO L226 Difference]: Without dead ends: 128 [2020-07-11 02:31:37,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:31:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-11 02:31:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2020-07-11 02:31:37,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:37,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 88 states. [2020-07-11 02:31:37,481 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 88 states. [2020-07-11 02:31:37,481 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 88 states. [2020-07-11 02:31:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:37,488 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-11 02:31:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-11 02:31:37,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:37,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:37,489 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 128 states. [2020-07-11 02:31:37,489 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 128 states. [2020-07-11 02:31:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:37,494 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2020-07-11 02:31:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2020-07-11 02:31:37,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:37,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:37,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:37,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-11 02:31:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2020-07-11 02:31:37,499 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 38 [2020-07-11 02:31:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:37,499 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-07-11 02:31:37,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:37,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 100 transitions. [2020-07-11 02:31:37,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2020-07-11 02:31:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 02:31:37,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:37,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:37,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:31:37,639 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1447898534, now seen corresponding path program 1 times [2020-07-11 02:31:37,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:37,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319355724] [2020-07-11 02:31:37,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:37,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,764 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-11 02:31:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:37,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-11 02:31:37,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-11 02:31:37,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:37,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-11 02:31:37,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-11 02:31:37,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,794 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {3011#true} call ULTIMATE.init(); {3011#true} is VALID [2020-07-11 02:31:37,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,795 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3011#true} {3011#true} #106#return; {3011#true} is VALID [2020-07-11 02:31:37,795 INFO L263 TraceCheckUtils]: 3: Hoare triple {3011#true} call #t~ret6 := main(); {3011#true} is VALID [2020-07-11 02:31:37,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {3011#true} havoc ~i~0; {3011#true} is VALID [2020-07-11 02:31:37,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {3011#true} havoc ~j~0; {3011#true} is VALID [2020-07-11 02:31:37,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {3011#true} havoc ~k~0; {3011#true} is VALID [2020-07-11 02:31:37,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#true} havoc ~n~0; {3011#true} is VALID [2020-07-11 02:31:37,796 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3011#true} is VALID [2020-07-11 02:31:37,797 INFO L280 TraceCheckUtils]: 9: Hoare triple {3011#true} ~k~0 := #t~nondet0; {3011#true} is VALID [2020-07-11 02:31:37,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {3011#true} havoc #t~nondet0; {3011#true} is VALID [2020-07-11 02:31:37,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {3011#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3011#true} is VALID [2020-07-11 02:31:37,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {3011#true} ~n~0 := #t~nondet1; {3011#true} is VALID [2020-07-11 02:31:37,798 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#true} havoc #t~nondet1; {3011#true} is VALID [2020-07-11 02:31:37,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#true} assume !!(~n~0 < 1000000); {3011#true} is VALID [2020-07-11 02:31:37,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#true} assume ~k~0 == ~n~0; {3011#true} is VALID [2020-07-11 02:31:37,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {3011#true} ~i~0 := 0; {3011#true} is VALID [2020-07-11 02:31:37,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {3011#true} assume !!(~i~0 < ~n~0); {3011#true} is VALID [2020-07-11 02:31:37,799 INFO L280 TraceCheckUtils]: 18: Hoare triple {3011#true} ~j~0 := 2 * ~i~0; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,800 INFO L280 TraceCheckUtils]: 19: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,810 INFO L280 TraceCheckUtils]: 20: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,810 INFO L280 TraceCheckUtils]: 21: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,811 INFO L280 TraceCheckUtils]: 22: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,811 INFO L263 TraceCheckUtils]: 23: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-11 02:31:37,811 INFO L280 TraceCheckUtils]: 24: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-11 02:31:37,811 INFO L280 TraceCheckUtils]: 25: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-11 02:31:37,812 INFO L280 TraceCheckUtils]: 26: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,813 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,813 INFO L263 TraceCheckUtils]: 28: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3011#true} is VALID [2020-07-11 02:31:37,813 INFO L280 TraceCheckUtils]: 29: Hoare triple {3011#true} ~cond := #in~cond; {3011#true} is VALID [2020-07-11 02:31:37,813 INFO L280 TraceCheckUtils]: 30: Hoare triple {3011#true} assume !(0 == ~cond); {3011#true} is VALID [2020-07-11 02:31:37,814 INFO L280 TraceCheckUtils]: 31: Hoare triple {3011#true} assume true; {3011#true} is VALID [2020-07-11 02:31:37,815 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3011#true} {3015#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {3015#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:37,818 INFO L280 TraceCheckUtils]: 33: Hoare triple {3015#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-11 02:31:37,818 INFO L280 TraceCheckUtils]: 34: Hoare triple {3024#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,820 INFO L280 TraceCheckUtils]: 36: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,820 INFO L280 TraceCheckUtils]: 37: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,821 INFO L280 TraceCheckUtils]: 38: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,821 INFO L280 TraceCheckUtils]: 39: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:37,822 INFO L280 TraceCheckUtils]: 40: Hoare triple {3025#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:37,822 INFO L280 TraceCheckUtils]: 41: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:37,823 INFO L263 TraceCheckUtils]: 42: Hoare triple {3026#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:37,824 INFO L280 TraceCheckUtils]: 43: Hoare triple {3027#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3028#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:37,824 INFO L280 TraceCheckUtils]: 44: Hoare triple {3028#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3012#false} is VALID [2020-07-11 02:31:37,824 INFO L280 TraceCheckUtils]: 45: Hoare triple {3012#false} assume !false; {3012#false} is VALID [2020-07-11 02:31:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 02:31:37,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319355724] [2020-07-11 02:31:37,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:37,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:31:37,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86928663] [2020-07-11 02:31:37,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-11 02:31:37,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:37,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:37,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:37,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:37,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:37,875 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 8 states. [2020-07-11 02:31:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:38,639 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2020-07-11 02:31:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:31:38,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-11 02:31:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-11 02:31:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-11 02:31:38,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2020-07-11 02:31:38,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:38,757 INFO L225 Difference]: With dead ends: 111 [2020-07-11 02:31:38,757 INFO L226 Difference]: Without dead ends: 109 [2020-07-11 02:31:38,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:31:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-11 02:31:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2020-07-11 02:31:38,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:38,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 93 states. [2020-07-11 02:31:38,948 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 93 states. [2020-07-11 02:31:38,949 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 93 states. [2020-07-11 02:31:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:38,954 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-11 02:31:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-11 02:31:38,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:38,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:38,955 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 109 states. [2020-07-11 02:31:38,955 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 109 states. [2020-07-11 02:31:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:38,959 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-11 02:31:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2020-07-11 02:31:38,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:38,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:38,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:38,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-11 02:31:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2020-07-11 02:31:38,964 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 46 [2020-07-11 02:31:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:38,964 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2020-07-11 02:31:38,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:38,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 105 transitions. [2020-07-11 02:31:39,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2020-07-11 02:31:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 02:31:39,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:39,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:39,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:31:39,134 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash 87970788, now seen corresponding path program 1 times [2020-07-11 02:31:39,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:39,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882133862] [2020-07-11 02:31:39,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:39,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,284 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-11 02:31:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:39,289 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-11 02:31:39,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-11 02:31:39,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,291 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:39,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-11 02:31:39,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-11 02:31:39,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,298 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,299 INFO L263 TraceCheckUtils]: 0: Hoare triple {3665#true} call ULTIMATE.init(); {3665#true} is VALID [2020-07-11 02:31:39,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,299 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3665#true} {3665#true} #106#return; {3665#true} is VALID [2020-07-11 02:31:39,300 INFO L263 TraceCheckUtils]: 3: Hoare triple {3665#true} call #t~ret6 := main(); {3665#true} is VALID [2020-07-11 02:31:39,300 INFO L280 TraceCheckUtils]: 4: Hoare triple {3665#true} havoc ~i~0; {3665#true} is VALID [2020-07-11 02:31:39,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {3665#true} havoc ~j~0; {3665#true} is VALID [2020-07-11 02:31:39,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {3665#true} havoc ~k~0; {3665#true} is VALID [2020-07-11 02:31:39,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {3665#true} havoc ~n~0; {3665#true} is VALID [2020-07-11 02:31:39,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {3665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3665#true} is VALID [2020-07-11 02:31:39,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {3665#true} ~k~0 := #t~nondet0; {3665#true} is VALID [2020-07-11 02:31:39,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {3665#true} havoc #t~nondet0; {3665#true} is VALID [2020-07-11 02:31:39,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {3665#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3665#true} is VALID [2020-07-11 02:31:39,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {3665#true} ~n~0 := #t~nondet1; {3665#true} is VALID [2020-07-11 02:31:39,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {3665#true} havoc #t~nondet1; {3665#true} is VALID [2020-07-11 02:31:39,302 INFO L280 TraceCheckUtils]: 14: Hoare triple {3665#true} assume !!(~n~0 < 1000000); {3665#true} is VALID [2020-07-11 02:31:39,302 INFO L280 TraceCheckUtils]: 15: Hoare triple {3665#true} assume ~k~0 == ~n~0; {3665#true} is VALID [2020-07-11 02:31:39,303 INFO L280 TraceCheckUtils]: 16: Hoare triple {3665#true} ~i~0 := 0; {3669#(<= main_~i~0 0)} is VALID [2020-07-11 02:31:39,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {3669#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0); {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} is VALID [2020-07-11 02:31:39,305 INFO L280 TraceCheckUtils]: 18: Hoare triple {3670#(<= (+ (* 2 main_~i~0) 1) main_~n~0)} ~j~0 := 2 * ~i~0; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 < ~n~0); {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,307 INFO L280 TraceCheckUtils]: 20: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,308 INFO L280 TraceCheckUtils]: 21: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,308 INFO L280 TraceCheckUtils]: 22: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} havoc #t~nondet4; {3671#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,309 INFO L280 TraceCheckUtils]: 23: Hoare triple {3671#(<= (+ main_~j~0 1) main_~n~0)} ~k~0 := ~j~0; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,310 INFO L280 TraceCheckUtils]: 24: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} assume !!(~k~0 < ~n~0); {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,310 INFO L263 TraceCheckUtils]: 25: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {3665#true} is VALID [2020-07-11 02:31:39,311 INFO L280 TraceCheckUtils]: 26: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-11 02:31:39,311 INFO L280 TraceCheckUtils]: 27: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-11 02:31:39,311 INFO L280 TraceCheckUtils]: 28: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,312 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3665#true} {3672#(<= (+ main_~k~0 1) main_~n~0)} #110#return; {3672#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2020-07-11 02:31:39,313 INFO L280 TraceCheckUtils]: 30: Hoare triple {3672#(<= (+ main_~k~0 1) main_~n~0)} #t~post5 := ~k~0; {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} is VALID [2020-07-11 02:31:39,314 INFO L280 TraceCheckUtils]: 31: Hoare triple {3677#(<= (+ |main_#t~post5| 1) main_~n~0)} ~k~0 := 1 + #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,314 INFO L280 TraceCheckUtils]: 32: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post5; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,315 INFO L280 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(~k~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,316 INFO L280 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~k~0 main_~n~0)} #t~post3 := ~j~0; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,316 INFO L280 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~k~0 main_~n~0)} ~j~0 := 1 + #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,317 INFO L280 TraceCheckUtils]: 36: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~post3; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,318 INFO L280 TraceCheckUtils]: 37: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,319 INFO L280 TraceCheckUtils]: 38: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,319 INFO L280 TraceCheckUtils]: 39: Hoare triple {3678#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet4); {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,320 INFO L280 TraceCheckUtils]: 40: Hoare triple {3678#(<= main_~k~0 main_~n~0)} havoc #t~nondet4; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,320 INFO L263 TraceCheckUtils]: 41: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {3665#true} is VALID [2020-07-11 02:31:39,321 INFO L280 TraceCheckUtils]: 42: Hoare triple {3665#true} ~cond := #in~cond; {3665#true} is VALID [2020-07-11 02:31:39,321 INFO L280 TraceCheckUtils]: 43: Hoare triple {3665#true} assume !(0 == ~cond); {3665#true} is VALID [2020-07-11 02:31:39,321 INFO L280 TraceCheckUtils]: 44: Hoare triple {3665#true} assume true; {3665#true} is VALID [2020-07-11 02:31:39,322 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3665#true} {3678#(<= main_~k~0 main_~n~0)} #112#return; {3678#(<= main_~k~0 main_~n~0)} is VALID [2020-07-11 02:31:39,324 INFO L263 TraceCheckUtils]: 46: Hoare triple {3678#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:39,324 INFO L280 TraceCheckUtils]: 47: Hoare triple {3683#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3684#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:39,325 INFO L280 TraceCheckUtils]: 48: Hoare triple {3684#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3666#false} is VALID [2020-07-11 02:31:39,326 INFO L280 TraceCheckUtils]: 49: Hoare triple {3666#false} assume !false; {3666#false} is VALID [2020-07-11 02:31:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 02:31:39,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882133862] [2020-07-11 02:31:39,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:39,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:31:39,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583988062] [2020-07-11 02:31:39,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-11 02:31:39,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:39,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:31:39,378 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-11 02:31:39,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:31:39,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:31:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:31:39,379 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 10 states. [2020-07-11 02:31:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:40,495 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2020-07-11 02:31:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:31:40,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-07-11 02:31:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:31:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-11 02:31:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:31:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2020-07-11 02:31:40,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 83 transitions. [2020-07-11 02:31:40,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:40,589 INFO L225 Difference]: With dead ends: 140 [2020-07-11 02:31:40,589 INFO L226 Difference]: Without dead ends: 138 [2020-07-11 02:31:40,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-07-11 02:31:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-11 02:31:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2020-07-11 02:31:40,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:40,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 76 states. [2020-07-11 02:31:40,751 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 76 states. [2020-07-11 02:31:40,751 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 76 states. [2020-07-11 02:31:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:40,759 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-11 02:31:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-11 02:31:40,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:40,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:40,760 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 138 states. [2020-07-11 02:31:40,760 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 138 states. [2020-07-11 02:31:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:40,766 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-07-11 02:31:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2020-07-11 02:31:40,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:40,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:40,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:40,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 02:31:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-11 02:31:40,770 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 50 [2020-07-11 02:31:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:40,770 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-11 02:31:40,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:31:40,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2020-07-11 02:31:40,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-11 02:31:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 02:31:40,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:40,931 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:40,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:31:40,931 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2033926999, now seen corresponding path program 1 times [2020-07-11 02:31:40,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:40,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371013018] [2020-07-11 02:31:40,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:41,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,076 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-11 02:31:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:41,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:41,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,093 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:41,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,099 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:41,100 INFO L263 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2020-07-11 02:31:41,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,100 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #106#return; {4417#true} is VALID [2020-07-11 02:31:41,100 INFO L263 TraceCheckUtils]: 3: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2020-07-11 02:31:41,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {4417#true} havoc ~i~0; {4417#true} is VALID [2020-07-11 02:31:41,101 INFO L280 TraceCheckUtils]: 5: Hoare triple {4417#true} havoc ~j~0; {4417#true} is VALID [2020-07-11 02:31:41,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {4417#true} havoc ~k~0; {4417#true} is VALID [2020-07-11 02:31:41,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {4417#true} havoc ~n~0; {4417#true} is VALID [2020-07-11 02:31:41,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {4417#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4417#true} is VALID [2020-07-11 02:31:41,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {4417#true} ~k~0 := #t~nondet0; {4417#true} is VALID [2020-07-11 02:31:41,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {4417#true} havoc #t~nondet0; {4417#true} is VALID [2020-07-11 02:31:41,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {4417#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4417#true} is VALID [2020-07-11 02:31:41,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {4417#true} ~n~0 := #t~nondet1; {4417#true} is VALID [2020-07-11 02:31:41,103 INFO L280 TraceCheckUtils]: 13: Hoare triple {4417#true} havoc #t~nondet1; {4417#true} is VALID [2020-07-11 02:31:41,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {4417#true} assume !!(~n~0 < 1000000); {4417#true} is VALID [2020-07-11 02:31:41,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {4417#true} assume ~k~0 == ~n~0; {4417#true} is VALID [2020-07-11 02:31:41,103 INFO L280 TraceCheckUtils]: 16: Hoare triple {4417#true} ~i~0 := 0; {4417#true} is VALID [2020-07-11 02:31:41,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {4417#true} assume !!(~i~0 < ~n~0); {4417#true} is VALID [2020-07-11 02:31:41,104 INFO L280 TraceCheckUtils]: 18: Hoare triple {4417#true} ~j~0 := 2 * ~i~0; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,104 INFO L280 TraceCheckUtils]: 19: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < ~n~0); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,105 INFO L280 TraceCheckUtils]: 20: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,105 INFO L280 TraceCheckUtils]: 21: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} assume !(0 != #t~nondet4); {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,105 INFO L280 TraceCheckUtils]: 22: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} havoc #t~nondet4; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,106 INFO L263 TraceCheckUtils]: 23: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-11 02:31:41,106 INFO L280 TraceCheckUtils]: 24: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,106 INFO L280 TraceCheckUtils]: 25: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,106 INFO L280 TraceCheckUtils]: 26: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,107 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #112#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,107 INFO L263 TraceCheckUtils]: 28: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {4417#true} is VALID [2020-07-11 02:31:41,107 INFO L280 TraceCheckUtils]: 29: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,107 INFO L280 TraceCheckUtils]: 30: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,107 INFO L280 TraceCheckUtils]: 31: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,108 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4417#true} {4421#(<= (* 2 main_~i~0) main_~j~0)} #114#return; {4421#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-11 02:31:41,108 INFO L280 TraceCheckUtils]: 33: Hoare triple {4421#(<= (* 2 main_~i~0) main_~j~0)} #t~post3 := ~j~0; {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} is VALID [2020-07-11 02:31:41,109 INFO L280 TraceCheckUtils]: 34: Hoare triple {4430#(<= (* 2 main_~i~0) |main_#t~post3|)} ~j~0 := 1 + #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,109 INFO L280 TraceCheckUtils]: 35: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~post3; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,110 INFO L280 TraceCheckUtils]: 36: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume !!(~j~0 < ~n~0); {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,111 INFO L280 TraceCheckUtils]: 37: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,111 INFO L280 TraceCheckUtils]: 38: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} assume 0 != #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,112 INFO L280 TraceCheckUtils]: 39: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} havoc #t~nondet4; {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} is VALID [2020-07-11 02:31:41,112 INFO L280 TraceCheckUtils]: 40: Hoare triple {4431#(<= (+ (* 2 main_~i~0) 1) main_~j~0)} ~k~0 := ~j~0; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:41,113 INFO L280 TraceCheckUtils]: 41: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} assume !!(~k~0 < ~n~0); {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:41,113 INFO L263 TraceCheckUtils]: 42: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4417#true} is VALID [2020-07-11 02:31:41,113 INFO L280 TraceCheckUtils]: 43: Hoare triple {4417#true} ~cond := #in~cond; {4417#true} is VALID [2020-07-11 02:31:41,113 INFO L280 TraceCheckUtils]: 44: Hoare triple {4417#true} assume !(0 == ~cond); {4417#true} is VALID [2020-07-11 02:31:41,113 INFO L280 TraceCheckUtils]: 45: Hoare triple {4417#true} assume true; {4417#true} is VALID [2020-07-11 02:31:41,114 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4417#true} {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #110#return; {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} is VALID [2020-07-11 02:31:41,114 INFO L280 TraceCheckUtils]: 47: Hoare triple {4432#(<= (+ (* 2 main_~i~0) 1) main_~k~0)} #t~post5 := ~k~0; {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} is VALID [2020-07-11 02:31:41,115 INFO L280 TraceCheckUtils]: 48: Hoare triple {4437#(<= (+ (* 2 main_~i~0) 1) |main_#t~post5|)} ~k~0 := 1 + #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-11 02:31:41,115 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} havoc #t~post5; {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-11 02:31:41,116 INFO L280 TraceCheckUtils]: 50: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} assume !!(~k~0 < ~n~0); {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} is VALID [2020-07-11 02:31:41,117 INFO L263 TraceCheckUtils]: 51: Hoare triple {4438#(<= (+ (* 2 main_~i~0) 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:41,117 INFO L280 TraceCheckUtils]: 52: Hoare triple {4439#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4440#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:41,118 INFO L280 TraceCheckUtils]: 53: Hoare triple {4440#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4418#false} is VALID [2020-07-11 02:31:41,118 INFO L280 TraceCheckUtils]: 54: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2020-07-11 02:31:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 02:31:41,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371013018] [2020-07-11 02:31:41,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:41,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 02:31:41,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233552292] [2020-07-11 02:31:41,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-11 02:31:41,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:41,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:31:41,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:31:41,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:31:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:31:41,180 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2020-07-11 02:31:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:42,346 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-11 02:31:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:31:42,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-07-11 02:31:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:31:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-11 02:31:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:31:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2020-07-11 02:31:42,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2020-07-11 02:31:42,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:42,455 INFO L225 Difference]: With dead ends: 98 [2020-07-11 02:31:42,455 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:31:42,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-07-11 02:31:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:31:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:31:42,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:42,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:42,457 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:42,457 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:42,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:42,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:42,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:42,459 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:42,459 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:42,460 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:42,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:42,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:42,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:42,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:31:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:31:42,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-11 02:31:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:42,461 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:31:42,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:31:42,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:31:42,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:42,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:42,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:31:42,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:31:43,965 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,965 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,965 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,965 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,965 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,966 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:43,966 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:43,966 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:43,966 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:31:43,966 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:31:43,966 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:31:43,966 INFO L264 CegarLoopResult]: At program point L31(lines 23 33) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) [2020-07-11 02:31:43,966 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 37) the Hoare annotation is: true [2020-07-11 02:31:43,966 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-11 02:31:43,967 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0))) [2020-07-11 02:31:43,967 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~j~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post3|) (<= main_~n~0 main_~k~0))) [2020-07-11 02:31:43,967 INFO L264 CegarLoopResult]: At program point L23-5(lines 23 33) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-11 02:31:43,967 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:31:43,967 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 02:31:43,967 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 02:31:43,968 INFO L264 CegarLoopResult]: At program point L24(line 24) 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-11 02:31:43,968 INFO L264 CegarLoopResult]: At program point L24-1(lines 24 32) 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-11 02:31:43,968 INFO L264 CegarLoopResult]: At program point L24-2(line 24) 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-11 02:31:43,968 INFO L264 CegarLoopResult]: At program point L24-3(line 24) 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-11 02:31:43,968 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:31:43,968 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-11 02:31:43,969 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-11 02:31:43,969 INFO L264 CegarLoopResult]: At program point L25(line 25) 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-11 02:31:43,969 INFO L264 CegarLoopResult]: At program point L25-3(line 25) 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) (<= (+ |main_#t~post5| 1) main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-11 02:31:43,969 INFO L264 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= (+ .cse0 1) main_~k~0) (<= (+ main_~j~0 1) main_~n~0) (<= (+ |main_#t~post5| 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 |main_#t~post5|) (<= .cse0 main_~j~0))) [2020-07-11 02:31:43,969 INFO L264 CegarLoopResult]: At program point L25-5(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-11 02:31:43,969 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:31:43,970 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:31:43,970 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 37) the Hoare annotation is: true [2020-07-11 02:31:43,970 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-11 02:31:43,970 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2020-07-11 02:31:43,970 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-11 02:31:43,970 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-11 02:31:43,970 INFO L264 CegarLoopResult]: At program point L26-1(lines 25 27) 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-11 02:31:43,971 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-11 02:31:43,971 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-11 02:31:43,971 INFO L271 CegarLoopResult]: At program point L18(lines 18 21) the Hoare annotation is: true [2020-07-11 02:31:43,971 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-11 02:31:43,971 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 21) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-11 02:31:43,971 INFO L264 CegarLoopResult]: At program point L22-5(lines 22 34) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2020-07-11 02:31:43,971 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:31:43,972 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:31:43,972 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-11 02:31:43,972 INFO L271 CegarLoopResult]: At program point L35(lines 13 37) the Hoare annotation is: true [2020-07-11 02:31:43,972 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:31:43,972 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:43,972 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:43,972 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:43,972 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:31:43,973 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:31:43,977 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:31:43,981 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:43,982 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:31:43,982 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:31:43,982 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:31:44,006 INFO L163 areAnnotationChecker]: CFG has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:31:44,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:31:44 BoogieIcfgContainer [2020-07-11 02:31:44,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:31:44,023 INFO L168 Benchmark]: Toolchain (without parser) took 13197.24 ms. Allocated memory was 138.4 MB in the beginning and 352.3 MB in the end (delta: 213.9 MB). Free memory was 104.2 MB in the beginning and 215.5 MB in the end (delta: -111.3 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,024 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.03 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 93.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,027 INFO L168 Benchmark]: Boogie Preprocessor took 124.43 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 93.4 MB in the beginning and 183.6 MB in the end (delta: -90.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,028 INFO L168 Benchmark]: RCFGBuilder took 493.23 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 157.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,029 INFO L168 Benchmark]: TraceAbstraction took 12315.30 ms. Allocated memory was 203.4 MB in the beginning and 352.3 MB in the end (delta: 148.9 MB). Free memory was 157.2 MB in the beginning and 215.5 MB in the end (delta: -58.4 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:44,037 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.87 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 259.03 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 93.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.43 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 93.4 MB in the beginning and 183.6 MB in the end (delta: -90.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 493.23 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 157.8 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12315.30 ms. Allocated memory was 203.4 MB in the beginning and 352.3 MB in the end (delta: 148.9 MB). Free memory was 157.2 MB in the beginning and 215.5 MB in the end (delta: -58.4 MB). Peak memory consumption was 90.5 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: 22]: Loop Invariant Derived loop invariant: k <= n && n <= k - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (k <= n && n <= k) && 2 * i <= j - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((j + 1 <= n && 2 * i <= k) && k <= n) && 2 * i <= j - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 437 SDtfs, 342 SDslu, 1605 SDs, 0 SdLazy, 854 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 152 PreInvPairs, 237 NumberOfFragments, 417 HoareAnnotationTreeSize, 152 FomulaSimplifications, 48886 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 50 FomulaSimplificationsInter, 2689 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 31835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 54/58 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...