/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-267fbe0 [2020-07-18 00:48:52,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:52,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:52,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:52,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:52,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:52,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:52,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:52,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:52,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:52,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:52,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:52,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:52,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:52,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:52,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:52,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:52,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:52,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:52,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:52,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:52,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:52,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:52,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:52,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:52,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:52,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:52,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:52,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:52,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:52,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:52,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:52,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:52,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:52,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:52,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:52,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:52,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:52,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:52,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:52,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:52,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:52,593 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:52,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:52,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:52,603 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:52,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:52,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:52,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:52,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:52,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:52,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:52,605 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:52,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:52,605 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:52,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:52,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:52,605 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:52,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:52,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:52,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:52,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:52,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:52,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:52,609 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:52,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:52,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:52,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:52,936 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:52,936 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:52,937 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-18 00:48:52,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a5a23b/06f4127b7ecc4b67a41c8cecee0fd5a6/FLAGabaa1b083 [2020-07-18 00:48:53,440 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:53,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-18 00:48:53,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a5a23b/06f4127b7ecc4b67a41c8cecee0fd5a6/FLAGabaa1b083 [2020-07-18 00:48:53,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265a5a23b/06f4127b7ecc4b67a41c8cecee0fd5a6 [2020-07-18 00:48:53,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:53,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:53,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:53,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:53,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:53,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:53" (1/1) ... [2020-07-18 00:48:53,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b59cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:53, skipping insertion in model container [2020-07-18 00:48:53,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:53" (1/1) ... [2020-07-18 00:48:53,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:53,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:54,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:54,058 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:54,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:54,092 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:54,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54 WrapperNode [2020-07-18 00:48:54,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:54,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:54,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:54,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:54,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (1/1) ... [2020-07-18 00:48:54,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:54,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:54,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:54,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:54,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (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-18 00:48:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:54,586 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:54,586 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:48:54,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:54 BoogieIcfgContainer [2020-07-18 00:48:54,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:54,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:54,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:54,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:54,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:53" (1/3) ... [2020-07-18 00:48:54,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9965cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:54, skipping insertion in model container [2020-07-18 00:48:54,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:54" (2/3) ... [2020-07-18 00:48:54,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9965cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:54, skipping insertion in model container [2020-07-18 00:48:54,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:54" (3/3) ... [2020-07-18 00:48:54,602 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2020-07-18 00:48:54,617 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:54,625 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:54,642 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:54,666 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:54,666 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:54,666 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:54,667 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:54,667 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:54,667 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:54,667 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:54,667 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-18 00:48:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:48:54,695 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:54,696 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-18 00:48:54,696 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 317967837, now seen corresponding path program 1 times [2020-07-18 00:48:54,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:54,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286591497] [2020-07-18 00:48:54,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:55,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-18 00:48:55,161 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-18 00:48:55,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-18 00:48:55,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-18 00:48:55,165 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-18 00:48:55,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret2 := main(); {41#true} is VALID [2020-07-18 00:48:55,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} havoc ~i~0; {41#true} is VALID [2020-07-18 00:48:55,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0; {41#true} is VALID [2020-07-18 00:48:55,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc ~a~0; {41#true} is VALID [2020-07-18 00:48:55,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} havoc ~b~0; {41#true} is VALID [2020-07-18 00:48:55,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~i~0 := 0; {45#(<= main_~i~0 0)} is VALID [2020-07-18 00:48:55,170 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-18 00:48:55,172 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-18 00:48:55,173 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-18 00:48:55,176 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~n~0 := #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:55,178 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:55,179 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:55,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:55,184 INFO L263 TraceCheckUtils]: 16: Hoare triple {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:55,186 INFO L280 TraceCheckUtils]: 17: Hoare triple {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {51#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:55,187 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42#false} is VALID [2020-07-18 00:48:55,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-18 00:48:55,192 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-18 00:48:55,195 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:55,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286591497] [2020-07-18 00:48:55,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:55,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:48:55,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861822175] [2020-07-18 00:48:55,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-18 00:48:55,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:55,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:48:55,255 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-18 00:48:55,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:48:55,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:48:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:48:55,269 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 9 states. [2020-07-18 00:48:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,027 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-18 00:48:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:48:56,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-18 00:48:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-18 00:48:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:48:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-18 00:48:56,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-18 00:48:56,157 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-18 00:48:56,170 INFO L225 Difference]: With dead ends: 70 [2020-07-18 00:48:56,171 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:48:56,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:48:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:48:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2020-07-18 00:48:56,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:56,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2020-07-18 00:48:56,242 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2020-07-18 00:48:56,242 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2020-07-18 00:48:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,247 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-18 00:48:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-18 00:48:56,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:56,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:56,248 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2020-07-18 00:48:56,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2020-07-18 00:48:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:56,253 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-18 00:48:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-18 00:48:56,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:56,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:56,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:56,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:48:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-18 00:48:56,259 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2020-07-18 00:48:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:56,259 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-18 00:48:56,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:48:56,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2020-07-18 00:48:56,298 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-18 00:48:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-18 00:48:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:56,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:56,300 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-18 00:48:56,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:56,301 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash -628039010, now seen corresponding path program 1 times [2020-07-18 00:48:56,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:56,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054465807] [2020-07-18 00:48:56,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:56,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-18 00:48:56,732 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-18 00:48:56,732 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-18 00:48:56,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-18 00:48:56,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-18 00:48:56,733 INFO L263 TraceCheckUtils]: 3: Hoare triple {344#true} call #t~ret2 := main(); {344#true} is VALID [2020-07-18 00:48:56,734 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#true} havoc ~i~0; {344#true} is VALID [2020-07-18 00:48:56,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} havoc ~n~0; {344#true} is VALID [2020-07-18 00:48:56,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {344#true} havoc ~a~0; {344#true} is VALID [2020-07-18 00:48:56,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#true} havoc ~b~0; {344#true} is VALID [2020-07-18 00:48:56,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {344#true} ~i~0 := 0; {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:48:56,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:48:56,741 INFO L280 TraceCheckUtils]: 10: Hoare triple {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:48:56,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:48:56,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:48:56,745 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:48:56,746 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:48:56,747 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:56,748 INFO L280 TraceCheckUtils]: 16: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:56,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:56,751 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:48:56,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:56,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:56,757 INFO L280 TraceCheckUtils]: 21: Hoare triple {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:56,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:48:56,760 INFO L263 TraceCheckUtils]: 23: Hoare triple {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:56,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {357#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:56,763 INFO L280 TraceCheckUtils]: 25: Hoare triple {357#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {345#false} is VALID [2020-07-18 00:48:56,763 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-18 00:48:56,771 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-18 00:48:56,771 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:56,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054465807] [2020-07-18 00:48:56,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:56,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:48:56,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164488847] [2020-07-18 00:48:56,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-18 00:48:56,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:56,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:48:56,815 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-18 00:48:56,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:48:56,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:48:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:48:56,816 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2020-07-18 00:48:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,600 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-18 00:48:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:48:57,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-18 00:48:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:48:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-18 00:48:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:48:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-18 00:48:57,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-18 00:48:57,679 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-18 00:48:57,681 INFO L225 Difference]: With dead ends: 53 [2020-07-18 00:48:57,681 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 00:48:57,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 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-18 00:48:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 00:48:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-18 00:48:57,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:57,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-18 00:48:57,744 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-18 00:48:57,744 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-18 00:48:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,748 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 00:48:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 00:48:57,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,749 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-18 00:48:57,749 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-18 00:48:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:57,753 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-18 00:48:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-18 00:48:57,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:57,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:57,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:57,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 00:48:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2020-07-18 00:48:57,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2020-07-18 00:48:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:57,758 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-07-18 00:48:57,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:48:57,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2020-07-18 00:48:57,803 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-18 00:48:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-18 00:48:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:57,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:57,805 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-18 00:48:57,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:57,805 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1791276066, now seen corresponding path program 1 times [2020-07-18 00:48:57,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:57,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153878616] [2020-07-18 00:48:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:00,024 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-07-18 00:49:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:00,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-18 00:49:00,517 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-18 00:49:00,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2020-07-18 00:49:00,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-18 00:49:00,518 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-18 00:49:00,519 INFO L263 TraceCheckUtils]: 3: Hoare triple {654#true} call #t~ret2 := main(); {654#true} is VALID [2020-07-18 00:49:00,519 INFO L280 TraceCheckUtils]: 4: Hoare triple {654#true} havoc ~i~0; {654#true} is VALID [2020-07-18 00:49:00,519 INFO L280 TraceCheckUtils]: 5: Hoare triple {654#true} havoc ~n~0; {654#true} is VALID [2020-07-18 00:49:00,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {654#true} havoc ~a~0; {654#true} is VALID [2020-07-18 00:49:00,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {654#true} havoc ~b~0; {654#true} is VALID [2020-07-18 00:49:00,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {654#true} ~i~0 := 0; {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:49:00,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:49:00,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:00,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:00,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:00,526 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:00,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:00,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} [75] L17-2-->L17-3_primed: Formula: (let ((.cse10 (* 2 |v_oct_main_#t~nondet1_in_1|))) (let ((.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse3 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse4 (<= 0 .cse10)) (.cse5 (<= .cse10 0))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_1 1)) (.cse2 (+ v_oct_main_~a~0_in_1 2)) (.cse6 (+ v_oct_main_~b~0_in_1 1))) (and .cse0 (<= .cse1 v_oct_main_~n~0_in_1) (<= .cse1 v_oct_main_~i~0_out_1) (<= .cse2 v_oct_main_~a~0_out_1) .cse3 .cse4 (<= v_oct_main_~i~0_out_1 .cse1) .cse5 (<= .cse6 v_oct_main_~b~0_out_1) (<= v_oct_main_~a~0_out_1 .cse2) (<= v_oct_main_~b~0_out_1 .cse6))) (let ((.cse9 (+ v_oct_main_~i~0_in_1 (div (+ (* v_oct_main_~a~0_out_1 (- 1)) v_oct_main_~a~0_in_1 4) (- 2)) 2)) (.cse8 (+ v_oct_main_~i~0_in_1 v_oct_main_~b~0_out_1)) (.cse7 (+ v_oct_main_~i~0_out_1 v_oct_main_~b~0_in_1))) (and .cse0 .cse3 .cse4 (<= .cse7 .cse8) (<= .cse9 v_oct_main_~i~0_out_1) .cse5 (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 (div (+ v_oct_main_~a~0_out_1 (* v_oct_main_~a~0_in_1 (- 1)) (- 4)) 2) 2)) (<= .cse9 v_oct_main_~n~0_in_1) (<= (+ v_oct_main_~b~0_in_1 2) v_oct_main_~b~0_out_1) (<= .cse8 .cse7)))))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1, main_#t~nondet1=|v_oct_main_#t~nondet1_in_1|, main_~b~0=v_oct_main_~b~0_in_1, main_~a~0=v_oct_main_~a~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_#t~nondet1=|v_oct_main_#t~nondet1_out_1|, main_~b~0=v_oct_main_~b~0_out_1, main_~a~0=v_oct_main_~a~0_out_1} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {661#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:00,532 INFO L280 TraceCheckUtils]: 16: Hoare triple {661#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} [74] L17-3_primed-->L17-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_5)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {662#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:00,533 INFO L263 TraceCheckUtils]: 17: Hoare triple {662#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {663#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:00,534 INFO L280 TraceCheckUtils]: 18: Hoare triple {663#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {664#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:00,535 INFO L280 TraceCheckUtils]: 19: Hoare triple {664#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {655#false} is VALID [2020-07-18 00:49:00,535 INFO L280 TraceCheckUtils]: 20: Hoare triple {655#false} assume !false; {655#false} is VALID [2020-07-18 00:49:00,536 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-18 00:49:00,807 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:00,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153878616] [2020-07-18 00:49:00,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:00,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:49:00,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238460098] [2020-07-18 00:49:00,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-18 00:49:00,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:00,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:49:00,852 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-18 00:49:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:49:00,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:49:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:49:00,854 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2020-07-18 00:49:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:01,763 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 00:49:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-18 00:49:01,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-18 00:49:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-18 00:49:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2020-07-18 00:49:01,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 58 transitions. [2020-07-18 00:49:01,848 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-18 00:49:01,851 INFO L225 Difference]: With dead ends: 56 [2020-07-18 00:49:01,851 INFO L226 Difference]: Without dead ends: 51 [2020-07-18 00:49:01,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-07-18 00:49:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-18 00:49:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-07-18 00:49:01,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:01,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 45 states. [2020-07-18 00:49:01,939 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 45 states. [2020-07-18 00:49:01,939 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 45 states. [2020-07-18 00:49:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:01,942 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 00:49:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 00:49:01,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:01,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:01,944 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 51 states. [2020-07-18 00:49:01,944 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 51 states. [2020-07-18 00:49:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:01,947 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-18 00:49:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 00:49:01,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:01,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:01,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:01,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 00:49:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-18 00:49:01,952 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 27 [2020-07-18 00:49:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:01,953 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-18 00:49:01,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:49:01,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-18 00:49:02,016 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-18 00:49:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-18 00:49:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:49:02,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:02,019 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-18 00:49:02,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:49:02,019 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1600642371, now seen corresponding path program 2 times [2020-07-18 00:49:02,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:02,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501181388] [2020-07-18 00:49:02,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:02,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-18 00:49:02,453 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {997#true} {997#true} #69#return; {997#true} is VALID [2020-07-18 00:49:02,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {997#true} is VALID [2020-07-18 00:49:02,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-18 00:49:02,453 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {997#true} {997#true} #69#return; {997#true} is VALID [2020-07-18 00:49:02,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {997#true} call #t~ret2 := main(); {997#true} is VALID [2020-07-18 00:49:02,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} havoc ~i~0; {997#true} is VALID [2020-07-18 00:49:02,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#true} havoc ~n~0; {997#true} is VALID [2020-07-18 00:49:02,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {997#true} havoc ~a~0; {997#true} is VALID [2020-07-18 00:49:02,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {997#true} havoc ~b~0; {997#true} is VALID [2020-07-18 00:49:02,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#true} ~i~0 := 0; {1001#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:49:02,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {1001#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1002#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:49:02,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {1002#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,459 INFO L280 TraceCheckUtils]: 11: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {1004#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:02,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {1005#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-18 00:49:02,468 INFO L280 TraceCheckUtils]: 21: Hoare triple {1005#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:02,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {1003#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:02,472 INFO L280 TraceCheckUtils]: 23: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:02,474 INFO L280 TraceCheckUtils]: 24: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:02,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:02,475 INFO L280 TraceCheckUtils]: 26: Hoare triple {1006#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {1007#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:02,476 INFO L280 TraceCheckUtils]: 27: Hoare triple {1007#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {1008#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:02,477 INFO L280 TraceCheckUtils]: 28: Hoare triple {1008#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1009#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:02,479 INFO L280 TraceCheckUtils]: 29: Hoare triple {1009#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1010#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:02,482 INFO L263 TraceCheckUtils]: 30: Hoare triple {1010#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1011#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:02,483 INFO L280 TraceCheckUtils]: 31: Hoare triple {1011#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1012#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:02,483 INFO L280 TraceCheckUtils]: 32: Hoare triple {1012#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {998#false} is VALID [2020-07-18 00:49:02,484 INFO L280 TraceCheckUtils]: 33: Hoare triple {998#false} assume !false; {998#false} is VALID [2020-07-18 00:49:02,488 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-18 00:49:02,488 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:02,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501181388] [2020-07-18 00:49:02,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:02,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:49:02,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777753983] [2020-07-18 00:49:02,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:02,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:02,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:49:02,532 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-18 00:49:02,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:49:02,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:49:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:49:02,534 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-07-18 00:49:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,611 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-07-18 00:49:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 00:49:03,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-18 00:49:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-18 00:49:03,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2020-07-18 00:49:03,694 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-18 00:49:03,696 INFO L225 Difference]: With dead ends: 64 [2020-07-18 00:49:03,697 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 00:49:03,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 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-18 00:49:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 00:49:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-18 00:49:03,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:03,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-18 00:49:03,801 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-18 00:49:03,801 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-18 00:49:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,804 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-18 00:49:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-18 00:49:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:03,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:03,806 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-18 00:49:03,806 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-18 00:49:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:03,809 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-18 00:49:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-18 00:49:03,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:03,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:03,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:03,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 00:49:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-18 00:49:03,813 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-07-18 00:49:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:03,814 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-18 00:49:03,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:49:03,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-18 00:49:03,879 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-18 00:49:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-18 00:49:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:49:03,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:03,881 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-18 00:49:03,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:49:03,882 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:03,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1531087869, now seen corresponding path program 1 times [2020-07-18 00:49:03,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:03,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1745217445] [2020-07-18 00:49:03,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:04,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-18 00:49:04,277 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1381#true} {1381#true} #69#return; {1381#true} is VALID [2020-07-18 00:49:04,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2020-07-18 00:49:04,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} #69#return; {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L263 TraceCheckUtils]: 3: Hoare triple {1381#true} call #t~ret2 := main(); {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {1381#true} havoc ~i~0; {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {1381#true} havoc ~n~0; {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {1381#true} havoc ~a~0; {1381#true} is VALID [2020-07-18 00:49:04,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {1381#true} havoc ~b~0; {1381#true} is VALID [2020-07-18 00:49:04,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {1381#true} ~i~0 := 0; {1385#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:49:04,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1385#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1386#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:49:04,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,297 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,299 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,300 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {1388#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:04,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {1388#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {1389#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-18 00:49:04,303 INFO L280 TraceCheckUtils]: 21: Hoare triple {1389#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:04,304 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:04,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:04,305 INFO L280 TraceCheckUtils]: 24: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(0 != #t~nondet1); {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:04,306 INFO L280 TraceCheckUtils]: 25: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:04,307 INFO L280 TraceCheckUtils]: 26: Hoare triple {1390#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 2 + ~a~0; {1391#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:04,307 INFO L280 TraceCheckUtils]: 27: Hoare triple {1391#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} ~b~0 := 1 + ~b~0; {1392#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:04,308 INFO L280 TraceCheckUtils]: 28: Hoare triple {1392#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1393#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:04,309 INFO L280 TraceCheckUtils]: 29: Hoare triple {1393#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1394#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:04,311 INFO L263 TraceCheckUtils]: 30: Hoare triple {1394#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1395#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:04,312 INFO L280 TraceCheckUtils]: 31: Hoare triple {1395#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1396#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:04,313 INFO L280 TraceCheckUtils]: 32: Hoare triple {1396#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1382#false} is VALID [2020-07-18 00:49:04,313 INFO L280 TraceCheckUtils]: 33: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2020-07-18 00:49:04,317 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-18 00:49:04,317 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:04,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1745217445] [2020-07-18 00:49:04,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:04,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:49:04,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961610160] [2020-07-18 00:49:04,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:04,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:04,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:49:04,359 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-18 00:49:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:49:04,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:49:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:49:04,361 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2020-07-18 00:49:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:05,500 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-18 00:49:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:49:05,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-18 00:49:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-18 00:49:05,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-18 00:49:05,617 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-18 00:49:05,620 INFO L225 Difference]: With dead ends: 76 [2020-07-18 00:49:05,620 INFO L226 Difference]: Without dead ends: 71 [2020-07-18 00:49:05,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 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-18 00:49:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-18 00:49:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2020-07-18 00:49:05,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:05,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 52 states. [2020-07-18 00:49:05,758 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 52 states. [2020-07-18 00:49:05,758 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 52 states. [2020-07-18 00:49:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:05,762 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-18 00:49:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-18 00:49:05,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:05,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:05,763 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 71 states. [2020-07-18 00:49:05,763 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 71 states. [2020-07-18 00:49:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:05,767 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-18 00:49:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2020-07-18 00:49:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:05,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:05,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 00:49:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-18 00:49:05,771 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2020-07-18 00:49:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:05,771 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-18 00:49:05,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:49:05,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2020-07-18 00:49:05,864 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-18 00:49:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-18 00:49:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:49:05,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:05,865 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-18 00:49:05,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:49:05,866 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:05,866 INFO L82 PathProgramCache]: Analyzing trace with hash -966733443, now seen corresponding path program 2 times [2020-07-18 00:49:05,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:05,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1472459712] [2020-07-18 00:49:05,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:06,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {1823#true} assume true; {1823#true} is VALID [2020-07-18 00:49:06,256 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1823#true} {1823#true} #69#return; {1823#true} is VALID [2020-07-18 00:49:06,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2020-07-18 00:49:06,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {1823#true} assume true; {1823#true} is VALID [2020-07-18 00:49:06,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1823#true} {1823#true} #69#return; {1823#true} is VALID [2020-07-18 00:49:06,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {1823#true} call #t~ret2 := main(); {1823#true} is VALID [2020-07-18 00:49:06,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {1823#true} havoc ~i~0; {1823#true} is VALID [2020-07-18 00:49:06,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {1823#true} havoc ~n~0; {1823#true} is VALID [2020-07-18 00:49:06,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {1823#true} havoc ~a~0; {1823#true} is VALID [2020-07-18 00:49:06,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {1823#true} havoc ~b~0; {1823#true} is VALID [2020-07-18 00:49:06,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {1823#true} ~i~0 := 0; {1827#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:49:06,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {1827#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1828#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:49:06,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {1828#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {1830#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-18 00:49:06,268 INFO L280 TraceCheckUtils]: 20: Hoare triple {1830#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {1831#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-18 00:49:06,269 INFO L280 TraceCheckUtils]: 21: Hoare triple {1831#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:06,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {1829#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:06,271 INFO L280 TraceCheckUtils]: 23: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:06,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:06,272 INFO L280 TraceCheckUtils]: 25: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:06,273 INFO L280 TraceCheckUtils]: 26: Hoare triple {1832#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {1833#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:06,274 INFO L280 TraceCheckUtils]: 27: Hoare triple {1833#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {1834#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:06,276 INFO L280 TraceCheckUtils]: 28: Hoare triple {1834#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1835#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:06,277 INFO L280 TraceCheckUtils]: 29: Hoare triple {1835#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1836#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:06,279 INFO L263 TraceCheckUtils]: 30: Hoare triple {1836#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1837#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:06,281 INFO L280 TraceCheckUtils]: 31: Hoare triple {1837#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1838#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:06,282 INFO L280 TraceCheckUtils]: 32: Hoare triple {1838#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1824#false} is VALID [2020-07-18 00:49:06,282 INFO L280 TraceCheckUtils]: 33: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2020-07-18 00:49:06,285 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-18 00:49:06,286 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:06,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1472459712] [2020-07-18 00:49:06,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:06,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:49:06,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894559867] [2020-07-18 00:49:06,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:06,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:06,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:49:06,331 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-18 00:49:06,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:49:06,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:49:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:49:06,333 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 14 states. [2020-07-18 00:49:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:07,571 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-07-18 00:49:07,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:49:07,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-18 00:49:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-18 00:49:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:49:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-18 00:49:07,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-18 00:49:07,682 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-18 00:49:07,684 INFO L225 Difference]: With dead ends: 83 [2020-07-18 00:49:07,684 INFO L226 Difference]: Without dead ends: 78 [2020-07-18 00:49:07,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 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-18 00:49:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-18 00:49:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2020-07-18 00:49:07,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:07,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 55 states. [2020-07-18 00:49:07,812 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 55 states. [2020-07-18 00:49:07,813 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 55 states. [2020-07-18 00:49:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:07,816 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-18 00:49:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-18 00:49:07,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:07,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:07,817 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 78 states. [2020-07-18 00:49:07,817 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 78 states. [2020-07-18 00:49:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:07,820 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-07-18 00:49:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-18 00:49:07,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:07,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:07,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:07,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 00:49:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-18 00:49:07,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 34 [2020-07-18 00:49:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:07,824 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-18 00:49:07,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:49:07,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2020-07-18 00:49:07,906 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-18 00:49:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-18 00:49:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:49:07,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:07,907 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-18 00:49:07,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:49:07,907 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1509294206, now seen corresponding path program 3 times [2020-07-18 00:49:07,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:07,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720156256] [2020-07-18 00:49:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-18 00:49:08,372 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2299#true} {2299#true} #69#return; {2299#true} is VALID [2020-07-18 00:49:08,372 INFO L263 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2020-07-18 00:49:08,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-18 00:49:08,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2299#true} {2299#true} #69#return; {2299#true} is VALID [2020-07-18 00:49:08,373 INFO L263 TraceCheckUtils]: 3: Hoare triple {2299#true} call #t~ret2 := main(); {2299#true} is VALID [2020-07-18 00:49:08,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#true} havoc ~i~0; {2299#true} is VALID [2020-07-18 00:49:08,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {2299#true} havoc ~n~0; {2299#true} is VALID [2020-07-18 00:49:08,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {2299#true} havoc ~a~0; {2299#true} is VALID [2020-07-18 00:49:08,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {2299#true} havoc ~b~0; {2299#true} is VALID [2020-07-18 00:49:08,376 INFO L280 TraceCheckUtils]: 8: Hoare triple {2299#true} ~i~0 := 0; {2303#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-18 00:49:08,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {2303#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {2304#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-18 00:49:08,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {2304#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,379 INFO L280 TraceCheckUtils]: 12: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,381 INFO L280 TraceCheckUtils]: 15: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,382 INFO L280 TraceCheckUtils]: 16: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,389 INFO L280 TraceCheckUtils]: 19: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {2306#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:08,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {2306#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-18 00:49:08,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,392 INFO L280 TraceCheckUtils]: 22: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,393 INFO L280 TraceCheckUtils]: 23: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,394 INFO L280 TraceCheckUtils]: 24: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,395 INFO L280 TraceCheckUtils]: 25: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,396 INFO L280 TraceCheckUtils]: 26: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {2308#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-18 00:49:08,398 INFO L280 TraceCheckUtils]: 27: Hoare triple {2308#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-18 00:49:08,399 INFO L280 TraceCheckUtils]: 28: Hoare triple {2307#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-18 00:49:08,400 INFO L280 TraceCheckUtils]: 29: Hoare triple {2305#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:08,401 INFO L280 TraceCheckUtils]: 30: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:08,402 INFO L280 TraceCheckUtils]: 31: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:08,403 INFO L280 TraceCheckUtils]: 32: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 00:49:08,405 INFO L280 TraceCheckUtils]: 33: Hoare triple {2309#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {2310#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:08,406 INFO L280 TraceCheckUtils]: 34: Hoare triple {2310#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {2311#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:08,407 INFO L280 TraceCheckUtils]: 35: Hoare triple {2311#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {2312#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:08,408 INFO L280 TraceCheckUtils]: 36: Hoare triple {2312#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {2313#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-18 00:49:08,409 INFO L263 TraceCheckUtils]: 37: Hoare triple {2313#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {2314#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:08,410 INFO L280 TraceCheckUtils]: 38: Hoare triple {2314#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2315#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:08,410 INFO L280 TraceCheckUtils]: 39: Hoare triple {2315#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2300#false} is VALID [2020-07-18 00:49:08,410 INFO L280 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2020-07-18 00:49:08,414 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-18 00:49:08,414 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:08,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720156256] [2020-07-18 00:49:08,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:08,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:49:08,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339251619] [2020-07-18 00:49:08,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:49:08,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:08,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:49:08,467 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-18 00:49:08,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:49:08,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:49:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:49:08,469 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 15 states. [2020-07-18 00:49:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,659 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-07-18 00:49:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 00:49:09,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-18 00:49:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-18 00:49:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-18 00:49:09,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 42 transitions. [2020-07-18 00:49:09,726 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-18 00:49:09,727 INFO L225 Difference]: With dead ends: 63 [2020-07-18 00:49:09,727 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:09,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 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-18 00:49:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:09,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:09,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:09,732 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:09,732 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,733 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:09,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:09,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:09,733 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:09,733 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,734 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:09,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:09,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:09,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:09,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:09,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-18 00:49:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:09,735 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:09,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:49:09,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:09,736 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-18 00:49:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:09,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:09,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:49:09,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:10,302 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:10,302 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:10,302 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:10,303 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:10,303 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:10,303 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-18 00:49:10,303 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 29) the Hoare annotation is: true [2020-07-18 00:49:10,303 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-18 00:49:10,303 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-18 00:49:10,303 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:49:10,303 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-18 00:49:10,303 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-18 00:49:10,304 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-18 00:49:10,304 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-18 00:49:10,304 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 29) the Hoare annotation is: true [2020-07-18 00:49:10,304 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-18 00:49:10,304 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-18 00:49:10,304 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-18 00:49:10,304 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 29) the Hoare annotation is: true [2020-07-18 00:49:10,304 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-18 00:49:10,304 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-18 00:49:10,304 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-18 00:49:10,305 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-18 00:49:10,305 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-18 00:49:10,305 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-18 00:49:10,305 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-18 00:49:10,305 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 00:49:10,305 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-18 00:49:10,305 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 00:49:10,305 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-18 00:49:10,305 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-18 00:49:10,306 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:10,306 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-18 00:49:10,306 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:10,306 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-18 00:49:10,306 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-18 00:49:10,306 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:10,310 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:10,311 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:10,311 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:10,312 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:10,312 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:10,324 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-18 00:49:10,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:10 BoogieIcfgContainer [2020-07-18 00:49:10,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:10,344 INFO L168 Benchmark]: Toolchain (without parser) took 16517.07 ms. Allocated memory was 146.3 MB in the beginning and 334.0 MB in the end (delta: 187.7 MB). Free memory was 105.0 MB in the beginning and 169.2 MB in the end (delta: -64.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,345 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.17 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 94.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,346 INFO L168 Benchmark]: Boogie Preprocessor took 31.38 ms. Allocated memory is still 146.3 MB. Free memory was 94.9 MB in the beginning and 93.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,347 INFO L168 Benchmark]: RCFGBuilder took 467.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.4 MB in the beginning and 163.7 MB in the end (delta: -70.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,348 INFO L168 Benchmark]: TraceAbstraction took 15748.64 ms. Allocated memory was 203.9 MB in the beginning and 334.0 MB in the end (delta: 130.0 MB). Free memory was 163.0 MB in the beginning and 169.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:10,351 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.17 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 94.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.38 ms. Allocated memory is still 146.3 MB. Free memory was 94.9 MB in the beginning and 93.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.4 MB in the beginning and 163.7 MB in the end (delta: -70.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15748.64 ms. Allocated memory was 203.9 MB in the beginning and 334.0 MB in the end (delta: 130.0 MB). Free memory was 163.0 MB in the beginning and 169.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 123.9 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: 15.0s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 337 SDslu, 1049 SDs, 0 SdLazy, 902 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 79 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 80 PreInvPairs, 138 NumberOfFragments, 443 HoareAnnotationTreeSize, 80 FomulaSimplifications, 12758 FormulaSimplificationTreeSizeReduction, 0.2s 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...