/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:24,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:24,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:24,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:24,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:24,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:24,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:24,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:24,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:24,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:24,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:24,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:24,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:24,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:24,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:24,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:24,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:24,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:24,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:24,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:24,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:24,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:24,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:24,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:24,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:24,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:24,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:24,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:24,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:24,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:24,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:24,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:24,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:24,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:24,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:24,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:24,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:24,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:24,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:24,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:24,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:24,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:24,650 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:24,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:24,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:24,652 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:24,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:24,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:24,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:24,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:24,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:24,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:24,653 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:24,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:24,658 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:24,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:24,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:24,658 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:24,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:24,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:24,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:24,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:24,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:24,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:24,660 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:25,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:25,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:25,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:25,025 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:25,026 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:25,026 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-10 20:24:25,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0eff457/93c78c2cd421486394566724ccef2998/FLAGd5e8188dd [2020-07-10 20:24:25,567 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:25,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-10 20:24:25,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0eff457/93c78c2cd421486394566724ccef2998/FLAGd5e8188dd [2020-07-10 20:24:25,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0eff457/93c78c2cd421486394566724ccef2998 [2020-07-10 20:24:25,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:25,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:25,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:25,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:25,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:25,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:25" (1/1) ... [2020-07-10 20:24:25,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526d7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:25, skipping insertion in model container [2020-07-10 20:24:25,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:25" (1/1) ... [2020-07-10 20:24:25,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:25,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:26,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:26,178 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:26,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:26,213 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:26,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26 WrapperNode [2020-07-10 20:24:26,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:26,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:26,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:26,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:26,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... [2020-07-10 20:24:26,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:26,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:26,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:26,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:26,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:26,700 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:26,701 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:24:26,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:26 BoogieIcfgContainer [2020-07-10 20:24:26,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:26,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:26,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:26,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:26,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:25" (1/3) ... [2020-07-10 20:24:26,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510bd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:26, skipping insertion in model container [2020-07-10 20:24:26,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:26" (2/3) ... [2020-07-10 20:24:26,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510bd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:26, skipping insertion in model container [2020-07-10 20:24:26,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:26" (3/3) ... [2020-07-10 20:24:26,715 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2020-07-10 20:24:26,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:26,734 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:26,748 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:26,773 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:26,773 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:26,773 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:26,774 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:26,774 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:26,774 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:26,774 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:26,774 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-10 20:24:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 20:24:26,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:26,803 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] [2020-07-10 20:24:26,803 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 317967837, now seen corresponding path program 1 times [2020-07-10 20:24:26,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:26,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54671920] [2020-07-10 20:24:26,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:27,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 20:24:27,276 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-10 20:24:27,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-10 20:24:27,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 20:24:27,279 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-10 20:24:27,280 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret2 := main(); {41#true} is VALID [2020-07-10 20:24:27,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} havoc ~i~0; {41#true} is VALID [2020-07-10 20:24:27,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0; {41#true} is VALID [2020-07-10 20:24:27,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc ~a~0; {41#true} is VALID [2020-07-10 20:24:27,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} havoc ~b~0; {41#true} is VALID [2020-07-10 20:24:27,283 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~i~0 := 0; {45#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:27,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(<= main_~i~0 0)} ~a~0 := 0; {46#(and (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:27,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#(and (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:27,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:27,290 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~n~0 := #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:27,292 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:27,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:27,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:27,298 INFO L263 TraceCheckUtils]: 16: Hoare triple {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:27,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {51#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:27,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42#false} is VALID [2020-07-10 20:24:27,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-10 20:24:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:27,305 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:27,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54671920] [2020-07-10 20:24:27,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:27,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:24:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326055815] [2020-07-10 20:24:27,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-10 20:24:27,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:27,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:24:27,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:27,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:24:27,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:27,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:24:27,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:24:27,381 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 9 states. [2020-07-10 20:24:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,121 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-10 20:24:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:28,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-10 20:24:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-10 20:24:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-10 20:24:28,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-10 20:24:28,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:28,274 INFO L225 Difference]: With dead ends: 70 [2020-07-10 20:24:28,274 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 20:24:28,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 20:24:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2020-07-10 20:24:28,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:28,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2020-07-10 20:24:28,350 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2020-07-10 20:24:28,351 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2020-07-10 20:24:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,355 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:24:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:24:28,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,357 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2020-07-10 20:24:28,357 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2020-07-10 20:24:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:28,362 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:24:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:24:28,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:28,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:28,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:28,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:24:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-10 20:24:28,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2020-07-10 20:24:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:28,369 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-10 20:24:28,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:24:28,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2020-07-10 20:24:28,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-10 20:24:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:24:28,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:28,416 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-10 20:24:28,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:28,417 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash -628039010, now seen corresponding path program 1 times [2020-07-10 20:24:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:28,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68710152] [2020-07-10 20:24:28,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:28,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-10 20:24:28,872 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-10 20:24:28,872 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-10 20:24:28,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-10 20:24:28,873 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-10 20:24:28,874 INFO L263 TraceCheckUtils]: 3: Hoare triple {344#true} call #t~ret2 := main(); {344#true} is VALID [2020-07-10 20:24:28,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#true} havoc ~i~0; {344#true} is VALID [2020-07-10 20:24:28,875 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} havoc ~n~0; {344#true} is VALID [2020-07-10 20:24:28,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {344#true} havoc ~a~0; {344#true} is VALID [2020-07-10 20:24:28,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#true} havoc ~b~0; {344#true} is VALID [2020-07-10 20:24:28,877 INFO L280 TraceCheckUtils]: 8: Hoare triple {344#true} ~i~0 := 0; {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:28,878 INFO L280 TraceCheckUtils]: 9: Hoare triple {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:28,879 INFO L280 TraceCheckUtils]: 10: Hoare triple {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:28,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:28,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:28,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:28,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:28,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:28,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:28,887 INFO L280 TraceCheckUtils]: 17: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:28,888 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:28,890 INFO L280 TraceCheckUtils]: 19: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:28,891 INFO L280 TraceCheckUtils]: 20: Hoare triple {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:28,893 INFO L280 TraceCheckUtils]: 21: Hoare triple {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:28,894 INFO L280 TraceCheckUtils]: 22: Hoare triple {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:28,896 INFO L263 TraceCheckUtils]: 23: Hoare triple {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:28,897 INFO L280 TraceCheckUtils]: 24: Hoare triple {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {357#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:28,899 INFO L280 TraceCheckUtils]: 25: Hoare triple {357#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {345#false} is VALID [2020-07-10 20:24:28,899 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-10 20:24:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:28,906 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:28,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68710152] [2020-07-10 20:24:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:28,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:24:28,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979363964] [2020-07-10 20:24:28,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-10 20:24:28,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:28,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:24:28,945 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-10 20:24:28,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:24:28,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:24:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:28,947 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2020-07-10 20:24:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,776 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-10 20:24:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:24:29,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-10 20:24:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-10 20:24:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-10 20:24:29,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-10 20:24:29,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:29,872 INFO L225 Difference]: With dead ends: 53 [2020-07-10 20:24:29,872 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 20:24:29,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-07-10 20:24:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 20:24:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-10 20:24:29,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:29,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-10 20:24:29,963 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-10 20:24:29,963 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-10 20:24:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,970 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-10 20:24:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-10 20:24:29,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,971 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-10 20:24:29,971 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-10 20:24:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:29,981 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-10 20:24:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-10 20:24:29,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:29,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:29,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:29,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 20:24:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2020-07-10 20:24:29,988 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2020-07-10 20:24:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:29,989 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-07-10 20:24:29,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:24:29,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2020-07-10 20:24:30,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-10 20:24:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:24:30,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:30,044 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-10 20:24:30,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:30,045 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1791276066, now seen corresponding path program 1 times [2020-07-10 20:24:30,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:30,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071441436] [2020-07-10 20:24:30,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.002s / 0.003s total Resizing node table from 61 to 113 [2020-07-10 20:24:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:32,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-10 20:24:32,775 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-10 20:24:32,776 INFO L263 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2020-07-10 20:24:32,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-10 20:24:32,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-10 20:24:32,777 INFO L263 TraceCheckUtils]: 3: Hoare triple {654#true} call #t~ret2 := main(); {654#true} is VALID [2020-07-10 20:24:32,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {654#true} havoc ~i~0; {654#true} is VALID [2020-07-10 20:24:32,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {654#true} havoc ~n~0; {654#true} is VALID [2020-07-10 20:24:32,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {654#true} havoc ~a~0; {654#true} is VALID [2020-07-10 20:24:32,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {654#true} havoc ~b~0; {654#true} is VALID [2020-07-10 20:24:32,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {654#true} ~i~0 := 0; {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:32,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:32,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:32,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:32,789 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:32,789 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:32,790 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:32,796 INFO L280 TraceCheckUtils]: 15: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} [75] L17-2-->L17-3_primed: Formula: (let ((.cse13 (* 2 |v_oct_main_#t~nondet1_in_1|))) (let ((.cse2 (<= 0 .cse13)) (.cse8 (+ v_oct_main_~b~0_in_1 2)) (.cse7 (div (+ v_oct_main_~a~0_out_1 (* v_oct_main_~a~0_in_1 (- 1)) (- 4)) 2)) (.cse3 (+ v_oct_main_~i~0_out_1 v_oct_main_~b~0_in_1)) (.cse1 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse9 (div (+ (* v_oct_main_~a~0_out_1 (- 1)) v_oct_main_~a~0_in_1 4) (- 2))) (.cse4 (+ v_oct_main_~i~0_in_1 v_oct_main_~b~0_out_1)) (.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse6 (<= .cse13 0))) (or (let ((.cse5 (+ v_oct_main_~i~0_in_1 .cse9 2))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) (<= .cse5 v_oct_main_~i~0_out_1) .cse6 (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 .cse7 2)) (<= .cse5 v_oct_main_~n~0_in_1) (<= .cse8 v_oct_main_~b~0_out_1) (<= .cse4 .cse3))) (let ((.cse11 (+ v_oct_main_~a~0_in_1 2)) (.cse10 (+ v_oct_main_~i~0_in_1 1)) (.cse12 (+ v_oct_main_~b~0_in_1 1))) (and (<= .cse10 v_oct_main_~n~0_in_1) .cse1 (<= .cse11 v_oct_main_~a~0_out_1) .cse2 (<= v_oct_main_~a~0_out_1 .cse11) (<= .cse12 v_oct_main_~b~0_out_1) (or (not .cse2) (< v_oct_main_~b~0_out_1 .cse8) (< (+ .cse7 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) (< .cse3 .cse4) (not .cse1) (< v_oct_main_~b~0_out_1 (+ v_oct_main_~b~0_in_1 .cse9 2)) (not .cse6) (< (+ v_oct_main_~b~0_in_1 v_oct_main_~n~0_in_1) .cse4) (not .cse0)) .cse0 (<= .cse10 v_oct_main_~i~0_out_1) (<= .cse13 4294967294) (<= 0 (+ .cse13 4294967296)) (<= v_oct_main_~i~0_out_1 .cse10) .cse6 (<= v_oct_main_~b~0_out_1 .cse12)))))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1, main_#t~nondet1=|v_oct_main_#t~nondet1_in_1|, main_~b~0=v_oct_main_~b~0_in_1, main_~a~0=v_oct_main_~a~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_#t~nondet1=|v_oct_main_#t~nondet1_out_1|, main_~b~0=v_oct_main_~b~0_out_1, main_~a~0=v_oct_main_~a~0_out_1} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {661#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:32,797 INFO L280 TraceCheckUtils]: 16: Hoare triple {661#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} [74] L17-3_primed-->L17-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {662#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:32,799 INFO L263 TraceCheckUtils]: 17: Hoare triple {662#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {663#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:32,800 INFO L280 TraceCheckUtils]: 18: Hoare triple {663#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {664#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:32,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {664#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {655#false} is VALID [2020-07-10 20:24:32,802 INFO L280 TraceCheckUtils]: 20: Hoare triple {655#false} assume !false; {655#false} is VALID [2020-07-10 20:24:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:33,060 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:33,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071441436] [2020-07-10 20:24:33,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:33,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:24:33,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504442099] [2020-07-10 20:24:33,061 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-10 20:24:33,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:33,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:24:33,097 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-10 20:24:33,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:24:33,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:33,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:24:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:24:33,100 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2020-07-10 20:24:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:34,011 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-10 20:24:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 20:24:34,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-10 20:24:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-10 20:24:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-10 20:24:34,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 58 transitions. [2020-07-10 20:24:34,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:34,099 INFO L225 Difference]: With dead ends: 56 [2020-07-10 20:24:34,099 INFO L226 Difference]: Without dead ends: 51 [2020-07-10 20:24:34,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-07-10 20:24:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-10 20:24:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-07-10 20:24:34,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:34,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 45 states. [2020-07-10 20:24:34,192 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 45 states. [2020-07-10 20:24:34,192 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 45 states. [2020-07-10 20:24:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:34,195 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-10 20:24:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-10 20:24:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:34,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:34,197 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 51 states. [2020-07-10 20:24:34,197 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 51 states. [2020-07-10 20:24:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:34,200 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-10 20:24:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-10 20:24:34,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:34,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:34,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:34,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 20:24:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-10 20:24:34,204 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 27 [2020-07-10 20:24:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:34,204 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-10 20:24:34,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:24:34,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-10 20:24:34,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-10 20:24:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 20:24:34,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:34,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:34,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:34,282 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1600642371, now seen corresponding path program 2 times [2020-07-10 20:24:34,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:34,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1716148553] [2020-07-10 20:24:34,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:34,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-10 20:24:34,704 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {997#true} {997#true} #69#return; {997#true} is VALID [2020-07-10 20:24:34,704 INFO L263 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {997#true} is VALID [2020-07-10 20:24:34,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-10 20:24:34,704 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {997#true} {997#true} #69#return; {997#true} is VALID [2020-07-10 20:24:34,705 INFO L263 TraceCheckUtils]: 3: Hoare triple {997#true} call #t~ret2 := main(); {997#true} is VALID [2020-07-10 20:24:34,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} havoc ~i~0; {997#true} is VALID [2020-07-10 20:24:34,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#true} havoc ~n~0; {997#true} is VALID [2020-07-10 20:24:34,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {997#true} havoc ~a~0; {997#true} is VALID [2020-07-10 20:24:34,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {997#true} havoc ~b~0; {997#true} is VALID [2020-07-10 20:24:34,707 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#true} ~i~0 := 0; {1001#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:34,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {1001#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1002#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:34,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {1002#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,711 INFO L280 TraceCheckUtils]: 14: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {1004#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:34,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {1005#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-10 20:24:34,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {1005#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:34,717 INFO L280 TraceCheckUtils]: 22: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:34,718 INFO L280 TraceCheckUtils]: 23: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:34,719 INFO L280 TraceCheckUtils]: 24: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:34,720 INFO L280 TraceCheckUtils]: 25: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:34,721 INFO L280 TraceCheckUtils]: 26: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {1007#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:34,721 INFO L280 TraceCheckUtils]: 27: Hoare triple {1007#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {1008#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:34,723 INFO L280 TraceCheckUtils]: 28: Hoare triple {1008#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1009#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:34,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {1009#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1010#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:34,728 INFO L263 TraceCheckUtils]: 30: Hoare triple {1010#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1011#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:34,734 INFO L280 TraceCheckUtils]: 31: Hoare triple {1011#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1012#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:34,734 INFO L280 TraceCheckUtils]: 32: Hoare triple {1012#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {998#false} is VALID [2020-07-10 20:24:34,735 INFO L280 TraceCheckUtils]: 33: Hoare triple {998#false} assume !false; {998#false} is VALID [2020-07-10 20:24:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:34,739 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:34,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1716148553] [2020-07-10 20:24:34,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:34,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:24:34,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214679569] [2020-07-10 20:24:34,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:34,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:34,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:24:34,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:34,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:24:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:24:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:24:34,790 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-07-10 20:24:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:35,828 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-07-10 20:24:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 20:24:35,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-10 20:24:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-10 20:24:35,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2020-07-10 20:24:35,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:35,924 INFO L225 Difference]: With dead ends: 64 [2020-07-10 20:24:35,925 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 20:24:35,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2020-07-10 20:24:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 20:24:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-10 20:24:36,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:36,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-10 20:24:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-10 20:24:36,016 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-10 20:24:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:36,019 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-10 20:24:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-10 20:24:36,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:36,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:36,021 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-10 20:24:36,021 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-10 20:24:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:36,024 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-10 20:24:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-10 20:24:36,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:36,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:36,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:36,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 20:24:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-10 20:24:36,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-07-10 20:24:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:36,028 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-10 20:24:36,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:24:36,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-10 20:24:36,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 20:24:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 20:24:36,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:36,108 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] [2020-07-10 20:24:36,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:24:36,108 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1531087869, now seen corresponding path program 1 times [2020-07-10 20:24:36,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:36,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975612604] [2020-07-10 20:24:36,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:36,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-10 20:24:36,491 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1381#true} {1381#true} #69#return; {1381#true} is VALID [2020-07-10 20:24:36,492 INFO L263 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2020-07-10 20:24:36,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-10 20:24:36,492 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} #69#return; {1381#true} is VALID [2020-07-10 20:24:36,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {1381#true} call #t~ret2 := main(); {1381#true} is VALID [2020-07-10 20:24:36,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {1381#true} havoc ~i~0; {1381#true} is VALID [2020-07-10 20:24:36,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {1381#true} havoc ~n~0; {1381#true} is VALID [2020-07-10 20:24:36,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {1381#true} havoc ~a~0; {1381#true} is VALID [2020-07-10 20:24:36,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {1381#true} havoc ~b~0; {1381#true} is VALID [2020-07-10 20:24:36,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {1381#true} ~i~0 := 0; {1385#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:36,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {1385#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1386#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:36,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {1388#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:36,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {1388#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {1389#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-10 20:24:36,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {1389#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:36,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:36,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:36,516 INFO L280 TraceCheckUtils]: 24: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(0 != #t~nondet1); {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:36,517 INFO L280 TraceCheckUtils]: 25: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:36,518 INFO L280 TraceCheckUtils]: 26: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 2 + ~a~0; {1391#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:36,519 INFO L280 TraceCheckUtils]: 27: Hoare triple {1391#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} ~b~0 := 1 + ~b~0; {1392#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:36,520 INFO L280 TraceCheckUtils]: 28: Hoare triple {1392#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1393#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:36,520 INFO L280 TraceCheckUtils]: 29: Hoare triple {1393#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1394#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:36,521 INFO L263 TraceCheckUtils]: 30: Hoare triple {1394#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1395#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:36,522 INFO L280 TraceCheckUtils]: 31: Hoare triple {1395#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1396#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:36,522 INFO L280 TraceCheckUtils]: 32: Hoare triple {1396#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1382#false} is VALID [2020-07-10 20:24:36,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2020-07-10 20:24:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:36,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:36,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1975612604] [2020-07-10 20:24:36,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:36,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:24:36,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741421110] [2020-07-10 20:24:36,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:36,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:36,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:24:36,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:36,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:24:36,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:24:36,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:24:36,581 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2020-07-10 20:24:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,701 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-10 20:24:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 20:24:37,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-10 20:24:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-10 20:24:37,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-10 20:24:37,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:37,810 INFO L225 Difference]: With dead ends: 76 [2020-07-10 20:24:37,810 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 20:24:37,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2020-07-10 20:24:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 20:24:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2020-07-10 20:24:37,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:37,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 52 states. [2020-07-10 20:24:37,907 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 52 states. [2020-07-10 20:24:37,907 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 52 states. [2020-07-10 20:24:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,911 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-10 20:24:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-10 20:24:37,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 71 states. [2020-07-10 20:24:37,912 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 71 states. [2020-07-10 20:24:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,916 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-10 20:24:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-10 20:24:37,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:37,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:24:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-10 20:24:37,919 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2020-07-10 20:24:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:37,920 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-10 20:24:37,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:24:37,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2020-07-10 20:24:38,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 20:24:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 20:24:38,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:38,011 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] [2020-07-10 20:24:38,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:24:38,011 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:38,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash -966733443, now seen corresponding path program 2 times [2020-07-10 20:24:38,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:38,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1906772622] [2020-07-10 20:24:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:38,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {1823#true} assume true; {1823#true} is VALID [2020-07-10 20:24:38,424 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1823#true} {1823#true} #69#return; {1823#true} is VALID [2020-07-10 20:24:38,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2020-07-10 20:24:38,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {1823#true} assume true; {1823#true} is VALID [2020-07-10 20:24:38,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1823#true} {1823#true} #69#return; {1823#true} is VALID [2020-07-10 20:24:38,425 INFO L263 TraceCheckUtils]: 3: Hoare triple {1823#true} call #t~ret2 := main(); {1823#true} is VALID [2020-07-10 20:24:38,425 INFO L280 TraceCheckUtils]: 4: Hoare triple {1823#true} havoc ~i~0; {1823#true} is VALID [2020-07-10 20:24:38,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {1823#true} havoc ~n~0; {1823#true} is VALID [2020-07-10 20:24:38,426 INFO L280 TraceCheckUtils]: 6: Hoare triple {1823#true} havoc ~a~0; {1823#true} is VALID [2020-07-10 20:24:38,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {1823#true} havoc ~b~0; {1823#true} is VALID [2020-07-10 20:24:38,428 INFO L280 TraceCheckUtils]: 8: Hoare triple {1823#true} ~i~0 := 0; {1827#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:38,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {1827#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1828#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:38,433 INFO L280 TraceCheckUtils]: 10: Hoare triple {1828#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,434 INFO L280 TraceCheckUtils]: 11: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,435 INFO L280 TraceCheckUtils]: 12: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,435 INFO L280 TraceCheckUtils]: 13: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,436 INFO L280 TraceCheckUtils]: 14: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,437 INFO L280 TraceCheckUtils]: 15: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,437 INFO L280 TraceCheckUtils]: 16: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {1830#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-10 20:24:38,441 INFO L280 TraceCheckUtils]: 20: Hoare triple {1830#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {1831#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-10 20:24:38,442 INFO L280 TraceCheckUtils]: 21: Hoare triple {1831#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:38,442 INFO L280 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:38,443 INFO L280 TraceCheckUtils]: 23: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:38,443 INFO L280 TraceCheckUtils]: 24: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:38,444 INFO L280 TraceCheckUtils]: 25: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:38,445 INFO L280 TraceCheckUtils]: 26: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {1833#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:38,446 INFO L280 TraceCheckUtils]: 27: Hoare triple {1833#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {1834#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:38,446 INFO L280 TraceCheckUtils]: 28: Hoare triple {1834#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1835#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:38,447 INFO L280 TraceCheckUtils]: 29: Hoare triple {1835#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1836#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:38,449 INFO L263 TraceCheckUtils]: 30: Hoare triple {1836#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1837#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:38,449 INFO L280 TraceCheckUtils]: 31: Hoare triple {1837#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1838#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:38,450 INFO L280 TraceCheckUtils]: 32: Hoare triple {1838#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1824#false} is VALID [2020-07-10 20:24:38,450 INFO L280 TraceCheckUtils]: 33: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2020-07-10 20:24:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:38,453 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:38,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1906772622] [2020-07-10 20:24:38,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:38,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:24:38,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034246260] [2020-07-10 20:24:38,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:38,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:38,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:24:38,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:38,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:24:38,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:24:38,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:24:38,500 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 14 states. [2020-07-10 20:24:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,692 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-07-10 20:24:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 20:24:39,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-10 20:24:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-10 20:24:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:24:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-10 20:24:39,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-10 20:24:39,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:39,796 INFO L225 Difference]: With dead ends: 83 [2020-07-10 20:24:39,797 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 20:24:39,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2020-07-10 20:24:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 20:24:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2020-07-10 20:24:39,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:39,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 55 states. [2020-07-10 20:24:39,925 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 55 states. [2020-07-10 20:24:39,925 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 55 states. [2020-07-10 20:24:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,928 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-10 20:24:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-10 20:24:39,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:39,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:39,929 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 78 states. [2020-07-10 20:24:39,929 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 78 states. [2020-07-10 20:24:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:39,934 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-10 20:24:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-10 20:24:39,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:39,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:39,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:39,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 20:24:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-10 20:24:39,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 34 [2020-07-10 20:24:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:39,942 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-10 20:24:39,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:24:39,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2020-07-10 20:24:40,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 20:24:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:24:40,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:40,051 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-07-10 20:24:40,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:24:40,052 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1509294206, now seen corresponding path program 3 times [2020-07-10 20:24:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:40,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463474968] [2020-07-10 20:24:40,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-10 20:24:40,488 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2299#true} {2299#true} #69#return; {2299#true} is VALID [2020-07-10 20:24:40,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2020-07-10 20:24:40,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-10 20:24:40,488 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2299#true} {2299#true} #69#return; {2299#true} is VALID [2020-07-10 20:24:40,489 INFO L263 TraceCheckUtils]: 3: Hoare triple {2299#true} call #t~ret2 := main(); {2299#true} is VALID [2020-07-10 20:24:40,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#true} havoc ~i~0; {2299#true} is VALID [2020-07-10 20:24:40,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {2299#true} havoc ~n~0; {2299#true} is VALID [2020-07-10 20:24:40,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {2299#true} havoc ~a~0; {2299#true} is VALID [2020-07-10 20:24:40,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {2299#true} havoc ~b~0; {2299#true} is VALID [2020-07-10 20:24:40,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {2299#true} ~i~0 := 0; {2303#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:24:40,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {2303#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {2304#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-10 20:24:40,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {2304#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,492 INFO L280 TraceCheckUtils]: 11: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,493 INFO L280 TraceCheckUtils]: 12: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,494 INFO L280 TraceCheckUtils]: 14: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,501 INFO L280 TraceCheckUtils]: 18: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,503 INFO L280 TraceCheckUtils]: 19: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {2306#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:40,503 INFO L280 TraceCheckUtils]: 20: Hoare triple {2306#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-10 20:24:40,504 INFO L280 TraceCheckUtils]: 21: Hoare triple {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,505 INFO L280 TraceCheckUtils]: 22: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,506 INFO L280 TraceCheckUtils]: 24: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,506 INFO L280 TraceCheckUtils]: 25: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,507 INFO L280 TraceCheckUtils]: 26: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {2308#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-10 20:24:40,509 INFO L280 TraceCheckUtils]: 27: Hoare triple {2308#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-10 20:24:40,511 INFO L280 TraceCheckUtils]: 28: Hoare triple {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-10 20:24:40,511 INFO L280 TraceCheckUtils]: 29: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:40,512 INFO L280 TraceCheckUtils]: 30: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:40,512 INFO L280 TraceCheckUtils]: 31: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:40,513 INFO L280 TraceCheckUtils]: 32: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:40,514 INFO L280 TraceCheckUtils]: 33: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {2310#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:40,515 INFO L280 TraceCheckUtils]: 34: Hoare triple {2310#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {2311#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:40,516 INFO L280 TraceCheckUtils]: 35: Hoare triple {2311#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {2312#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:40,517 INFO L280 TraceCheckUtils]: 36: Hoare triple {2312#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {2313#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-10 20:24:40,519 INFO L263 TraceCheckUtils]: 37: Hoare triple {2313#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {2314#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:40,520 INFO L280 TraceCheckUtils]: 38: Hoare triple {2314#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2315#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:40,520 INFO L280 TraceCheckUtils]: 39: Hoare triple {2315#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2300#false} is VALID [2020-07-10 20:24:40,520 INFO L280 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2020-07-10 20:24:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:40,524 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:40,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463474968] [2020-07-10 20:24:40,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:40,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:24:40,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223635009] [2020-07-10 20:24:40,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-10 20:24:40,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:40,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:24:40,574 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-10 20:24:40,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:24:40,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:24:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:24:40,576 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 15 states. [2020-07-10 20:24:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,686 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-07-10 20:24:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 20:24:41,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-10 20:24:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:24:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-10 20:24:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:24:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-10 20:24:41,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 42 transitions. [2020-07-10 20:24:41,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:41,762 INFO L225 Difference]: With dead ends: 63 [2020-07-10 20:24:41,762 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:41,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2020-07-10 20:24:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:41,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:41,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:41,765 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:41,765 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,765 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:41,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:41,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:41,765 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:41,766 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,766 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:41,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:41,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:41,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:41,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:41,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-10 20:24:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:41,767 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:41,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:24:41,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:41,767 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-10 20:24:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:41,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:41,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:24:41,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:42,298 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,298 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,299 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:42,299 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:42,299 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:42,300 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:24:42,300 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:24:42,300 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:42,300 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-10 20:24:42,300 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 29) the Hoare annotation is: true [2020-07-10 20:24:42,300 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (+ (* 3 main_~i~0) 2)) (.cse1 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 3 main_~n~0)))) [2020-07-10 20:24:42,301 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,301 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:24:42,301 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 26) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0)) (.cse1 (* 3 main_~i~0))) (and (<= .cse0 (* 3 main_~n~0)) (<= .cse1 .cse0) (<= .cse0 .cse1))) [2020-07-10 20:24:42,301 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0)) [2020-07-10 20:24:42,301 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 26) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~n~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,301 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0)) [2020-07-10 20:24:42,301 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 29) the Hoare annotation is: true [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-10 20:24:42,302 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 29) the Hoare annotation is: true [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse1 (+ (* 3 main_~i~0) 1)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 24) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,302 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-10 20:24:42,303 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,303 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0)) (.cse1 (* 3 main_~i~0))) (and (<= .cse0 0) (<= main_~a~0 0) (<= .cse1 .cse0) (<= .cse1 main_~a~0))) [2020-07-10 20:24:42,303 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:24:42,303 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:24:42,303 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-10 20:24:42,303 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 24) the Hoare annotation is: (let ((.cse0 (+ (* 3 main_~i~0) 3)) (.cse1 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 3 main_~n~0)))) [2020-07-10 20:24:42,303 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-10 20:24:42,304 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:42,304 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-10 20:24:42,304 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:42,304 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-10 20:24:42,304 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-10 20:24:42,304 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:42,309 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:42,312 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:42,312 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:42,313 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:24:42,313 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:24:42,329 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:24:42,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:42 BoogieIcfgContainer [2020-07-10 20:24:42,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:42,345 INFO L168 Benchmark]: Toolchain (without parser) took 16393.81 ms. Allocated memory was 141.0 MB in the beginning and 331.4 MB in the end (delta: 190.3 MB). Free memory was 105.7 MB in the beginning and 111.7 MB in the end (delta: -6.0 MB). Peak memory consumption was 184.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,346 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.35 ms. Allocated memory is still 141.0 MB. Free memory was 105.5 MB in the beginning and 95.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,348 INFO L168 Benchmark]: Boogie Preprocessor took 116.47 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 95.4 MB in the beginning and 182.6 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,349 INFO L168 Benchmark]: RCFGBuilder took 375.15 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 162.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,349 INFO L168 Benchmark]: TraceAbstraction took 15635.04 ms. Allocated memory was 202.4 MB in the beginning and 331.4 MB in the end (delta: 129.0 MB). Free memory was 161.5 MB in the beginning and 111.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:42,353 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.35 ms. Allocated memory is still 141.0 MB. Free memory was 105.5 MB in the beginning and 95.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.47 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 95.4 MB in the beginning and 182.6 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.15 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 162.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15635.04 ms. Allocated memory was 202.4 MB in the beginning and 331.4 MB in the end (delta: 129.0 MB). Free memory was 161.5 MB in the beginning and 111.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 178.8 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: 17]: Loop Invariant Derived loop invariant: (a + b <= 3 * n && 3 * i <= a + b) && a + b <= 3 * i - 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, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.9s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 337 SDslu, 1049 SDs, 0 SdLazy, 902 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 79 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 80 PreInvPairs, 138 NumberOfFragments, 443 HoareAnnotationTreeSize, 80 FomulaSimplifications, 12758 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 38 FomulaSimplificationsInter, 117 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...