/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-46f3038-m [2020-07-08 17:39:27,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:39:27,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:39:27,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:39:27,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:39:27,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:39:27,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:39:28,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:39:28,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:39:28,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:39:28,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:39:28,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:39:28,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:39:28,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:39:28,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:39:28,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:39:28,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:39:28,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:39:28,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:39:28,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:39:28,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:39:28,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:39:28,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:39:28,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:39:28,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:39:28,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:39:28,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:39:28,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:39:28,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:39:28,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:39:28,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:39:28,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:39:28,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:39:28,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:39:28,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:39:28,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:39:28,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:39:28,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:39:28,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:39:28,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:39:28,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:39:28,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:39:28,038 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:39:28,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:39:28,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:39:28,040 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:39:28,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:39:28,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:39:28,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:39:28,042 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:39:28,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:39:28,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:39:28,042 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:39:28,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:39:28,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:39:28,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:39:28,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:39:28,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:39:28,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:39:28,044 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:39:28,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:39:28,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:39:28,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:39:28,365 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:39:28,366 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:39:28,367 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-08 17:39:28,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b58be/60d4d8a0e8af48c6a1b204381117dfb0/FLAGd36a7bf83 [2020-07-08 17:39:28,918 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:39:28,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-08 17:39:28,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b58be/60d4d8a0e8af48c6a1b204381117dfb0/FLAGd36a7bf83 [2020-07-08 17:39:29,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9602b58be/60d4d8a0e8af48c6a1b204381117dfb0 [2020-07-08 17:39:29,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:39:29,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:39:29,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:29,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:39:29,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:39:29,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc06059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29, skipping insertion in model container [2020-07-08 17:39:29,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:39:29,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:39:29,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:29,545 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:39:29,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:29,579 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:39:29,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29 WrapperNode [2020-07-08 17:39:29,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:29,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:39:29,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:39:29,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:39:29,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (1/1) ... [2020-07-08 17:39:29,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:39:29,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:39:29,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:39:29,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:39:29,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (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-08 17:39:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:39:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:39:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:39:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:39:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:39:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:39:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:39:30,066 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:39:30,067 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 17:39:30,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:30 BoogieIcfgContainer [2020-07-08 17:39:30,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:39:30,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:39:30,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:39:30,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:39:30,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:39:29" (1/3) ... [2020-07-08 17:39:30,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572e860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:30, skipping insertion in model container [2020-07-08 17:39:30,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:29" (2/3) ... [2020-07-08 17:39:30,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572e860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:30, skipping insertion in model container [2020-07-08 17:39:30,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:30" (3/3) ... [2020-07-08 17:39:30,079 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2020-07-08 17:39:30,104 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:39:30,120 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:39:30,143 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:39:30,164 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:39:30,164 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:39:30,165 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:39:30,165 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:39:30,165 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:39:30,165 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:39:30,165 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:39:30,165 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:39:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-08 17:39:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 17:39:30,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:30,189 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-08 17:39:30,189 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash 317967837, now seen corresponding path program 1 times [2020-07-08 17:39:30,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:30,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852670230] [2020-07-08 17:39:30,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:30,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 17:39:30,798 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-08 17:39:30,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-08 17:39:30,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 17:39:30,801 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-08 17:39:30,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret2 := main(); {41#true} is VALID [2020-07-08 17:39:30,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} havoc ~i~0; {41#true} is VALID [2020-07-08 17:39:30,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0; {41#true} is VALID [2020-07-08 17:39:30,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc ~a~0; {41#true} is VALID [2020-07-08 17:39:30,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} havoc ~b~0; {41#true} is VALID [2020-07-08 17:39:30,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~i~0 := 0; {45#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:30,805 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-08 17:39:30,806 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-08 17:39:30,808 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-08 17:39:30,809 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; {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} is VALID [2020-07-08 17:39:30,810 INFO L280 TraceCheckUtils]: 13: 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))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} havoc #t~nondet0; {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} is VALID [2020-07-08 17:39:30,812 INFO L280 TraceCheckUtils]: 14: 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))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {49#(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-08 17:39:30,813 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#(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); {50#(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-08 17:39:30,816 INFO L263 TraceCheckUtils]: 16: Hoare triple {50#(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)); {51#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:30,817 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {52#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:30,818 INFO L280 TraceCheckUtils]: 18: Hoare triple {52#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42#false} is VALID [2020-07-08 17:39:30,819 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-08 17:39:30,823 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-08 17:39:30,823 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:30,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852670230] [2020-07-08 17:39:30,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:30,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 17:39:30,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139626696] [2020-07-08 17:39:30,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-08 17:39:30,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:30,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 17:39:30,880 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-08 17:39:30,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 17:39:30,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 17:39:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:39:30,893 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 10 states. [2020-07-08 17:39:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:31,613 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-08 17:39:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:39:31,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-08 17:39:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-08 17:39:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-08 17:39:31,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-08 17:39:31,753 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-08 17:39:31,767 INFO L225 Difference]: With dead ends: 70 [2020-07-08 17:39:31,767 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 17:39:31,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:39:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 17:39:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2020-07-08 17:39:31,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:31,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2020-07-08 17:39:31,844 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2020-07-08 17:39:31,844 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2020-07-08 17:39:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:31,849 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 17:39:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 17:39:31,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:31,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:31,851 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2020-07-08 17:39:31,851 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2020-07-08 17:39:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:31,856 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 17:39:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 17:39:31,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:31,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:31,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:31,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 17:39:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-08 17:39:31,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2020-07-08 17:39:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:31,862 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-08 17:39:31,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 17:39:31,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2020-07-08 17:39:31,905 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-08 17:39:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-08 17:39:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 17:39:31,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:31,908 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-08 17:39:31,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:39:31,908 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -628039010, now seen corresponding path program 1 times [2020-07-08 17:39:31,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:31,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946231875] [2020-07-08 17:39:31,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:32,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-08 17:39:32,304 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {345#true} {345#true} #69#return; {345#true} is VALID [2020-07-08 17:39:32,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-08 17:39:32,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-08 17:39:32,305 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #69#return; {345#true} is VALID [2020-07-08 17:39:32,305 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret2 := main(); {345#true} is VALID [2020-07-08 17:39:32,305 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} havoc ~i~0; {345#true} is VALID [2020-07-08 17:39:32,306 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} havoc ~n~0; {345#true} is VALID [2020-07-08 17:39:32,306 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#true} havoc ~a~0; {345#true} is VALID [2020-07-08 17:39:32,307 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} havoc ~b~0; {345#true} is VALID [2020-07-08 17:39:32,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {345#true} ~i~0 := 0; {349#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:32,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {349#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {350#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:32,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {350#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {351#(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-08 17:39:32,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {351#(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; {351#(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-08 17:39:32,314 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#(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; {351#(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-08 17:39:32,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {351#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {351#(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-08 17:39:32,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {351#(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); {351#(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-08 17:39:32,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {351#(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); {352#(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-08 17:39:32,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {352#(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; {352#(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-08 17:39:32,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {352#(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; {352#(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-08 17:39:32,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {352#(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; {352#(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-08 17:39:32,323 INFO L280 TraceCheckUtils]: 19: Hoare triple {352#(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; {353#(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-08 17:39:32,324 INFO L280 TraceCheckUtils]: 20: Hoare triple {353#(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; {354#(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-08 17:39:32,326 INFO L280 TraceCheckUtils]: 21: Hoare triple {354#(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; {355#(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-08 17:39:32,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {355#(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); {356#(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-08 17:39:32,330 INFO L263 TraceCheckUtils]: 23: Hoare triple {356#(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)); {357#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:32,332 INFO L280 TraceCheckUtils]: 24: Hoare triple {357#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {358#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:32,333 INFO L280 TraceCheckUtils]: 25: Hoare triple {358#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {346#false} is VALID [2020-07-08 17:39:32,333 INFO L280 TraceCheckUtils]: 26: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-08 17:39:32,339 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-08 17:39:32,340 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:32,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946231875] [2020-07-08 17:39:32,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:32,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 17:39:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518675654] [2020-07-08 17:39:32,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-08 17:39:32,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:32,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 17:39:32,381 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-08 17:39:32,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 17:39:32,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 17:39:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:39:32,382 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2020-07-08 17:39:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:33,188 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-08 17:39:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 17:39:33,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-08 17:39:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:39:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-08 17:39:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:39:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-08 17:39:33,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-08 17:39:33,267 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-08 17:39:33,269 INFO L225 Difference]: With dead ends: 53 [2020-07-08 17:39:33,270 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 17:39:33,271 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-08 17:39:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 17:39:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-08 17:39:33,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:33,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-08 17:39:33,326 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-08 17:39:33,326 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-08 17:39:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:33,330 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-08 17:39:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-08 17:39:33,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:33,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:33,331 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-08 17:39:33,332 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-08 17:39:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:33,335 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-08 17:39:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-08 17:39:33,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:33,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:33,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:33,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 17:39:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2020-07-08 17:39:33,339 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2020-07-08 17:39:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:33,340 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-07-08 17:39:33,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 17:39:33,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2020-07-08 17:39:33,387 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-08 17:39:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-08 17:39:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 17:39:33,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:33,389 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-08 17:39:33,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:39:33,390 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1791276066, now seen corresponding path program 1 times [2020-07-08 17:39:33,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:33,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796838165] [2020-07-08 17:39:33,391 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.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 [2020-07-08 17:39:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:36,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-08 17:39:36,019 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {655#true} {655#true} #69#return; {655#true} is VALID [2020-07-08 17:39:36,020 INFO L263 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2020-07-08 17:39:36,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2020-07-08 17:39:36,020 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #69#return; {655#true} is VALID [2020-07-08 17:39:36,020 INFO L263 TraceCheckUtils]: 3: Hoare triple {655#true} call #t~ret2 := main(); {655#true} is VALID [2020-07-08 17:39:36,021 INFO L280 TraceCheckUtils]: 4: Hoare triple {655#true} havoc ~i~0; {655#true} is VALID [2020-07-08 17:39:36,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {655#true} havoc ~n~0; {655#true} is VALID [2020-07-08 17:39:36,021 INFO L280 TraceCheckUtils]: 6: Hoare triple {655#true} havoc ~a~0; {655#true} is VALID [2020-07-08 17:39:36,021 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#true} havoc ~b~0; {655#true} is VALID [2020-07-08 17:39:36,023 INFO L280 TraceCheckUtils]: 8: Hoare triple {655#true} ~i~0 := 0; {659#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:36,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {659#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {660#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:36,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {661#(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-08 17:39:36,027 INFO L280 TraceCheckUtils]: 11: Hoare triple {661#(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; {661#(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-08 17:39:36,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {661#(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; {661#(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-08 17:39:36,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {661#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {661#(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-08 17:39:36,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {661#(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); {661#(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-08 17:39:36,034 INFO L280 TraceCheckUtils]: 15: Hoare triple {661#(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 ((.cse3 (* 2 |v_oct_main_#t~nondet1_in_1|))) (let ((.cse12 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse1 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse4 (<= 0 .cse3)) (.cse11 (<= .cse3 0)) (.cse7 (div (+ v_oct_main_~a~0_out_1 (* v_oct_main_~a~0_in_1 (- 1)) (- 4)) 2)) (.cse6 (+ v_oct_main_~b~0_in_1 2)) (.cse9 (+ v_oct_main_~i~0_in_1 v_oct_main_~b~0_out_1)) (.cse8 (+ v_oct_main_~i~0_out_1 v_oct_main_~b~0_in_1)) (.cse10 (div (+ (* v_oct_main_~a~0_out_1 (- 1)) v_oct_main_~a~0_in_1 4) (- 2)))) (or (let ((.cse2 (+ v_oct_main_~a~0_in_1 2)) (.cse0 (+ v_oct_main_~i~0_in_1 1)) (.cse5 (+ v_oct_main_~b~0_in_1 1))) (and (<= .cse0 v_oct_main_~n~0_in_1) .cse1 (<= .cse2 v_oct_main_~a~0_out_1) (<= 0 (+ .cse3 4294967296)) .cse4 (<= .cse3 4294967294) (<= v_oct_main_~a~0_out_1 .cse2) (<= .cse5 v_oct_main_~b~0_out_1) (or (not .cse4) (< v_oct_main_~b~0_out_1 .cse6) (< (+ .cse7 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) (< .cse8 .cse9) (not .cse1) (< v_oct_main_~b~0_out_1 (+ v_oct_main_~b~0_in_1 .cse10 2)) (not .cse11) (< (+ v_oct_main_~b~0_in_1 v_oct_main_~n~0_in_1) .cse9) (not .cse12)) .cse12 (<= .cse0 v_oct_main_~i~0_out_1) (<= v_oct_main_~i~0_out_1 .cse0) .cse11 (<= v_oct_main_~b~0_out_1 .cse5))) (let ((.cse13 (+ v_oct_main_~i~0_in_1 .cse10 2))) (and .cse12 .cse1 (<= .cse8 .cse9) .cse4 (<= .cse13 v_oct_main_~i~0_out_1) .cse11 (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 .cse7 2)) (<= .cse13 v_oct_main_~n~0_in_1) (<= .cse6 v_oct_main_~b~0_out_1) (<= .cse9 .cse8)))))) 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] {662#(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-08 17:39:36,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {662#(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[] {663#(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-08 17:39:36,037 INFO L263 TraceCheckUtils]: 17: Hoare triple {663#(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)); {664#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:36,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {664#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {665#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:36,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {665#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {656#false} is VALID [2020-07-08 17:39:36,039 INFO L280 TraceCheckUtils]: 20: Hoare triple {656#false} assume !false; {656#false} is VALID [2020-07-08 17:39:36,040 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-08 17:39:36,294 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:36,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796838165] [2020-07-08 17:39:36,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:36,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 17:39:36,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147001140] [2020-07-08 17:39:36,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-08 17:39:36,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:36,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 17:39:36,336 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-08 17:39:36,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 17:39:36,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:36,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 17:39:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-08 17:39:36,337 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2020-07-08 17:39:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:37,250 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-08 17:39:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-08 17:39:37,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-08 17:39:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-08 17:39:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-08 17:39:37,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 58 transitions. [2020-07-08 17:39:37,340 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-08 17:39:37,343 INFO L225 Difference]: With dead ends: 56 [2020-07-08 17:39:37,343 INFO L226 Difference]: Without dead ends: 51 [2020-07-08 17:39:37,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-07-08 17:39:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-08 17:39:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-07-08 17:39:37,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:37,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 45 states. [2020-07-08 17:39:37,418 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 45 states. [2020-07-08 17:39:37,419 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 45 states. [2020-07-08 17:39:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:37,422 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-08 17:39:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 17:39:37,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:37,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:37,423 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 51 states. [2020-07-08 17:39:37,423 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 51 states. [2020-07-08 17:39:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:37,426 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-08 17:39:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 17:39:37,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:37,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:37,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:37,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 17:39:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-08 17:39:37,430 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 27 [2020-07-08 17:39:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:37,430 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-08 17:39:37,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 17:39:37,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-08 17:39:37,497 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-08 17:39:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-08 17:39:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 17:39:37,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:37,499 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-08 17:39:37,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:39:37,500 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1600642371, now seen corresponding path program 2 times [2020-07-08 17:39:37,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:37,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215950237] [2020-07-08 17:39:37,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:37,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {998#true} assume true; {998#true} is VALID [2020-07-08 17:39:37,953 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {998#true} {998#true} #69#return; {998#true} is VALID [2020-07-08 17:39:37,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {998#true} call ULTIMATE.init(); {998#true} is VALID [2020-07-08 17:39:37,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {998#true} assume true; {998#true} is VALID [2020-07-08 17:39:37,954 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {998#true} {998#true} #69#return; {998#true} is VALID [2020-07-08 17:39:37,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {998#true} call #t~ret2 := main(); {998#true} is VALID [2020-07-08 17:39:37,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {998#true} havoc ~i~0; {998#true} is VALID [2020-07-08 17:39:37,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {998#true} havoc ~n~0; {998#true} is VALID [2020-07-08 17:39:37,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {998#true} havoc ~a~0; {998#true} is VALID [2020-07-08 17:39:37,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {998#true} havoc ~b~0; {998#true} is VALID [2020-07-08 17:39:37,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {998#true} ~i~0 := 0; {1002#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:37,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {1002#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1003#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:37,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {1003#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1004#(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-08 17:39:37,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {1004#(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; {1004#(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-08 17:39:37,963 INFO L280 TraceCheckUtils]: 12: Hoare triple {1004#(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; {1004#(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-08 17:39:37,964 INFO L280 TraceCheckUtils]: 13: Hoare triple {1004#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1004#(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-08 17:39:37,965 INFO L280 TraceCheckUtils]: 14: Hoare triple {1004#(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); {1004#(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-08 17:39:37,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {1004#(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); {1004#(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-08 17:39:37,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {1004#(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; {1004#(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-08 17:39:37,966 INFO L280 TraceCheckUtils]: 17: Hoare triple {1004#(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; {1004#(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-08 17:39:37,967 INFO L280 TraceCheckUtils]: 18: Hoare triple {1004#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1004#(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-08 17:39:37,968 INFO L280 TraceCheckUtils]: 19: Hoare triple {1004#(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; {1005#(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-08 17:39:37,968 INFO L280 TraceCheckUtils]: 20: Hoare triple {1005#(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; {1006#(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-08 17:39:37,969 INFO L280 TraceCheckUtils]: 21: Hoare triple {1006#(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; {1004#(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-08 17:39:37,970 INFO L280 TraceCheckUtils]: 22: Hoare triple {1004#(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); {1007#(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-08 17:39:37,971 INFO L280 TraceCheckUtils]: 23: Hoare triple {1007#(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; {1007#(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-08 17:39:37,972 INFO L280 TraceCheckUtils]: 24: Hoare triple {1007#(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; {1007#(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-08 17:39:37,972 INFO L280 TraceCheckUtils]: 25: Hoare triple {1007#(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; {1007#(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-08 17:39:37,973 INFO L280 TraceCheckUtils]: 26: Hoare triple {1007#(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; {1008#(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-08 17:39:37,974 INFO L280 TraceCheckUtils]: 27: Hoare triple {1008#(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; {1009#(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-08 17:39:37,976 INFO L280 TraceCheckUtils]: 28: Hoare triple {1009#(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; {1010#(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-08 17:39:37,979 INFO L280 TraceCheckUtils]: 29: Hoare triple {1010#(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); {1011#(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-08 17:39:37,982 INFO L263 TraceCheckUtils]: 30: Hoare triple {1011#(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)); {1012#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:37,982 INFO L280 TraceCheckUtils]: 31: Hoare triple {1012#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1013#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:37,983 INFO L280 TraceCheckUtils]: 32: Hoare triple {1013#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {999#false} is VALID [2020-07-08 17:39:37,983 INFO L280 TraceCheckUtils]: 33: Hoare triple {999#false} assume !false; {999#false} is VALID [2020-07-08 17:39:37,987 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-08 17:39:37,987 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:37,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215950237] [2020-07-08 17:39:37,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:37,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 17:39:37,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220758688] [2020-07-08 17:39:37,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:37,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:37,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 17:39:38,030 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-08 17:39:38,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 17:39:38,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 17:39:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:39:38,031 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-07-08 17:39:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:39,068 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-07-08 17:39:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 17:39:39,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-08 17:39:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-08 17:39:39,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2020-07-08 17:39:39,145 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-08 17:39:39,148 INFO L225 Difference]: With dead ends: 64 [2020-07-08 17:39:39,148 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 17:39:39,149 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-08 17:39:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 17:39:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-08 17:39:39,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:39,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-08 17:39:39,236 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-08 17:39:39,236 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-08 17:39:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:39,241 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-08 17:39:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-08 17:39:39,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:39,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:39,242 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-08 17:39:39,242 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-08 17:39:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:39,245 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-08 17:39:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-08 17:39:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:39,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:39,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:39,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 17:39:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-08 17:39:39,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-07-08 17:39:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:39,249 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-08 17:39:39,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 17:39:39,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-08 17:39:39,321 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-08 17:39:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-08 17:39:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 17:39:39,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:39,323 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-08 17:39:39,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:39:39,323 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1531087869, now seen corresponding path program 1 times [2020-07-08 17:39:39,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:39,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884814908] [2020-07-08 17:39:39,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:39,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1382#true} assume true; {1382#true} is VALID [2020-07-08 17:39:39,708 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1382#true} {1382#true} #69#return; {1382#true} is VALID [2020-07-08 17:39:39,709 INFO L263 TraceCheckUtils]: 0: Hoare triple {1382#true} call ULTIMATE.init(); {1382#true} is VALID [2020-07-08 17:39:39,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {1382#true} assume true; {1382#true} is VALID [2020-07-08 17:39:39,709 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1382#true} {1382#true} #69#return; {1382#true} is VALID [2020-07-08 17:39:39,709 INFO L263 TraceCheckUtils]: 3: Hoare triple {1382#true} call #t~ret2 := main(); {1382#true} is VALID [2020-07-08 17:39:39,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {1382#true} havoc ~i~0; {1382#true} is VALID [2020-07-08 17:39:39,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {1382#true} havoc ~n~0; {1382#true} is VALID [2020-07-08 17:39:39,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {1382#true} havoc ~a~0; {1382#true} is VALID [2020-07-08 17:39:39,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {1382#true} havoc ~b~0; {1382#true} is VALID [2020-07-08 17:39:39,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {1382#true} ~i~0 := 0; {1386#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:39,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1387#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:39,717 INFO L280 TraceCheckUtils]: 10: Hoare triple {1387#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1388#(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-08 17:39:39,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {1388#(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; {1388#(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-08 17:39:39,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {1388#(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; {1388#(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-08 17:39:39,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {1388#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1388#(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-08 17:39:39,720 INFO L280 TraceCheckUtils]: 14: Hoare triple {1388#(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); {1388#(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-08 17:39:39,721 INFO L280 TraceCheckUtils]: 15: Hoare triple {1388#(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); {1388#(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-08 17:39:39,721 INFO L280 TraceCheckUtils]: 16: Hoare triple {1388#(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; {1388#(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-08 17:39:39,722 INFO L280 TraceCheckUtils]: 17: Hoare triple {1388#(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; {1388#(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-08 17:39:39,723 INFO L280 TraceCheckUtils]: 18: Hoare triple {1388#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1388#(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-08 17:39:39,724 INFO L280 TraceCheckUtils]: 19: Hoare triple {1388#(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; {1389#(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-08 17:39:39,725 INFO L280 TraceCheckUtils]: 20: Hoare triple {1389#(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; {1390#(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-08 17:39:39,726 INFO L280 TraceCheckUtils]: 21: Hoare triple {1390#(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; {1388#(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-08 17:39:39,727 INFO L280 TraceCheckUtils]: 22: Hoare triple {1388#(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); {1391#(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-08 17:39:39,727 INFO L280 TraceCheckUtils]: 23: Hoare triple {1391#(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; {1391#(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-08 17:39:39,728 INFO L280 TraceCheckUtils]: 24: Hoare triple {1391#(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); {1391#(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-08 17:39:39,729 INFO L280 TraceCheckUtils]: 25: Hoare triple {1391#(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; {1391#(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-08 17:39:39,729 INFO L280 TraceCheckUtils]: 26: Hoare triple {1391#(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; {1392#(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-08 17:39:39,731 INFO L280 TraceCheckUtils]: 27: Hoare triple {1392#(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; {1393#(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-08 17:39:39,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {1393#(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; {1394#(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-08 17:39:39,733 INFO L280 TraceCheckUtils]: 29: Hoare triple {1394#(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); {1395#(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-08 17:39:39,734 INFO L263 TraceCheckUtils]: 30: Hoare triple {1395#(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)); {1396#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:39,734 INFO L280 TraceCheckUtils]: 31: Hoare triple {1396#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1397#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:39,735 INFO L280 TraceCheckUtils]: 32: Hoare triple {1397#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1383#false} is VALID [2020-07-08 17:39:39,735 INFO L280 TraceCheckUtils]: 33: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2020-07-08 17:39:39,740 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-08 17:39:39,740 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:39,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884814908] [2020-07-08 17:39:39,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:39,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 17:39:39,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042069693] [2020-07-08 17:39:39,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:39,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:39,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 17:39:39,781 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-08 17:39:39,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 17:39:39,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 17:39:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:39:39,783 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2020-07-08 17:39:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:40,860 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-08 17:39:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 17:39:40,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-08 17:39:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-08 17:39:40,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-08 17:39:40,958 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-08 17:39:40,960 INFO L225 Difference]: With dead ends: 76 [2020-07-08 17:39:40,961 INFO L226 Difference]: Without dead ends: 71 [2020-07-08 17:39:40,961 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-08 17:39:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-08 17:39:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2020-07-08 17:39:41,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:41,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 52 states. [2020-07-08 17:39:41,064 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 52 states. [2020-07-08 17:39:41,065 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 52 states. [2020-07-08 17:39:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,068 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-08 17:39:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-08 17:39:41,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,069 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 71 states. [2020-07-08 17:39:41,070 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 71 states. [2020-07-08 17:39:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,073 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-08 17:39:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-08 17:39:41,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:41,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 17:39:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-08 17:39:41,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2020-07-08 17:39:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:41,079 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-08 17:39:41,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 17:39:41,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2020-07-08 17:39:41,162 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-08 17:39:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-08 17:39:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 17:39:41,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:41,164 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-08 17:39:41,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:39:41,164 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -966733443, now seen corresponding path program 2 times [2020-07-08 17:39:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:41,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038039780] [2020-07-08 17:39:41,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:41,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1824#true} assume true; {1824#true} is VALID [2020-07-08 17:39:41,587 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1824#true} {1824#true} #69#return; {1824#true} is VALID [2020-07-08 17:39:41,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {1824#true} call ULTIMATE.init(); {1824#true} is VALID [2020-07-08 17:39:41,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1824#true} assume true; {1824#true} is VALID [2020-07-08 17:39:41,587 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1824#true} {1824#true} #69#return; {1824#true} is VALID [2020-07-08 17:39:41,588 INFO L263 TraceCheckUtils]: 3: Hoare triple {1824#true} call #t~ret2 := main(); {1824#true} is VALID [2020-07-08 17:39:41,588 INFO L280 TraceCheckUtils]: 4: Hoare triple {1824#true} havoc ~i~0; {1824#true} is VALID [2020-07-08 17:39:41,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {1824#true} havoc ~n~0; {1824#true} is VALID [2020-07-08 17:39:41,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {1824#true} havoc ~a~0; {1824#true} is VALID [2020-07-08 17:39:41,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {1824#true} havoc ~b~0; {1824#true} is VALID [2020-07-08 17:39:41,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {1824#true} ~i~0 := 0; {1828#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:41,589 INFO L280 TraceCheckUtils]: 9: Hoare triple {1828#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1829#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:41,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {1829#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1830#(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-08 17:39:41,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {1830#(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; {1830#(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-08 17:39:41,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1830#(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; {1830#(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-08 17:39:41,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {1830#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1830#(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-08 17:39:41,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {1830#(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); {1830#(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-08 17:39:41,593 INFO L280 TraceCheckUtils]: 15: Hoare triple {1830#(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); {1830#(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-08 17:39:41,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {1830#(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; {1830#(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-08 17:39:41,595 INFO L280 TraceCheckUtils]: 17: Hoare triple {1830#(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); {1830#(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-08 17:39:41,595 INFO L280 TraceCheckUtils]: 18: Hoare triple {1830#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1830#(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-08 17:39:41,596 INFO L280 TraceCheckUtils]: 19: Hoare triple {1830#(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; {1831#(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-08 17:39:41,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {1831#(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; {1832#(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-08 17:39:41,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {1832#(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; {1830#(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-08 17:39:41,599 INFO L280 TraceCheckUtils]: 22: Hoare triple {1830#(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); {1833#(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-08 17:39:41,600 INFO L280 TraceCheckUtils]: 23: Hoare triple {1833#(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; {1833#(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-08 17:39:41,600 INFO L280 TraceCheckUtils]: 24: Hoare triple {1833#(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; {1833#(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-08 17:39:41,601 INFO L280 TraceCheckUtils]: 25: Hoare triple {1833#(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; {1833#(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-08 17:39:41,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {1833#(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; {1834#(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-08 17:39:41,603 INFO L280 TraceCheckUtils]: 27: Hoare triple {1834#(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; {1835#(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-08 17:39:41,603 INFO L280 TraceCheckUtils]: 28: Hoare triple {1835#(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; {1836#(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-08 17:39:41,604 INFO L280 TraceCheckUtils]: 29: Hoare triple {1836#(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); {1837#(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-08 17:39:41,606 INFO L263 TraceCheckUtils]: 30: Hoare triple {1837#(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)); {1838#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:41,606 INFO L280 TraceCheckUtils]: 31: Hoare triple {1838#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1839#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:41,607 INFO L280 TraceCheckUtils]: 32: Hoare triple {1839#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1825#false} is VALID [2020-07-08 17:39:41,607 INFO L280 TraceCheckUtils]: 33: Hoare triple {1825#false} assume !false; {1825#false} is VALID [2020-07-08 17:39:41,610 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-08 17:39:41,611 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:41,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038039780] [2020-07-08 17:39:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 17:39:41,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498609469] [2020-07-08 17:39:41,612 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:41,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:41,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 17:39:41,655 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-08 17:39:41,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 17:39:41,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 17:39:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:39:41,656 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 14 states. [2020-07-08 17:39:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:42,863 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-07-08 17:39:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 17:39:42,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-08 17:39:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-08 17:39:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 17:39:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-08 17:39:42,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-08 17:39:42,955 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-08 17:39:42,960 INFO L225 Difference]: With dead ends: 83 [2020-07-08 17:39:42,960 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 17:39:42,961 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-08 17:39:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 17:39:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2020-07-08 17:39:43,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:43,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 55 states. [2020-07-08 17:39:43,083 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 55 states. [2020-07-08 17:39:43,083 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 55 states. [2020-07-08 17:39:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:43,087 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-08 17:39:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-08 17:39:43,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:43,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:43,088 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 78 states. [2020-07-08 17:39:43,088 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 78 states. [2020-07-08 17:39:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:43,091 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-08 17:39:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-08 17:39:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:43,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:43,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:43,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 17:39:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-08 17:39:43,094 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 34 [2020-07-08 17:39:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:43,094 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-08 17:39:43,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 17:39:43,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2020-07-08 17:39:43,192 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-08 17:39:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-08 17:39:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:39:43,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:43,194 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-08 17:39:43,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:39:43,195 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1509294206, now seen corresponding path program 3 times [2020-07-08 17:39:43,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:43,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495195591] [2020-07-08 17:39:43,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:43,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {2300#true} assume true; {2300#true} is VALID [2020-07-08 17:39:43,632 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2300#true} {2300#true} #69#return; {2300#true} is VALID [2020-07-08 17:39:43,632 INFO L263 TraceCheckUtils]: 0: Hoare triple {2300#true} call ULTIMATE.init(); {2300#true} is VALID [2020-07-08 17:39:43,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {2300#true} assume true; {2300#true} is VALID [2020-07-08 17:39:43,632 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2300#true} {2300#true} #69#return; {2300#true} is VALID [2020-07-08 17:39:43,633 INFO L263 TraceCheckUtils]: 3: Hoare triple {2300#true} call #t~ret2 := main(); {2300#true} is VALID [2020-07-08 17:39:43,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {2300#true} havoc ~i~0; {2300#true} is VALID [2020-07-08 17:39:43,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {2300#true} havoc ~n~0; {2300#true} is VALID [2020-07-08 17:39:43,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {2300#true} havoc ~a~0; {2300#true} is VALID [2020-07-08 17:39:43,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {2300#true} havoc ~b~0; {2300#true} is VALID [2020-07-08 17:39:43,637 INFO L280 TraceCheckUtils]: 8: Hoare triple {2300#true} ~i~0 := 0; {2304#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 17:39:43,638 INFO L280 TraceCheckUtils]: 9: Hoare triple {2304#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {2305#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-08 17:39:43,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {2305#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {2306#(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-08 17:39:43,639 INFO L280 TraceCheckUtils]: 11: Hoare triple {2306#(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; {2306#(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-08 17:39:43,639 INFO L280 TraceCheckUtils]: 12: Hoare triple {2306#(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; {2306#(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-08 17:39:43,640 INFO L280 TraceCheckUtils]: 13: Hoare triple {2306#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {2306#(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-08 17:39:43,641 INFO L280 TraceCheckUtils]: 14: Hoare triple {2306#(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); {2306#(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-08 17:39:43,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {2306#(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); {2306#(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-08 17:39:43,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {2306#(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; {2306#(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-08 17:39:43,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {2306#(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; {2306#(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-08 17:39:43,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {2306#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2306#(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-08 17:39:43,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {2306#(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; {2307#(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-08 17:39:43,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {2307#(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; {2308#(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-08 17:39:43,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {2308#(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; {2306#(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-08 17:39:43,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {2306#(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); {2306#(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-08 17:39:43,651 INFO L280 TraceCheckUtils]: 23: Hoare triple {2306#(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; {2306#(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-08 17:39:43,651 INFO L280 TraceCheckUtils]: 24: Hoare triple {2306#(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); {2306#(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-08 17:39:43,652 INFO L280 TraceCheckUtils]: 25: Hoare triple {2306#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2306#(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-08 17:39:43,653 INFO L280 TraceCheckUtils]: 26: Hoare triple {2306#(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; {2309#(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-08 17:39:43,654 INFO L280 TraceCheckUtils]: 27: Hoare triple {2309#(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; {2308#(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-08 17:39:43,655 INFO L280 TraceCheckUtils]: 28: Hoare triple {2308#(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; {2306#(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-08 17:39:43,656 INFO L280 TraceCheckUtils]: 29: Hoare triple {2306#(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); {2310#(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-08 17:39:43,656 INFO L280 TraceCheckUtils]: 30: Hoare triple {2310#(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; {2310#(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-08 17:39:43,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {2310#(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; {2310#(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-08 17:39:43,658 INFO L280 TraceCheckUtils]: 32: Hoare triple {2310#(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; {2310#(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-08 17:39:43,658 INFO L280 TraceCheckUtils]: 33: Hoare triple {2310#(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; {2311#(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-08 17:39:43,659 INFO L280 TraceCheckUtils]: 34: Hoare triple {2311#(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; {2312#(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-08 17:39:43,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {2312#(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; {2313#(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-08 17:39:43,661 INFO L280 TraceCheckUtils]: 36: Hoare triple {2313#(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); {2314#(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-08 17:39:43,662 INFO L263 TraceCheckUtils]: 37: Hoare triple {2314#(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)); {2315#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:43,663 INFO L280 TraceCheckUtils]: 38: Hoare triple {2315#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2316#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:43,663 INFO L280 TraceCheckUtils]: 39: Hoare triple {2316#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2301#false} is VALID [2020-07-08 17:39:43,663 INFO L280 TraceCheckUtils]: 40: Hoare triple {2301#false} assume !false; {2301#false} is VALID [2020-07-08 17:39:43,667 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-08 17:39:43,667 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:43,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495195591] [2020-07-08 17:39:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:43,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 17:39:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928642172] [2020-07-08 17:39:43,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-08 17:39:43,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:43,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 17:39:43,716 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-08 17:39:43,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 17:39:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 17:39:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:39:43,718 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 15 states. [2020-07-08 17:39:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,877 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-07-08 17:39:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 17:39:44,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-08 17:39:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:39:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-08 17:39:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:39:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-08 17:39:44,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 42 transitions. [2020-07-08 17:39:44,937 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-08 17:39:44,938 INFO L225 Difference]: With dead ends: 63 [2020-07-08 17:39:44,938 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 17:39:44,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2020-07-08 17:39:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 17:39:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 17:39:44,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:44,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:44,940 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:44,940 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,941 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:44,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,941 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:44,941 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,942 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:44,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:44,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 17:39:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 17:39:44,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-08 17:39:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:44,943 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 17:39:44,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 17:39:44,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 17:39:44,943 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-08 17:39:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:44,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 17:39:44,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 17:39:45,479 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,479 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,479 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,480 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,480 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,480 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:45,480 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:45,480 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:45,481 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 17:39:45,481 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 17:39:45,481 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:45,481 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-08 17:39:45,481 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 29) the Hoare annotation is: true [2020-07-08 17:39:45,481 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-08 17:39:45,482 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-08 17:39:45,482 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 17:39:45,482 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-08 17:39:45,482 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-08 17:39:45,482 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-08 17:39:45,482 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-08 17:39:45,482 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 29) the Hoare annotation is: true [2020-07-08 17:39:45,482 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-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,483 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 29) the Hoare annotation is: true [2020-07-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,483 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-08 17:39:45,484 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-08 17:39:45,484 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 17:39:45,484 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-08 17:39:45,484 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-08 17:39:45,484 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-08 17:39:45,484 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-08 17:39:45,484 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 17:39:45,485 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-08 17:39:45,485 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:45,485 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-08 17:39:45,485 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-08 17:39:45,485 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:45,489 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 17:39:45,490 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:45,490 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:45,490 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 17:39:45,490 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 17:39:45,503 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-08 17:39:45,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:39:45 BoogieIcfgContainer [2020-07-08 17:39:45,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:39:45,518 INFO L168 Benchmark]: Toolchain (without parser) took 16179.66 ms. Allocated memory was 136.8 MB in the beginning and 349.7 MB in the end (delta: 212.9 MB). Free memory was 102.0 MB in the beginning and 205.1 MB in the end (delta: -103.1 MB). Peak memory consumption was 109.8 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,518 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.30 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 91.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,520 INFO L168 Benchmark]: Boogie Preprocessor took 126.71 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 181.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,521 INFO L168 Benchmark]: RCFGBuilder took 363.47 ms. Allocated memory is still 201.3 MB. Free memory was 181.4 MB in the beginning and 160.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,522 INFO L168 Benchmark]: TraceAbstraction took 15442.27 ms. Allocated memory was 201.3 MB in the beginning and 349.7 MB in the end (delta: 148.4 MB). Free memory was 160.4 MB in the beginning and 205.1 MB in the end (delta: -44.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:45,525 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.66 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.30 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 91.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.71 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 181.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.47 ms. Allocated memory is still 201.3 MB. Free memory was 181.4 MB in the beginning and 160.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15442.27 ms. Allocated memory was 201.3 MB in the beginning and 349.7 MB in the end (delta: 148.4 MB). Free memory was 160.4 MB in the beginning and 205.1 MB in the end (delta: -44.7 MB). Peak memory consumption was 103.7 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.7s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 350 SDslu, 1077 SDs, 0 SdLazy, 927 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 4.0s 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.5s 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...