java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:13:36,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:13:36,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:13:36,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:13:36,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:13:36,687 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:13:36,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:13:36,690 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:13:36,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:13:36,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:13:36,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:13:36,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:13:36,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:13:36,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:13:36,697 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:13:36,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:13:36,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:13:36,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:13:36,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:13:36,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:13:36,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:13:36,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:13:36,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:13:36,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:13:36,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:13:36,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:13:36,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:13:36,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:13:36,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:13:36,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:13:36,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:13:36,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:13:36,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:13:36,716 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:13:36,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:13:36,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:13:36,719 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:13:36,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:13:36,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:13:36,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:13:36,748 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:13:36,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:13:36,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:13:36,749 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:13:36,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:13:36,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:13:36,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:13:36,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:13:36,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:13:36,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:13:36,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:13:36,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:13:36,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:13:36,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:13:36,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:13:36,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:13:36,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:13:36,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:13:36,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:13:36,754 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:13:36,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:13:36,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:13:36,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:13:36,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:13:36,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:13:36,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:13:36,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:13:36,840 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:13:36,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:13:36,908 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49216bcb9/cda08f1491db469abe672ca8d26fba0b/FLAG61c995dbd [2018-11-23 13:13:37,376 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:13:37,377 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:13:37,383 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49216bcb9/cda08f1491db469abe672ca8d26fba0b/FLAG61c995dbd [2018-11-23 13:13:37,716 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49216bcb9/cda08f1491db469abe672ca8d26fba0b [2018-11-23 13:13:37,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:13:37,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:13:37,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:37,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:13:37,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:13:37,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:37" (1/1) ... [2018-11-23 13:13:37,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339f1d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:37, skipping insertion in model container [2018-11-23 13:13:37,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:37" (1/1) ... [2018-11-23 13:13:37,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:13:37,787 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:13:38,033 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:38,041 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:13:38,063 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:38,080 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:13:38,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38 WrapperNode [2018-11-23 13:13:38,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:38,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:38,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:13:38,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:13:38,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:38,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:13:38,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:13:38,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:13:38,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (1/1) ... [2018-11-23 13:13:38,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:13:38,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:13:38,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:13:38,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:13:38,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (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 [2018-11-23 13:13:38,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:13:38,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:13:38,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:13:38,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:13:38,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:13:38,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:13:38,690 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:13:38,690 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:13:38,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:38 BoogieIcfgContainer [2018-11-23 13:13:38,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:13:38,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:13:38,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:13:38,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:13:38,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:13:37" (1/3) ... [2018-11-23 13:13:38,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7981fc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:38, skipping insertion in model container [2018-11-23 13:13:38,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:38" (2/3) ... [2018-11-23 13:13:38,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7981fc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:38, skipping insertion in model container [2018-11-23 13:13:38,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:38" (3/3) ... [2018-11-23 13:13:38,700 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 13:13:38,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:13:38,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:13:38,737 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:13:38,772 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:13:38,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:13:38,773 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:13:38,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:13:38,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:13:38,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:13:38,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:13:38,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:13:38,774 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:13:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-23 13:13:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:13:38,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:38,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:38,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:38,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-23 13:13:38,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:38,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:38,896 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:38,897 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:38,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:38,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:38,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:39,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-23 13:13:39,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0;~__return_60~0 := 0; {19#true} is VALID [2018-11-23 13:13:39,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-23 13:13:39,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-23 13:13:39,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-23 13:13:39,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-23 13:13:39,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!(1 <= ~main__n~0); {42#(<= 1 main_~main__n~0)} is VALID [2018-11-23 13:13:39,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2018-11-23 13:13:39,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-23 13:13:39,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2018-11-23 13:13:39,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-23 13:13:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:39,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:13:39,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:13:39,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 13:13:39,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:39,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:13:39,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:39,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:13:39,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:13:39,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:13:39,309 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-23 13:13:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:40,017 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 13:13:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:13:40,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 13:13:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:13:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 13:13:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:13:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 13:13:40,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-23 13:13:40,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:40,109 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:13:40,109 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:13:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:13:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:13:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:13:40,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:40,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:40,161 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:40,161 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:40,165 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:13:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:40,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:40,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:40,166 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:40,166 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:13:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:40,169 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:13:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:40,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:40,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:40,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:40,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:13:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:13:40,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:13:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:40,175 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:13:40,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:13:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:13:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:13:40,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:40,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:40,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:40,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-23 13:13:40,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:40,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:40,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:40,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:40,189 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:40,190 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:40,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-23 13:13:40,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0;~__return_60~0 := 0; {132#true} is VALID [2018-11-23 13:13:40,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-23 13:13:40,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-23 13:13:40,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-23 13:13:40,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-23 13:13:40,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!(1 <= ~main__n~0); {155#(<= 1 main_~main__n~0)} is VALID [2018-11-23 13:13:40,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} is VALID [2018-11-23 13:13:40,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} is VALID [2018-11-23 13:13:40,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (= main_~main__sum~0 1) (<= main_~main__i~0 2) (<= 1 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:40,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-23 13:13:40,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-23 13:13:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:40,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:40,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 13:13:40,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:13:40,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:40,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:13:40,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:40,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:13:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:13:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:13:40,643 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:13:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,234 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:13:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:13:41,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:13:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-23 13:13:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-23 13:13:41,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2018-11-23 13:13:41,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:41,281 INFO L225 Difference]: With dead ends: 17 [2018-11-23 13:13:41,282 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:13:41,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:13:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:13:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:13:41,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:41,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:41,328 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:41,328 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,331 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:13:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:13:41,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:41,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:41,332 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:41,332 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,334 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:13:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:13:41,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:41,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:41,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:41,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:13:41,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:13:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:41,337 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:13:41,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:13:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:13:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:13:41,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:41,339 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:41,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 486647847, now seen corresponding path program 2 times [2018-11-23 13:13:41,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:41,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:41,355 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:41,356 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:41,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:41,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:41,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:41,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:41,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2018-11-23 13:13:41,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {248#true} ~__return_main~0 := 0;~__return_60~0 := 0; {248#true} is VALID [2018-11-23 13:13:41,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-23 13:13:41,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #28#return; {248#true} is VALID [2018-11-23 13:13:41,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret2 := main(); {248#true} is VALID [2018-11-23 13:13:41,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {248#true} is VALID [2018-11-23 13:13:41,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {248#true} assume !!(1 <= ~main__n~0); {248#true} is VALID [2018-11-23 13:13:41,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:41,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:41,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} is VALID [2018-11-23 13:13:41,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {282#(and (<= 2 main_~main__n~0) (<= main_~main__i~0 3) (= main_~main__sum~0 3))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {286#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:41,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {249#false} is VALID [2018-11-23 13:13:41,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {249#false} assume !false; {249#false} is VALID [2018-11-23 13:13:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:41,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:41,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 13:13:41,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:13:41,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:41,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:13:41,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:41,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:13:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:13:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:13:41,641 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-23 13:13:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,892 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:13:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:13:41,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:13:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-23 13:13:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-23 13:13:41,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-11-23 13:13:41,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:41,922 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:13:41,923 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:13:41,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:13:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:13:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:13:41,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:41,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:13:41,982 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:13:41,982 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:13:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,984 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:13:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:13:41,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:41,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:41,985 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:13:41,985 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:13:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:41,986 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:13:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:13:41,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:41,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:41,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:41,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:13:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:13:41,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:13:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:41,990 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:13:41,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:13:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:13:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:13:41,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:41,991 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:41,992 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:41,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 3 times [2018-11-23 13:13:41,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:41,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:41,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,006 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:42,006 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:42,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:42,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:42,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:13:42,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:42,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:42,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 13:13:42,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} ~__return_main~0 := 0;~__return_60~0 := 0; {373#true} is VALID [2018-11-23 13:13:42,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:13:42,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #28#return; {373#true} is VALID [2018-11-23 13:13:42,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-23 13:13:42,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {373#true} is VALID [2018-11-23 13:13:42,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(1 <= ~main__n~0); {373#true} is VALID [2018-11-23 13:13:42,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:42,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:42,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:42,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} is VALID [2018-11-23 13:13:42,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {411#(and (= main_~main__sum~0 6) (<= 3 main_~main__n~0) (<= main_~main__i~0 4))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {415#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:42,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {415#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {374#false} is VALID [2018-11-23 13:13:42,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 13:13:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:42,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:42,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 13:13:42,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-23 13:13:42,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:42,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:13:42,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:42,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:13:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:13:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:13:42,267 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2018-11-23 13:13:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,490 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:13:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:13:42,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-23 13:13:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-23 13:13:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-23 13:13:42,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2018-11-23 13:13:42,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:42,536 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:13:42,536 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:13:42,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:13:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:13:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:13:42,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:42,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:42,571 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:42,571 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,573 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:13:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:42,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:42,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:42,574 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:42,574 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:13:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,576 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:13:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:42,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:42,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:42,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:42,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:13:42,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:13:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:42,579 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:13:42,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:13:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:13:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:13:42,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:42,580 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:42,580 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:42,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -484853433, now seen corresponding path program 4 times [2018-11-23 13:13:42,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,595 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:42,596 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:42,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:42,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:42,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:42,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:42,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-23 13:13:42,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} ~__return_main~0 := 0;~__return_60~0 := 0; {508#true} is VALID [2018-11-23 13:13:42,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-23 13:13:42,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #28#return; {508#true} is VALID [2018-11-23 13:13:42,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret2 := main(); {508#true} is VALID [2018-11-23 13:13:42,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {508#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {508#true} is VALID [2018-11-23 13:13:42,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {508#true} assume !!(1 <= ~main__n~0); {508#true} is VALID [2018-11-23 13:13:42,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {508#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:42,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {534#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:42,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:42,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:42,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} is VALID [2018-11-23 13:13:42,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#(and (<= 4 main_~main__n~0) (= main_~main__sum~0 10) (<= main_~main__i~0 5))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {554#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:42,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {554#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {509#false} is VALID [2018-11-23 13:13:42,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-23 13:13:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 13:13:42,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:13:42,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:42,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:13:42,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:42,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:13:42,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:13:42,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:13:43,000 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-23 13:13:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:43,293 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:13:43,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:13:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:13:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 13:13:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:13:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 13:13:43,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-23 13:13:43,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:43,382 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:13:43,382 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:13:43,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:13:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:13:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:13:43,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:43,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:13:43,403 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:13:43,403 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:13:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:43,405 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:13:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:13:43,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:43,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:43,406 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:13:43,406 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:13:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:43,409 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:13:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:13:43,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:43,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:43,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:43,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:13:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:13:43,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 13:13:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:43,416 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:13:43,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:13:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:13:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:13:43,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:43,417 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:43,418 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:43,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2145617008, now seen corresponding path program 5 times [2018-11-23 13:13:43,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:43,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:43,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:43,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:43,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:43,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:43,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:43,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:43,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:43,475 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:13:43,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:43,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:43,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2018-11-23 13:13:43,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {653#true} ~__return_main~0 := 0;~__return_60~0 := 0; {653#true} is VALID [2018-11-23 13:13:43,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2018-11-23 13:13:43,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #28#return; {653#true} is VALID [2018-11-23 13:13:43,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret2 := main(); {653#true} is VALID [2018-11-23 13:13:43,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2018-11-23 13:13:43,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#true} assume !!(1 <= ~main__n~0); {653#true} is VALID [2018-11-23 13:13:43,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:43,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:43,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:43,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:43,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:43,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} is VALID [2018-11-23 13:13:43,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {703#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:43,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {703#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {654#false} is VALID [2018-11-23 13:13:43,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {654#false} assume !false; {654#false} is VALID [2018-11-23 13:13:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:43,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 13:13:43,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 13:13:43,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:43,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:13:43,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:13:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:13:43,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:13:43,755 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-11-23 13:13:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:44,210 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:13:44,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:13:44,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 13:13:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:13:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:13:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:13:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:13:44,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-23 13:13:44,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:44,252 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:13:44,252 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:13:44,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:13:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:13:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:13:44,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:44,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:44,301 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:44,301 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:44,303 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:13:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:44,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:44,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:44,304 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:44,304 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:13:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:44,305 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:13:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:44,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:44,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:44,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:44,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:13:44,308 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 13:13:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:44,308 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:13:44,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:13:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:13:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:13:44,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:44,310 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:44,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:44,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2089680281, now seen corresponding path program 6 times [2018-11-23 13:13:44,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:44,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:44,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:44,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:44,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:44,325 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:44,325 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:44,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:44,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:13:44,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:44,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:44,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 13:13:44,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} ~__return_main~0 := 0;~__return_60~0 := 0; {808#true} is VALID [2018-11-23 13:13:44,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 13:13:44,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #28#return; {808#true} is VALID [2018-11-23 13:13:44,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret2 := main(); {808#true} is VALID [2018-11-23 13:13:44,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {808#true} is VALID [2018-11-23 13:13:44,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {808#true} assume !!(1 <= ~main__n~0); {808#true} is VALID [2018-11-23 13:13:44,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {808#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:44,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:44,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {838#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:44,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {842#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:44,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:44,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {850#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:44,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} is VALID [2018-11-23 13:13:44,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {858#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {862#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:44,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {862#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {809#false} is VALID [2018-11-23 13:13:44,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 13:13:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:44,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:44,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 13:13:44,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 13:13:44,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:44,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:13:44,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:44,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:13:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:13:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:13:44,666 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-23 13:13:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:45,051 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:13:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:13:45,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 13:13:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:13:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-23 13:13:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:13:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-23 13:13:45,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2018-11-23 13:13:45,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:45,083 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:13:45,083 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:13:45,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:13:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:13:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:13:45,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:45,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:13:45,111 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:13:45,112 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:13:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:45,114 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:13:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:13:45,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:45,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:45,115 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:13:45,115 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:13:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:45,116 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:13:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:13:45,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:45,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:45,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:45,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:13:45,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 13:13:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:13:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:13:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:13:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:13:45,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:45,121 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:45,121 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:45,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -355641744, now seen corresponding path program 7 times [2018-11-23 13:13:45,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:45,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:45,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:45,135 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:45,136 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:45,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:45,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:45,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2018-11-23 13:13:45,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {973#true} ~__return_main~0 := 0;~__return_60~0 := 0; {973#true} is VALID [2018-11-23 13:13:45,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {973#true} assume true; {973#true} is VALID [2018-11-23 13:13:45,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {973#true} {973#true} #28#return; {973#true} is VALID [2018-11-23 13:13:45,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret2 := main(); {973#true} is VALID [2018-11-23 13:13:45,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {973#true} is VALID [2018-11-23 13:13:45,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {973#true} assume !!(1 <= ~main__n~0); {973#true} is VALID [2018-11-23 13:13:45,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:45,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:45,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:45,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {1007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:45,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {1011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:45,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {1015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:45,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {1019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:45,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {1023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:45,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1031#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:45,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {1031#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {974#false} is VALID [2018-11-23 13:13:45,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {974#false} assume !false; {974#false} is VALID [2018-11-23 13:13:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:45,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:45,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 13:13:45,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:13:45,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:45,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:13:45,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:13:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:13:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:13:45,546 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-11-23 13:13:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:46,020 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:13:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:13:46,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:13:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:13:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-23 13:13:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:13:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-23 13:13:46,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-23 13:13:46,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:46,079 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:13:46,079 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:13:46,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:13:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:13:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:13:46,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:46,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:46,129 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:46,129 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:46,130 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:46,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:46,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:46,131 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:46,132 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:13:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:46,133 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:13:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:46,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:46,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:46,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:46,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:13:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:13:46,136 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-23 13:13:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:46,136 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:13:46,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:13:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:13:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:13:46,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:46,137 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:46,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 8 times [2018-11-23 13:13:46,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:46,151 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:46,151 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:46,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:46,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:46,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:46,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:46,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {1148#true} call ULTIMATE.init(); {1148#true} is VALID [2018-11-23 13:13:46,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {1148#true} ~__return_main~0 := 0;~__return_60~0 := 0; {1148#true} is VALID [2018-11-23 13:13:46,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {1148#true} assume true; {1148#true} is VALID [2018-11-23 13:13:46,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1148#true} {1148#true} #28#return; {1148#true} is VALID [2018-11-23 13:13:46,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {1148#true} call #t~ret2 := main(); {1148#true} is VALID [2018-11-23 13:13:46,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {1148#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1148#true} is VALID [2018-11-23 13:13:46,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {1148#true} assume !!(1 <= ~main__n~0); {1148#true} is VALID [2018-11-23 13:13:46,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {1148#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:46,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:46,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:46,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {1182#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:46,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {1186#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:46,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {1190#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:46,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:46,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {1198#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:46,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:46,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {1206#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1210#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:46,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {1210#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1149#false} is VALID [2018-11-23 13:13:46,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {1149#false} assume !false; {1149#false} is VALID [2018-11-23 13:13:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:46,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 13:13:46,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 13:13:46,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:46,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:13:46,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:46,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:13:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:13:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:13:46,664 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-23 13:13:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:47,404 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:13:47,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:13:47,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 13:13:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:13:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-23 13:13:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:13:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-23 13:13:47,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2018-11-23 13:13:47,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:47,437 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:13:47,437 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:13:47,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:13:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:13:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:13:47,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:47,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:13:47,465 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:13:47,465 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:13:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:47,467 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:13:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:13:47,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:47,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:47,468 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:13:47,468 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:13:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:47,469 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:13:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:13:47,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:47,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:47,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:47,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:13:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:13:47,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-23 13:13:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:47,470 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:13:47,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:13:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:13:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:13:47,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:47,471 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:47,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:47,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1823668560, now seen corresponding path program 9 times [2018-11-23 13:13:47,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:47,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:47,484 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:47,484 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:47,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:47,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:47,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:13:47,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:47,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:47,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 13:13:47,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} ~__return_main~0 := 0;~__return_60~0 := 0; {1333#true} is VALID [2018-11-23 13:13:47,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 13:13:47,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #28#return; {1333#true} is VALID [2018-11-23 13:13:47,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret2 := main(); {1333#true} is VALID [2018-11-23 13:13:47,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1333#true} is VALID [2018-11-23 13:13:47,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !!(1 <= ~main__n~0); {1333#true} is VALID [2018-11-23 13:13:47,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:47,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {1359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:47,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:47,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {1367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:47,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {1371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:47,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {1375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:47,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {1379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:47,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {1383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:47,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {1387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:47,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {1391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2018-11-23 13:13:47,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {1395#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1399#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:47,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {1399#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1334#false} is VALID [2018-11-23 13:13:47,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 13:13:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 13:13:47,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-23 13:13:47,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:47,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:13:47,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:47,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:13:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:13:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:13:47,858 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-11-23 13:13:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:48,514 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:13:48,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:13:48,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-23 13:13:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:13:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-23 13:13:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:13:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-23 13:13:48,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2018-11-23 13:13:48,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:48,544 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:13:48,544 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:13:48,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:13:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:13:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:13:48,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:48,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:48,591 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:48,592 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:48,593 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:13:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:48,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:48,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:48,594 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:48,594 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:13:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:48,595 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:13:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:48,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:48,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:48,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:48,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:13:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:13:48,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-23 13:13:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:48,597 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:13:48,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:13:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:13:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:13:48,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:48,599 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:48,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:48,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 699088039, now seen corresponding path program 10 times [2018-11-23 13:13:48,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:48,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:48,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:48,625 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:48,626 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:48,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:48,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:48,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:48,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:48,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:48,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {1528#true} call ULTIMATE.init(); {1528#true} is VALID [2018-11-23 13:13:48,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {1528#true} ~__return_main~0 := 0;~__return_60~0 := 0; {1528#true} is VALID [2018-11-23 13:13:48,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {1528#true} assume true; {1528#true} is VALID [2018-11-23 13:13:48,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1528#true} {1528#true} #28#return; {1528#true} is VALID [2018-11-23 13:13:48,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {1528#true} call #t~ret2 := main(); {1528#true} is VALID [2018-11-23 13:13:48,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {1528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1528#true} is VALID [2018-11-23 13:13:48,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {1528#true} assume !!(1 <= ~main__n~0); {1528#true} is VALID [2018-11-23 13:13:48,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {1528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:48,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {1554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:48,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {1558#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:48,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {1562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:48,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {1566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:48,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:48,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:48,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {1578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:48,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {1582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:48,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:48,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {1590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} is VALID [2018-11-23 13:13:48,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {1594#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1598#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:48,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {1598#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1529#false} is VALID [2018-11-23 13:13:48,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {1529#false} assume !false; {1529#false} is VALID [2018-11-23 13:13:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:49,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:49,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 13:13:49,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 13:13:49,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:49,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:13:49,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:13:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:13:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:13:49,024 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-11-23 13:13:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:49,550 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:13:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:13:49,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 13:13:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-23 13:13:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-23 13:13:49,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2018-11-23 13:13:49,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:49,617 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:13:49,617 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:13:49,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:13:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:13:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:13:49,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:49,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:13:49,656 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:13:49,656 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:13:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:49,657 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:13:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:13:49,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:49,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:49,658 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:13:49,658 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:13:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:49,659 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:13:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:13:49,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:49,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:49,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:49,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:13:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:13:49,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-23 13:13:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:49,661 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:13:49,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:13:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:13:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:13:49,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:49,662 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:49,662 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:49,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 196830256, now seen corresponding path program 11 times [2018-11-23 13:13:49,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:49,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:49,674 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:49,674 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:49,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:49,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:49,707 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:13:49,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:49,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:49,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2018-11-23 13:13:49,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {1733#true} ~__return_main~0 := 0;~__return_60~0 := 0; {1733#true} is VALID [2018-11-23 13:13:49,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2018-11-23 13:13:49,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #28#return; {1733#true} is VALID [2018-11-23 13:13:49,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret2 := main(); {1733#true} is VALID [2018-11-23 13:13:49,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {1733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1733#true} is VALID [2018-11-23 13:13:49,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {1733#true} assume !!(1 <= ~main__n~0); {1733#true} is VALID [2018-11-23 13:13:49,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:49,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {1759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:49,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {1763#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:49,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {1767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:49,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:49,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {1775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:49,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {1779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:49,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:49,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {1787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:49,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {1791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:49,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {1795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:49,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {1799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2018-11-23 13:13:50,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {1803#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1807#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:50,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1734#false} is VALID [2018-11-23 13:13:50,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2018-11-23 13:13:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-23 13:13:50,023 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:13:50,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:50,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:13:50,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:50,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:13:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:13:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:13:50,044 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-11-23 13:13:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:50,860 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:13:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:13:50,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:13:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:13:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-23 13:13:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:13:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-23 13:13:50,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-23 13:13:50,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:50,962 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:13:50,962 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:13:50,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:13:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:13:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:13:51,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:51,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:51,008 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:51,009 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:51,010 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:13:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:51,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:51,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:51,011 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:51,011 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:13:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:51,012 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:13:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:51,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:51,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:51,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:51,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:13:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:13:51,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-23 13:13:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:51,014 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:13:51,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:13:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:13:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:13:51,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:51,015 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:51,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:51,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1806708167, now seen corresponding path program 12 times [2018-11-23 13:13:51,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:51,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:51,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:51,027 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:51,027 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:51,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:51,073 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:13:51,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:51,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:53,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-23 13:13:53,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} ~__return_main~0 := 0;~__return_60~0 := 0; {1948#true} is VALID [2018-11-23 13:13:53,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-23 13:13:53,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #28#return; {1948#true} is VALID [2018-11-23 13:13:53,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret2 := main(); {1948#true} is VALID [2018-11-23 13:13:53,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1948#true} is VALID [2018-11-23 13:13:53,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {1948#true} assume !!(1 <= ~main__n~0); {1948#true} is VALID [2018-11-23 13:13:53,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {1948#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:53,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1974#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:13:53,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:53,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:53,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1986#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:53,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {1990#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:53,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {1994#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:53,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {1998#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:53,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {2002#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:53,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {2006#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:53,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2010#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:53,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {2014#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:13:53,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} is VALID [2018-11-23 13:13:53,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {2022#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2026#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:53,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {2026#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {1949#false} is VALID [2018-11-23 13:13:53,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-23 13:13:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:53,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:53,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-23 13:13:53,252 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 13:13:53,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:53,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:13:53,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:53,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:13:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:13:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:13:53,283 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-23 13:13:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:54,083 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:13:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:13:54,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 13:13:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-23 13:13:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-23 13:13:54,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2018-11-23 13:13:54,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:54,119 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:13:54,119 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:13:54,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:13:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:13:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:13:54,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:54,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:13:54,318 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:13:54,318 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:13:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:54,319 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:13:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:13:54,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:54,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:54,320 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:13:54,321 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:13:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:54,322 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:13:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:13:54,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:54,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:54,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:54,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:13:54,323 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-23 13:13:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:54,323 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:13:54,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:13:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:13:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:13:54,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:54,324 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:54,324 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:54,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 173315856, now seen corresponding path program 13 times [2018-11-23 13:13:54,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:54,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:54,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:54,337 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:54,337 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:54,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-23 13:13:54,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} ~__return_main~0 := 0;~__return_60~0 := 0; {2173#true} is VALID [2018-11-23 13:13:54,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-23 13:13:54,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #28#return; {2173#true} is VALID [2018-11-23 13:13:54,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret2 := main(); {2173#true} is VALID [2018-11-23 13:13:54,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2173#true} is VALID [2018-11-23 13:13:54,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !!(1 <= ~main__n~0); {2173#true} is VALID [2018-11-23 13:13:54,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {2173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:54,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {2199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:54,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {2203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:54,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:54,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:54,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {2215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:54,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {2219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:54,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {2223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:54,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {2227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:54,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {2231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:54,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {2235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:54,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {2239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:13:54,786 INFO L273 TraceCheckUtils]: 19: Hoare triple {2243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:13:54,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {2247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} is VALID [2018-11-23 13:13:54,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {2251#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2255#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:54,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {2255#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2174#false} is VALID [2018-11-23 13:13:54,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-23 13:13:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:54,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:54,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-23 13:13:54,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 13:13:54,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:54,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:13:54,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:54,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:13:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:13:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:13:54,832 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2018-11-23 13:13:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:55,547 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:13:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:13:55,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 13:13:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:13:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-23 13:13:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:13:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-23 13:13:55,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2018-11-23 13:13:55,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:55,575 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:13:55,575 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:13:55,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:13:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:13:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:13:55,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:55,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:55,632 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:55,632 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:55,633 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:13:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:55,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:55,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:55,634 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:55,634 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:13:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:55,635 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:13:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:55,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:55,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:55,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:55,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:13:55,636 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-23 13:13:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:55,636 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:13:55,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:13:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:13:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:13:55,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:55,637 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:55,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:55,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1077761767, now seen corresponding path program 14 times [2018-11-23 13:13:55,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:55,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:55,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:55,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:55,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:55,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:55,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:55,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:56,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2018-11-23 13:13:56,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {2408#true} ~__return_main~0 := 0;~__return_60~0 := 0; {2408#true} is VALID [2018-11-23 13:13:56,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2018-11-23 13:13:56,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #28#return; {2408#true} is VALID [2018-11-23 13:13:56,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret2 := main(); {2408#true} is VALID [2018-11-23 13:13:56,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2408#true} is VALID [2018-11-23 13:13:56,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {2408#true} assume !!(1 <= ~main__n~0); {2408#true} is VALID [2018-11-23 13:13:56,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {2408#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:56,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {2434#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:56,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {2438#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:56,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {2442#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:56,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {2446#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:56,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:56,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {2454#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:56,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {2458#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:56,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {2462#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:56,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {2466#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:56,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {2470#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:56,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {2474#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:13:56,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {2478#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:13:56,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {2482#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:13:56,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {2486#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} is VALID [2018-11-23 13:13:56,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {2490#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2494#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:56,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {2494#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2409#false} is VALID [2018-11-23 13:13:56,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {2409#false} assume !false; {2409#false} is VALID [2018-11-23 13:13:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:56,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:56,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-23 13:13:56,118 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-23 13:13:56,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:56,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:13:56,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:56,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:13:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:13:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:13:56,158 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-23 13:13:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:56,979 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:13:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:13:56,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-23 13:13:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-23 13:13:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-23 13:13:56,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2018-11-23 13:13:57,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:57,012 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:13:57,012 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:13:57,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:13:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 13:13:57,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:57,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 13:13:57,063 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:13:57,063 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:13:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:57,065 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:13:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:13:57,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:57,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:57,066 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:13:57,066 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:13:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:57,066 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:13:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:13:57,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:57,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:57,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:57,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:13:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:13:57,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 13:13:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:57,068 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:13:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:13:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:13:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:13:57,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:57,069 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:57,070 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:57,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -949186064, now seen corresponding path program 15 times [2018-11-23 13:13:57,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:57,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:57,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:57,081 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:57,081 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:57,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:57,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:57,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:13:57,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:57,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:57,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {2653#true} call ULTIMATE.init(); {2653#true} is VALID [2018-11-23 13:13:57,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {2653#true} ~__return_main~0 := 0;~__return_60~0 := 0; {2653#true} is VALID [2018-11-23 13:13:57,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {2653#true} assume true; {2653#true} is VALID [2018-11-23 13:13:57,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2653#true} {2653#true} #28#return; {2653#true} is VALID [2018-11-23 13:13:57,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {2653#true} call #t~ret2 := main(); {2653#true} is VALID [2018-11-23 13:13:57,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {2653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2653#true} is VALID [2018-11-23 13:13:57,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {2653#true} assume !!(1 <= ~main__n~0); {2653#true} is VALID [2018-11-23 13:13:57,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {2653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:57,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {2679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:57,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {2683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:57,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {2687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:57,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {2691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:57,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {2695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:57,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {2699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:57,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {2703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:57,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:57,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {2711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:57,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {2715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:57,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {2719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:13:57,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {2723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:13:57,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {2727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:13:57,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {2731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:13:57,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {2735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} is VALID [2018-11-23 13:13:57,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {2739#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2743#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:57,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {2743#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2654#false} is VALID [2018-11-23 13:13:57,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {2654#false} assume !false; {2654#false} is VALID [2018-11-23 13:13:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-23 13:13:57,740 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-23 13:13:57,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:57,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:13:57,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:57,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:13:57,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:13:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:57,764 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-23 13:13:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,833 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:13:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:13:58,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-23 13:13:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-23 13:13:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-23 13:13:58,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2018-11-23 13:13:58,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:58,865 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:13:58,866 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:13:58,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:13:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:13:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:13:58,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:58,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:58,914 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:58,914 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,915 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:13:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:58,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:58,916 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:58,916 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:13:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,917 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:13:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:58,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:58,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:58,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:58,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:13:58,919 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-23 13:13:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:58,919 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:13:58,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:13:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:13:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:13:58,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:58,920 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:58,921 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:58,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 639940615, now seen corresponding path program 16 times [2018-11-23 13:13:58,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:58,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:13:58,932 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:13:58,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:13:58,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:59,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:59,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:59,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:59,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2018-11-23 13:13:59,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {2908#true} ~__return_main~0 := 0;~__return_60~0 := 0; {2908#true} is VALID [2018-11-23 13:13:59,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {2908#true} assume true; {2908#true} is VALID [2018-11-23 13:13:59,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2908#true} {2908#true} #28#return; {2908#true} is VALID [2018-11-23 13:13:59,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {2908#true} call #t~ret2 := main(); {2908#true} is VALID [2018-11-23 13:13:59,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {2908#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2908#true} is VALID [2018-11-23 13:13:59,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {2908#true} assume !!(1 <= ~main__n~0); {2908#true} is VALID [2018-11-23 13:13:59,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {2908#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:13:59,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {2934#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:13:59,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {2938#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:13:59,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {2942#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:13:59,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {2946#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:13:59,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {2950#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:13:59,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {2954#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:13:59,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {2958#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:13:59,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {2962#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:13:59,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {2966#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:13:59,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {2970#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:13:59,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {2974#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:13:59,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {2978#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:13:59,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {2982#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:13:59,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {2986#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:13:59,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {2990#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:13:59,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {2994#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2018-11-23 13:13:59,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {2998#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3002#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:13:59,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {3002#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {2909#false} is VALID [2018-11-23 13:13:59,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2018-11-23 13:13:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:59,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:13:59,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-23 13:13:59,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 13:13:59,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:59,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:13:59,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:59,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:13:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:13:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:13:59,592 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-11-23 13:14:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:01,072 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:14:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:14:01,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 13:14:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:14:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-23 13:14:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:14:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-23 13:14:01,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2018-11-23 13:14:01,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:01,110 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:14:01,111 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:14:01,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:14:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:14:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:14:01,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:01,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:14:01,173 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:14:01,173 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:14:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:01,174 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:14:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:14:01,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:01,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:01,175 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:14:01,175 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:14:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:01,176 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:14:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:14:01,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:01,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:01,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:01,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:14:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:14:01,177 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-23 13:14:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:01,178 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:14:01,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:14:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:14:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:14:01,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:01,178 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:01,179 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:01,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1636739888, now seen corresponding path program 17 times [2018-11-23 13:14:01,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:01,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:01,191 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:01,191 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:01,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:01,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:14:01,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 13:14:01,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:01,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:02,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {3173#true} call ULTIMATE.init(); {3173#true} is VALID [2018-11-23 13:14:02,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {3173#true} ~__return_main~0 := 0;~__return_60~0 := 0; {3173#true} is VALID [2018-11-23 13:14:02,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {3173#true} assume true; {3173#true} is VALID [2018-11-23 13:14:02,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3173#true} {3173#true} #28#return; {3173#true} is VALID [2018-11-23 13:14:02,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {3173#true} call #t~ret2 := main(); {3173#true} is VALID [2018-11-23 13:14:02,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3173#true} is VALID [2018-11-23 13:14:02,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {3173#true} assume !!(1 <= ~main__n~0); {3173#true} is VALID [2018-11-23 13:14:02,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {3173#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:02,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {3199#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:02,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {3203#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:02,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {3207#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:02,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {3211#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:02,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {3215#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:02,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {3219#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:02,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {3223#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:02,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {3227#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:02,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {3231#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:02,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {3235#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:02,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:02,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:02,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {3247#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:02,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {3251#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:02,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:02,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {3259#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:02,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} is VALID [2018-11-23 13:14:02,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {3267#(and (<= main_~main__i~0 18) (= main_~main__sum~0 153) (<= 17 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3271#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:02,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {3271#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3174#false} is VALID [2018-11-23 13:14:02,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {3174#false} assume !false; {3174#false} is VALID [2018-11-23 13:14:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:02,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:02,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-11-23 13:14:02,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-23 13:14:02,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:02,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:14:02,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:02,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:14:02,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:14:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:14:02,299 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 21 states. [2018-11-23 13:14:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,423 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:14:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:14:03,424 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-23 13:14:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:14:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-23 13:14:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:14:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2018-11-23 13:14:03,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2018-11-23 13:14:03,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:03,463 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:14:03,463 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:14:03,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:14:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:14:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:14:03,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:03,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:14:03,649 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:14:03,649 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:14:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,651 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:14:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:14:03,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:03,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:03,651 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:14:03,651 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:14:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:03,652 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:14:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:14:03,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:03,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:03,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:03,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:14:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:14:03,653 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-23 13:14:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:03,653 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:14:03,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:14:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:14:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:14:03,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:03,654 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:03,654 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:03,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 18 times [2018-11-23 13:14:03,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:03,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:03,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:03,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:03,666 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:03,666 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:03,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:03,682 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:14:03,720 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 13:14:03,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:03,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:04,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {3448#true} call ULTIMATE.init(); {3448#true} is VALID [2018-11-23 13:14:04,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {3448#true} ~__return_main~0 := 0;~__return_60~0 := 0; {3448#true} is VALID [2018-11-23 13:14:04,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {3448#true} assume true; {3448#true} is VALID [2018-11-23 13:14:04,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3448#true} {3448#true} #28#return; {3448#true} is VALID [2018-11-23 13:14:04,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {3448#true} call #t~ret2 := main(); {3448#true} is VALID [2018-11-23 13:14:04,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {3448#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3448#true} is VALID [2018-11-23 13:14:04,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {3448#true} assume !!(1 <= ~main__n~0); {3448#true} is VALID [2018-11-23 13:14:04,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {3448#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:04,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:04,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {3478#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:04,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {3482#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:04,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {3486#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:04,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {3490#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:04,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {3494#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:04,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {3498#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:04,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {3502#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:04,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {3506#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:04,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {3510#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:04,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {3514#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:04,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {3518#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:04,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {3522#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:04,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {3526#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:04,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {3530#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:04,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {3534#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:04,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {3538#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:04,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {3542#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:04,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {3546#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3550#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:04,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {3550#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3449#false} is VALID [2018-11-23 13:14:04,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {3449#false} assume !false; {3449#false} is VALID [2018-11-23 13:14:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-23 13:14:04,229 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-23 13:14:04,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:04,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:14:04,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:04,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:14:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:14:04,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:14:04,254 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-11-23 13:14:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:05,449 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:14:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:14:05,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-23 13:14:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:14:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-23 13:14:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:14:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-23 13:14:05,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2018-11-23 13:14:05,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:05,894 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:14:05,895 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:14:05,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:14:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:14:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 13:14:06,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:06,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 13:14:06,002 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:14:06,002 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:14:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:06,003 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:14:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:14:06,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:06,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:06,004 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:14:06,004 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:14:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:06,005 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:14:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:14:06,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:06,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:06,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:06,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:14:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:14:06,006 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-23 13:14:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:06,006 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:14:06,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:14:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:14:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:14:06,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:06,007 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:06,007 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:06,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:06,007 INFO L82 PathProgramCache]: Analyzing trace with hash -951001168, now seen corresponding path program 19 times [2018-11-23 13:14:06,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:06,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:06,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:06,020 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:06,020 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:06,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:06,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:06,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3733#true} is VALID [2018-11-23 13:14:06,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {3733#true} ~__return_main~0 := 0;~__return_60~0 := 0; {3733#true} is VALID [2018-11-23 13:14:06,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2018-11-23 13:14:06,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #28#return; {3733#true} is VALID [2018-11-23 13:14:06,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret2 := main(); {3733#true} is VALID [2018-11-23 13:14:06,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {3733#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3733#true} is VALID [2018-11-23 13:14:06,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {3733#true} assume !!(1 <= ~main__n~0); {3733#true} is VALID [2018-11-23 13:14:06,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {3733#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:06,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:06,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {3763#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:06,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {3767#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:06,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {3771#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:06,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {3775#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:06,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {3779#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:06,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {3783#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:06,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {3787#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:06,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {3791#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:06,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {3795#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:06,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {3799#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:06,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {3803#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:06,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {3807#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:06,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {3811#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:06,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {3815#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:06,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {3819#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:06,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {3823#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:06,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {3827#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:06,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {3831#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} is VALID [2018-11-23 13:14:06,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {3835#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3839#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:06,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {3839#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {3734#false} is VALID [2018-11-23 13:14:06,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2018-11-23 13:14:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:06,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:06,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-23 13:14:06,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-23 13:14:06,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:06,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:14:06,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:06,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:14:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:14:06,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:14:06,665 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2018-11-23 13:14:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:08,485 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:14:08,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:14:08,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-23 13:14:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:14:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-23 13:14:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:14:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-23 13:14:08,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2018-11-23 13:14:08,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:08,544 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:14:08,544 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:14:08,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:14:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:14:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:14:08,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:08,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:14:08,644 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:14:08,645 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:14:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:08,646 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:14:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:14:08,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:08,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:08,646 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:14:08,647 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:14:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:08,647 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:14:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:14:08,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:08,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:08,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:08,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:14:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:14:08,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-23 13:14:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:08,649 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:14:08,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:14:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:14:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:14:08,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:08,650 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:08,650 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:08,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash 583672391, now seen corresponding path program 20 times [2018-11-23 13:14:08,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:08,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:08,662 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:08,662 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:08,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:08,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:08,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:08,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:08,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:09,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {4028#true} call ULTIMATE.init(); {4028#true} is VALID [2018-11-23 13:14:09,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {4028#true} ~__return_main~0 := 0;~__return_60~0 := 0; {4028#true} is VALID [2018-11-23 13:14:09,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {4028#true} assume true; {4028#true} is VALID [2018-11-23 13:14:09,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4028#true} {4028#true} #28#return; {4028#true} is VALID [2018-11-23 13:14:09,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {4028#true} call #t~ret2 := main(); {4028#true} is VALID [2018-11-23 13:14:09,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {4028#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4028#true} is VALID [2018-11-23 13:14:09,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {4028#true} assume !!(1 <= ~main__n~0); {4028#true} is VALID [2018-11-23 13:14:09,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {4028#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:09,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {4054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:09,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {4058#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:09,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {4062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:09,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {4066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:09,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {4070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:09,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {4074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:09,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {4078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:09,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {4082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:09,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {4086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:09,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {4090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:09,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {4094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:09,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {4098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:09,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {4102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:09,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:09,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {4110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:09,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:09,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {4118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:09,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {4122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:09,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {4126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:09,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {4130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2018-11-23 13:14:09,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {4134#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4138#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:09,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {4138#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4029#false} is VALID [2018-11-23 13:14:09,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2018-11-23 13:14:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:09,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-23 13:14:09,916 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-23 13:14:09,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:09,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:14:09,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:09,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:14:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:14:09,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:14:09,945 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-11-23 13:14:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:11,494 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:14:11,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:14:11,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-23 13:14:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:14:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-23 13:14:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:14:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-23 13:14:11,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2018-11-23 13:14:11,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:11,530 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:14:11,530 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:14:11,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:14:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:14:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:14:11,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:11,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 13:14:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:14:11,614 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:14:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:11,615 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:14:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:14:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:11,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:11,616 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:14:11,616 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:14:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:11,617 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:14:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:14:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:11,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:11,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:14:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:14:11,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-23 13:14:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:14:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:14:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:14:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:14:11,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:11,619 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:11,620 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:11,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 913912464, now seen corresponding path program 21 times [2018-11-23 13:14:11,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:11,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:11,630 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:11,630 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:11,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:11,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 13:14:11,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:11,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:12,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-23 13:14:12,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} ~__return_main~0 := 0;~__return_60~0 := 0; {4333#true} is VALID [2018-11-23 13:14:12,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-23 13:14:12,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #28#return; {4333#true} is VALID [2018-11-23 13:14:12,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret2 := main(); {4333#true} is VALID [2018-11-23 13:14:12,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4333#true} is VALID [2018-11-23 13:14:12,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(1 <= ~main__n~0); {4333#true} is VALID [2018-11-23 13:14:12,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:12,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {4359#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:12,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {4363#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:12,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {4367#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:12,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {4371#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:12,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {4375#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:12,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {4379#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:12,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {4383#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:12,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {4387#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:12,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {4391#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:12,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {4395#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:12,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {4399#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:12,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {4403#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:12,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {4407#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:12,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {4411#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:12,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {4415#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:12,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {4419#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:12,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {4423#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:12,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {4427#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:12,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {4431#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:12,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {4435#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:12,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {4439#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} is VALID [2018-11-23 13:14:12,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4447#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:12,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {4447#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4334#false} is VALID [2018-11-23 13:14:12,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-23 13:14:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:12,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:12,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-23 13:14:12,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-23 13:14:12,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:12,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:14:12,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:12,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:14:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:14:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:14:12,616 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2018-11-23 13:14:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:14,269 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:14:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:14:14,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-23 13:14:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:14:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-23 13:14:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:14:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-23 13:14:14,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2018-11-23 13:14:14,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:14,326 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:14:14,326 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:14:14,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:14:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:14:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:14:14,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:14,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 13:14:14,400 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:14:14,400 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:14:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:14,401 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:14:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:14:14,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:14,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:14,402 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:14:14,402 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:14:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:14,402 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:14:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:14:14,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:14,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:14,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:14,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:14:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 13:14:14,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-23 13:14:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:14,404 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 13:14:14,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:14:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:14:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:14:14,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:14,405 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:14,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:14,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1733547161, now seen corresponding path program 22 times [2018-11-23 13:14:14,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:14,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:14,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:14,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:14,415 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:14,416 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:14,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:14,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:14:14,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:14:14,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:14,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:15,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {4648#true} call ULTIMATE.init(); {4648#true} is VALID [2018-11-23 13:14:15,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {4648#true} ~__return_main~0 := 0;~__return_60~0 := 0; {4648#true} is VALID [2018-11-23 13:14:15,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {4648#true} assume true; {4648#true} is VALID [2018-11-23 13:14:15,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4648#true} {4648#true} #28#return; {4648#true} is VALID [2018-11-23 13:14:15,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {4648#true} call #t~ret2 := main(); {4648#true} is VALID [2018-11-23 13:14:15,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {4648#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4648#true} is VALID [2018-11-23 13:14:15,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {4648#true} assume !!(1 <= ~main__n~0); {4648#true} is VALID [2018-11-23 13:14:15,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {4648#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:15,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:15,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {4678#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:15,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {4682#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:15,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {4686#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:15,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {4690#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:15,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {4694#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:15,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {4698#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:15,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {4702#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:15,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {4706#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:15,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {4710#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:15,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {4714#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:15,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {4718#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:15,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {4722#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:15,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {4726#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:15,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {4730#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:15,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {4734#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:15,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {4738#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:15,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {4742#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:15,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {4746#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:15,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {4750#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:15,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {4754#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:15,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {4758#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:15,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {4762#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4766#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:15,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {4766#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4649#false} is VALID [2018-11-23 13:14:15,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {4649#false} assume !false; {4649#false} is VALID [2018-11-23 13:14:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-23 13:14:15,405 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-23 13:14:15,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:15,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:14:15,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:15,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:14:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:14:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:14:15,436 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2018-11-23 13:14:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:17,090 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:14:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:14:17,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-23 13:14:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:14:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-23 13:14:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:14:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-23 13:14:17,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2018-11-23 13:14:17,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:17,582 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:14:17,582 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:14:17,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:14:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:14:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 13:14:18,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:18,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 13:14:18,040 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 13:14:18,040 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 13:14:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:18,042 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:14:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:14:18,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:18,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:18,043 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 13:14:18,043 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 13:14:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:18,044 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:14:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:14:18,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:18,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:18,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:18,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:14:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 13:14:18,045 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-11-23 13:14:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:18,045 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 13:14:18,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:14:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:14:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:14:18,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:18,046 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:18,046 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:18,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2094550384, now seen corresponding path program 23 times [2018-11-23 13:14:18,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:18,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:18,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:18,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:18,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:18,063 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:18,063 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:18,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:18,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:14:18,120 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 13:14:18,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:18,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:19,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2018-11-23 13:14:19,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {4973#true} ~__return_main~0 := 0;~__return_60~0 := 0; {4973#true} is VALID [2018-11-23 13:14:19,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2018-11-23 13:14:19,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #28#return; {4973#true} is VALID [2018-11-23 13:14:19,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret2 := main(); {4973#true} is VALID [2018-11-23 13:14:19,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {4973#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4973#true} is VALID [2018-11-23 13:14:19,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(1 <= ~main__n~0); {4973#true} is VALID [2018-11-23 13:14:19,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:19,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {4999#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:19,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {5003#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:19,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {5007#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:19,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {5011#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:19,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {5015#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:19,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {5019#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:19,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {5023#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:19,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {5027#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:19,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:19,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {5035#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:19,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {5039#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:19,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {5043#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:19,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {5047#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:19,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {5051#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:19,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {5055#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:19,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {5059#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:19,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {5063#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:19,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {5067#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:19,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {5071#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:19,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {5075#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:19,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {5079#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:19,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {5083#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:19,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {5087#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} is VALID [2018-11-23 13:14:19,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {5091#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5095#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:19,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {5095#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {4974#false} is VALID [2018-11-23 13:14:19,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2018-11-23 13:14:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:19,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:19,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-23 13:14:19,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-23 13:14:19,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:19,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:14:19,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:19,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:14:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:14:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:14:19,189 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2018-11-23 13:14:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,077 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:14:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:14:21,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-23 13:14:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:14:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-23 13:14:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:14:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-23 13:14:21,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2018-11-23 13:14:21,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:21,529 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:14:21,529 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:14:21,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:14:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:14:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:14:21,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:21,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 13:14:21,604 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:14:21,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:14:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,605 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:14:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:14:21,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:21,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:21,606 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:14:21,606 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:14:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,608 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:14:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:14:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:21,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:21,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:21,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:14:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 13:14:21,610 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-23 13:14:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:21,610 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 13:14:21,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:14:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:14:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:14:21,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:21,611 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:21,611 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:21,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 506489991, now seen corresponding path program 24 times [2018-11-23 13:14:21,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:21,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,621 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:21,621 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:21,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:21,638 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:14:21,718 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:14:21,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:21,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:22,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5308#true} is VALID [2018-11-23 13:14:22,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {5308#true} ~__return_main~0 := 0;~__return_60~0 := 0; {5308#true} is VALID [2018-11-23 13:14:22,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2018-11-23 13:14:22,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #28#return; {5308#true} is VALID [2018-11-23 13:14:22,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret2 := main(); {5308#true} is VALID [2018-11-23 13:14:22,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {5308#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5308#true} is VALID [2018-11-23 13:14:22,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {5308#true} assume !!(1 <= ~main__n~0); {5308#true} is VALID [2018-11-23 13:14:22,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {5308#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:22,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {5334#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:22,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {5338#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:22,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:22,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {5346#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:22,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {5350#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:22,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {5354#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:22,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {5358#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:22,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {5362#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:22,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {5366#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:22,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {5370#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:22,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {5374#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:22,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {5378#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:22,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {5382#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:22,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {5386#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:22,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {5390#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:22,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {5394#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:22,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:22,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {5402#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:22,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {5406#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:22,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {5410#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:22,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {5414#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:22,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {5418#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:22,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {5422#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:22,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {5426#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} is VALID [2018-11-23 13:14:22,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {5430#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5434#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:22,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {5309#false} is VALID [2018-11-23 13:14:22,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2018-11-23 13:14:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:22,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:22,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-23 13:14:22,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-23 13:14:22,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:22,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:14:22,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:22,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:14:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:14:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:14:22,927 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-11-23 13:14:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:24,942 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:14:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:14:24,943 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-23 13:14:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:14:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-23 13:14:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:14:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-23 13:14:24,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2018-11-23 13:14:25,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:25,414 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:14:25,414 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:14:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:14:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:14:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 13:14:25,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:25,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 13:14:25,507 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 13:14:25,507 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 13:14:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:25,509 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:14:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:14:25,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:25,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:25,509 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 13:14:25,509 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 13:14:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:25,511 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:14:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:14:25,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:25,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:25,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:25,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:14:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-23 13:14:25,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-11-23 13:14:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:25,513 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-23 13:14:25,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:14:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:14:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:14:25,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:25,514 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:25,514 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:25,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1478741936, now seen corresponding path program 25 times [2018-11-23 13:14:25,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:25,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:25,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:25,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:25,524 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:25,524 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:25,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:25,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:25,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:26,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {5653#true} call ULTIMATE.init(); {5653#true} is VALID [2018-11-23 13:14:26,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {5653#true} ~__return_main~0 := 0;~__return_60~0 := 0; {5653#true} is VALID [2018-11-23 13:14:26,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {5653#true} assume true; {5653#true} is VALID [2018-11-23 13:14:26,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5653#true} {5653#true} #28#return; {5653#true} is VALID [2018-11-23 13:14:26,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {5653#true} call #t~ret2 := main(); {5653#true} is VALID [2018-11-23 13:14:26,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {5653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5653#true} is VALID [2018-11-23 13:14:26,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {5653#true} assume !!(1 <= ~main__n~0); {5653#true} is VALID [2018-11-23 13:14:26,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {5653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:26,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {5679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:26,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {5683#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:26,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {5687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:26,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {5691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:26,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {5695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:26,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {5699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:26,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {5703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:26,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {5707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:26,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {5711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:26,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {5715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:26,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {5719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:26,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {5723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:26,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {5727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:26,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {5731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:26,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {5735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:26,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {5739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:26,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {5743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:26,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {5747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:26,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {5751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:26,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {5755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:26,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {5759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:26,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {5763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:26,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:26,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {5771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:26,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {5775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2018-11-23 13:14:26,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {5779#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5783#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:26,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {5783#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {5654#false} is VALID [2018-11-23 13:14:26,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {5654#false} assume !false; {5654#false} is VALID [2018-11-23 13:14:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-11-23 13:14:26,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-23 13:14:26,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:26,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:14:26,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:26,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:14:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:14:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:14:26,823 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-11-23 13:14:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:28,752 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:14:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:14:28,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-23 13:14:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:14:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-23 13:14:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:14:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-23 13:14:28,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2018-11-23 13:14:28,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:28,791 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:14:28,792 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:14:28,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:14:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:14:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:14:28,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:28,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 13:14:28,989 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:14:28,989 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:14:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:28,990 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:14:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:14:28,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:28,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:28,991 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:14:28,991 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:14:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:28,991 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:14:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:14:28,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:28,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:28,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:28,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:14:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-23 13:14:28,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-11-23 13:14:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:28,993 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-23 13:14:28,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:14:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:14:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:14:28,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:28,994 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:28,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:28,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1403577767, now seen corresponding path program 26 times [2018-11-23 13:14:28,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:28,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:29,002 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:29,002 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:29,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:29,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:29,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:29,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {6008#true} call ULTIMATE.init(); {6008#true} is VALID [2018-11-23 13:14:29,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {6008#true} ~__return_main~0 := 0;~__return_60~0 := 0; {6008#true} is VALID [2018-11-23 13:14:29,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {6008#true} assume true; {6008#true} is VALID [2018-11-23 13:14:29,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6008#true} {6008#true} #28#return; {6008#true} is VALID [2018-11-23 13:14:29,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {6008#true} call #t~ret2 := main(); {6008#true} is VALID [2018-11-23 13:14:29,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {6008#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6008#true} is VALID [2018-11-23 13:14:29,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {6008#true} assume !!(1 <= ~main__n~0); {6008#true} is VALID [2018-11-23 13:14:29,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {6008#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:29,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {6034#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:29,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {6038#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:29,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {6042#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:29,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {6046#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:29,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {6050#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:29,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {6054#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:29,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {6058#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:29,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:29,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {6066#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:29,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {6070#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:29,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {6074#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:29,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:29,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {6082#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:29,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {6086#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:29,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {6090#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:29,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {6094#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:29,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {6098#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:29,847 INFO L273 TraceCheckUtils]: 25: Hoare triple {6102#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:29,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {6106#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:29,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {6110#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:29,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {6114#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:29,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {6118#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:29,851 INFO L273 TraceCheckUtils]: 30: Hoare triple {6122#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:29,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {6126#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:29,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {6130#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:29,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {6134#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} is VALID [2018-11-23 13:14:29,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {6138#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6142#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:29,856 INFO L273 TraceCheckUtils]: 35: Hoare triple {6142#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {6009#false} is VALID [2018-11-23 13:14:29,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {6009#false} assume !false; {6009#false} is VALID [2018-11-23 13:14:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:29,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:29,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-23 13:14:29,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-23 13:14:29,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:29,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:14:29,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:29,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:14:29,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:14:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:14:29,914 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2018-11-23 13:14:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:31,990 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:14:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:14:31,991 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-23 13:14:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:14:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-23 13:14:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:14:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-23 13:14:31,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2018-11-23 13:14:32,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:32,385 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:14:32,385 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:14:32,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:14:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:14:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:14:32,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:32,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 13:14:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:14:32,467 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:14:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:32,468 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:14:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:14:32,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:32,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:32,469 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:14:32,469 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:14:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:32,470 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:14:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:14:32,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:32,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:32,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:32,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:14:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:14:32,471 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-11-23 13:14:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:32,471 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:14:32,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:14:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:14:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:14:32,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:32,472 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:32,472 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:32,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash 561175344, now seen corresponding path program 27 times [2018-11-23 13:14:32,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:32,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:32,481 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:32,481 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:32,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:32,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:32,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 13:14:32,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:32,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:33,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {6373#true} call ULTIMATE.init(); {6373#true} is VALID [2018-11-23 13:14:33,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {6373#true} ~__return_main~0 := 0;~__return_60~0 := 0; {6373#true} is VALID [2018-11-23 13:14:33,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {6373#true} assume true; {6373#true} is VALID [2018-11-23 13:14:33,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6373#true} {6373#true} #28#return; {6373#true} is VALID [2018-11-23 13:14:33,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {6373#true} call #t~ret2 := main(); {6373#true} is VALID [2018-11-23 13:14:33,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {6373#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6373#true} is VALID [2018-11-23 13:14:33,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {6373#true} assume !!(1 <= ~main__n~0); {6373#true} is VALID [2018-11-23 13:14:33,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {6373#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:33,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {6399#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:33,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {6403#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:33,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {6407#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:33,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {6411#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:33,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {6415#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:33,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {6419#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:33,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {6423#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:33,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {6427#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:33,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {6431#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:33,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {6435#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:33,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {6439#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:33,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {6443#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:33,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {6447#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:33,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {6451#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:33,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {6455#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:33,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {6459#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:33,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {6463#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:33,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {6467#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:33,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {6471#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:33,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {6475#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:33,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {6479#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:33,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {6483#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:33,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {6487#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:33,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {6491#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:33,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {6495#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:33,558 INFO L273 TraceCheckUtils]: 33: Hoare triple {6499#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:33,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {6503#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} is VALID [2018-11-23 13:14:33,560 INFO L273 TraceCheckUtils]: 35: Hoare triple {6507#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6511#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:33,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {6511#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {6374#false} is VALID [2018-11-23 13:14:33,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {6374#false} assume !false; {6374#false} is VALID [2018-11-23 13:14:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:33,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:33,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-11-23 13:14:33,584 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-23 13:14:33,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:33,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:14:33,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:33,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:14:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:14:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:14:33,621 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2018-11-23 13:14:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:36,038 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 13:14:36,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:14:36,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-23 13:14:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:14:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-23 13:14:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:14:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-23 13:14:36,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2018-11-23 13:14:36,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:36,081 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:14:36,081 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:14:36,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:14:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:14:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:14:36,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:36,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 13:14:36,164 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:14:36,164 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:14:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:36,165 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:14:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:14:36,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:36,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:36,166 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:14:36,166 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:14:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:36,167 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:14:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:14:36,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:36,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:36,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:36,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:14:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-23 13:14:36,168 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-11-23 13:14:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:36,169 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-23 13:14:36,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:14:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:14:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 13:14:36,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:36,169 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:36,169 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:36,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 216504007, now seen corresponding path program 28 times [2018-11-23 13:14:36,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:36,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:36,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:36,177 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:36,178 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:36,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:14:36,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:14:36,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:36,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:37,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {6748#true} call ULTIMATE.init(); {6748#true} is VALID [2018-11-23 13:14:37,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {6748#true} ~__return_main~0 := 0;~__return_60~0 := 0; {6748#true} is VALID [2018-11-23 13:14:37,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {6748#true} assume true; {6748#true} is VALID [2018-11-23 13:14:37,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6748#true} {6748#true} #28#return; {6748#true} is VALID [2018-11-23 13:14:37,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {6748#true} call #t~ret2 := main(); {6748#true} is VALID [2018-11-23 13:14:37,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {6748#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6748#true} is VALID [2018-11-23 13:14:37,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {6748#true} assume !!(1 <= ~main__n~0); {6748#true} is VALID [2018-11-23 13:14:37,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {6748#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:37,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {6774#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:37,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {6778#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:37,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {6782#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:37,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {6786#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:37,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:37,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {6794#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:37,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {6798#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:37,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {6802#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:37,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {6806#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:37,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {6810#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:37,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {6814#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:37,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {6818#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:37,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {6822#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:37,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {6826#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:37,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {6830#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:37,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {6834#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:37,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {6838#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:37,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {6842#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:37,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {6846#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:37,212 INFO L273 TraceCheckUtils]: 27: Hoare triple {6850#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:37,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {6854#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:37,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {6858#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:37,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {6862#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:37,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {6866#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:37,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {6870#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:37,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {6874#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:37,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {6878#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:37,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {6882#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:37,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {6886#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6890#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:37,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {6890#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {6749#false} is VALID [2018-11-23 13:14:37,221 INFO L273 TraceCheckUtils]: 38: Hoare triple {6749#false} assume !false; {6749#false} is VALID [2018-11-23 13:14:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:37,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:37,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-23 13:14:37,243 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-23 13:14:37,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:37,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:14:37,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:37,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:14:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:14:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:14:37,286 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2018-11-23 13:14:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,749 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:14:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:14:39,750 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-23 13:14:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:14:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-23 13:14:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:14:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-23 13:14:39,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2018-11-23 13:14:39,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:39,805 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:14:39,805 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:14:39,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:14:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:14:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 13:14:39,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:39,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 13:14:39,889 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 13:14:39,889 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 13:14:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,890 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:14:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:14:39,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:39,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:39,891 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 13:14:39,891 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 13:14:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:39,892 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:14:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:14:39,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:39,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:39,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:39,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:14:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 13:14:39,893 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-11-23 13:14:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:39,893 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 13:14:39,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:14:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:14:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:14:39,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:39,894 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:39,894 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:39,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1878372848, now seen corresponding path program 29 times [2018-11-23 13:14:39,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:39,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:39,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:39,902 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:39,903 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:39,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:39,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:14:39,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 13:14:39,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:39,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:40,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {7133#true} call ULTIMATE.init(); {7133#true} is VALID [2018-11-23 13:14:40,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {7133#true} ~__return_main~0 := 0;~__return_60~0 := 0; {7133#true} is VALID [2018-11-23 13:14:40,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {7133#true} assume true; {7133#true} is VALID [2018-11-23 13:14:40,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7133#true} {7133#true} #28#return; {7133#true} is VALID [2018-11-23 13:14:40,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {7133#true} call #t~ret2 := main(); {7133#true} is VALID [2018-11-23 13:14:40,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {7133#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7133#true} is VALID [2018-11-23 13:14:40,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {7133#true} assume !!(1 <= ~main__n~0); {7133#true} is VALID [2018-11-23 13:14:40,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {7133#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:40,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {7159#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:40,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {7163#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:40,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {7167#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:40,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {7171#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:40,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:40,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {7179#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:40,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {7183#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:40,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {7187#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:40,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {7191#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:40,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {7195#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:40,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {7199#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:40,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {7203#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:40,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {7207#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:40,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {7211#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:40,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {7215#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:40,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {7219#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:40,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {7223#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:40,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {7227#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:40,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {7231#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:40,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {7235#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:40,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {7239#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:40,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {7243#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:40,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {7247#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:40,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {7251#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:40,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {7255#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:40,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {7259#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:40,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {7263#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:40,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {7267#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:40,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {7271#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2018-11-23 13:14:40,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {7275#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7279#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:40,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {7279#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7134#false} is VALID [2018-11-23 13:14:40,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {7134#false} assume !false; {7134#false} is VALID [2018-11-23 13:14:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-11-23 13:14:40,810 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-23 13:14:40,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:40,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:14:40,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:40,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:14:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:14:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:14:40,848 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2018-11-23 13:14:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:43,333 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 13:14:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:14:43,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-23 13:14:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:14:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-23 13:14:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:14:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-23 13:14:43,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2018-11-23 13:14:43,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:43,412 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:14:43,412 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:14:43,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:14:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:14:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 13:14:43,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:43,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 13:14:43,487 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:14:43,487 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:14:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:43,488 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:14:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:14:43,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:43,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:43,489 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:14:43,489 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:14:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:43,490 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:14:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:14:43,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:43,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:43,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:43,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:14:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 13:14:43,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-11-23 13:14:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:43,492 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 13:14:43,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:14:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:14:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:14:43,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:43,493 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:43,493 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:43,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:43,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1899921383, now seen corresponding path program 30 times [2018-11-23 13:14:43,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:43,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:43,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:43,502 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:43,502 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:43,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:14:43,653 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 13:14:43,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:43,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:44,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {7528#true} call ULTIMATE.init(); {7528#true} is VALID [2018-11-23 13:14:44,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {7528#true} ~__return_main~0 := 0;~__return_60~0 := 0; {7528#true} is VALID [2018-11-23 13:14:44,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {7528#true} assume true; {7528#true} is VALID [2018-11-23 13:14:44,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7528#true} {7528#true} #28#return; {7528#true} is VALID [2018-11-23 13:14:44,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {7528#true} call #t~ret2 := main(); {7528#true} is VALID [2018-11-23 13:14:44,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {7528#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7528#true} is VALID [2018-11-23 13:14:44,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {7528#true} assume !!(1 <= ~main__n~0); {7528#true} is VALID [2018-11-23 13:14:44,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {7528#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:44,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {7554#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:14:44,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {7558#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:44,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {7562#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:44,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {7566#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:44,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {7570#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:44,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {7574#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:44,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {7578#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:44,773 INFO L273 TraceCheckUtils]: 15: Hoare triple {7582#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:44,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {7586#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:44,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {7590#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:44,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {7594#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:44,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {7598#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:44,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {7602#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:44,831 INFO L273 TraceCheckUtils]: 21: Hoare triple {7606#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:44,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {7610#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:44,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {7614#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:44,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {7618#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:44,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {7622#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:44,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {7626#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:44,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {7630#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:44,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {7634#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:44,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {7638#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:44,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {7642#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:44,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {7646#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:44,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {7650#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:44,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {7654#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:44,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {7658#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:44,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {7662#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:44,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {7666#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:14:44,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {7670#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} is VALID [2018-11-23 13:14:44,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {7674#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7678#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:44,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {7678#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7529#false} is VALID [2018-11-23 13:14:44,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {7529#false} assume !false; {7529#false} is VALID [2018-11-23 13:14:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:44,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-23 13:14:44,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-23 13:14:44,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:44,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:14:44,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:44,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:14:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:14:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:14:44,916 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2018-11-23 13:14:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:47,562 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:14:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:14:47,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-23 13:14:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:14:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-23 13:14:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:14:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-23 13:14:47,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2018-11-23 13:14:47,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:47,758 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:14:47,758 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:14:47,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:14:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:14:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 13:14:47,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:47,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 13:14:47,862 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:14:47,862 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:14:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:47,863 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 13:14:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:14:47,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:47,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:47,864 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:14:47,864 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:14:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:47,865 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 13:14:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:14:47,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:47,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:47,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:47,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:14:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 13:14:47,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-11-23 13:14:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:47,867 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 13:14:47,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:14:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:14:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:14:47,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:47,868 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:47,868 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:47,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:47,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1232041744, now seen corresponding path program 31 times [2018-11-23 13:14:47,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:47,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:47,877 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:47,877 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:47,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:47,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:48,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7933#true} is VALID [2018-11-23 13:14:48,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {7933#true} ~__return_main~0 := 0;~__return_60~0 := 0; {7933#true} is VALID [2018-11-23 13:14:48,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2018-11-23 13:14:48,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #28#return; {7933#true} is VALID [2018-11-23 13:14:48,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret2 := main(); {7933#true} is VALID [2018-11-23 13:14:48,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7933#true} is VALID [2018-11-23 13:14:48,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {7933#true} assume !!(1 <= ~main__n~0); {7933#true} is VALID [2018-11-23 13:14:48,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {7933#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:48,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {7959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:48,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {7963#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:48,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {7967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:48,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {7971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:48,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {7975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:48,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {7979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:48,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {7983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:48,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {7987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:48,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {7991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:48,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {7995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:48,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {7999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:48,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {8003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:48,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {8007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:48,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {8011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:48,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {8015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:48,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {8019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:48,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {8023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:48,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {8027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:48,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {8031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:48,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {8035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:48,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {8039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:48,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {8043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:48,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {8047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:48,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {8051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:48,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {8055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:48,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {8059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:48,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {8063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:48,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {8067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:48,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {8071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:14:48,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {8075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:14:48,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {8079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} is VALID [2018-11-23 13:14:48,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {8083#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8087#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:48,950 INFO L273 TraceCheckUtils]: 40: Hoare triple {8087#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {7934#false} is VALID [2018-11-23 13:14:48,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2018-11-23 13:14:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:48,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:48,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-11-23 13:14:48,972 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-23 13:14:48,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:48,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:14:49,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:49,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:14:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:14:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:14:49,011 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2018-11-23 13:14:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:51,951 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-23 13:14:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:14:51,951 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-23 13:14:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:14:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-23 13:14:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:14:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-23 13:14:51,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2018-11-23 13:14:52,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:52,274 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:14:52,274 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:14:52,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:14:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:14:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:14:52,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:52,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 13:14:52,455 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:14:52,456 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:14:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:52,457 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:14:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:14:52,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:52,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:52,458 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:14:52,458 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:14:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:52,459 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:14:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:14:52,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:52,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:52,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:52,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:14:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-23 13:14:52,461 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-11-23 13:14:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:52,461 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-23 13:14:52,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:14:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:14:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:14:52,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:52,462 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:52,462 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:52,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 461349127, now seen corresponding path program 32 times [2018-11-23 13:14:52,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:52,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:52,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:52,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:52,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:52,470 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:52,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:52,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:52,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:52,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:52,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:53,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {8348#true} call ULTIMATE.init(); {8348#true} is VALID [2018-11-23 13:14:53,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {8348#true} ~__return_main~0 := 0;~__return_60~0 := 0; {8348#true} is VALID [2018-11-23 13:14:53,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {8348#true} assume true; {8348#true} is VALID [2018-11-23 13:14:53,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8348#true} {8348#true} #28#return; {8348#true} is VALID [2018-11-23 13:14:53,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {8348#true} call #t~ret2 := main(); {8348#true} is VALID [2018-11-23 13:14:53,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {8348#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8348#true} is VALID [2018-11-23 13:14:53,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {8348#true} assume !!(1 <= ~main__n~0); {8348#true} is VALID [2018-11-23 13:14:53,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {8348#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:53,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {8374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:53,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {8378#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:53,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {8382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:53,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {8386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:53,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {8390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:53,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {8394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:53,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {8398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:53,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {8402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:53,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {8406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:53,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {8410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:53,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {8414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:53,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {8418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:53,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {8422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:53,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {8426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:53,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {8430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:53,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {8434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:53,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {8438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:53,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {8442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:53,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {8446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:53,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {8450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:53,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {8454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:53,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {8458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:53,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {8462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:53,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {8466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:53,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {8470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:53,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {8474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:53,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {8478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:53,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {8482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:53,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {8486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:14:53,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {8490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:14:53,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {8494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:14:53,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {8498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:14:53,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {8502#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8506#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:53,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {8506#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {8349#false} is VALID [2018-11-23 13:14:53,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {8349#false} assume !false; {8349#false} is VALID [2018-11-23 13:14:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:53,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:53,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-23 13:14:53,434 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-23 13:14:53,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:53,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:14:53,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:53,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:14:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:14:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:14:53,515 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2018-11-23 13:14:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:56,644 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:14:56,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:14:56,644 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-23 13:14:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:14:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-23 13:14:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:14:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-23 13:14:56,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2018-11-23 13:14:56,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:56,689 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:14:56,689 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:14:56,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:14:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:14:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 13:14:56,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:56,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 13:14:56,780 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 13:14:56,780 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 13:14:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:56,781 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 13:14:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:14:56,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:56,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:56,781 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 13:14:56,782 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 13:14:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:56,782 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 13:14:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:14:56,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:56,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:56,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:56,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:14:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-23 13:14:56,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-11-23 13:14:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:56,784 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-23 13:14:56,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:14:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:14:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:14:56,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:56,785 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:56,785 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:56,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1416858576, now seen corresponding path program 33 times [2018-11-23 13:14:56,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:56,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:56,793 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:14:56,793 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:14:56,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:14:56,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:57,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 13:14:57,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:57,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:58,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {8773#true} call ULTIMATE.init(); {8773#true} is VALID [2018-11-23 13:14:58,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {8773#true} ~__return_main~0 := 0;~__return_60~0 := 0; {8773#true} is VALID [2018-11-23 13:14:58,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {8773#true} assume true; {8773#true} is VALID [2018-11-23 13:14:58,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8773#true} {8773#true} #28#return; {8773#true} is VALID [2018-11-23 13:14:58,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {8773#true} call #t~ret2 := main(); {8773#true} is VALID [2018-11-23 13:14:58,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {8773#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8773#true} is VALID [2018-11-23 13:14:58,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {8773#true} assume !!(1 <= ~main__n~0); {8773#true} is VALID [2018-11-23 13:14:58,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {8773#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:14:58,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {8799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:14:58,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {8803#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:14:58,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {8807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:14:58,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {8811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:14:58,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {8815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:14:58,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {8819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:14:58,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {8823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:14:58,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:14:58,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {8831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:14:58,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {8835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:14:58,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {8839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:14:58,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {8843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:14:58,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {8847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:14:58,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:14:58,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {8855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:14:58,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {8859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:14:58,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {8863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:14:58,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {8867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:14:58,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {8871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:14:58,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {8875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:14:58,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {8879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:14:58,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {8883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:14:58,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {8887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:14:58,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {8891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:14:58,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {8895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:14:58,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {8899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:14:58,984 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:14:58,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:14:58,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {8911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:14:58,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {8915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:14:58,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {8919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:14:58,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {8923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:14:58,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2018-11-23 13:14:58,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {8931#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8935#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:14:58,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {8935#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {8774#false} is VALID [2018-11-23 13:14:58,992 INFO L273 TraceCheckUtils]: 43: Hoare triple {8774#false} assume !false; {8774#false} is VALID [2018-11-23 13:14:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:14:59,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-11-23 13:14:59,018 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-23 13:14:59,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:59,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 13:14:59,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 13:14:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:14:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:14:59,059 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2018-11-23 13:15:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:02,303 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-23 13:15:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:15:02,304 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-23 13:15:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:15:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-23 13:15:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:15:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-23 13:15:02,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2018-11-23 13:15:02,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:02,360 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:15:02,360 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:15:02,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:15:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:15:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 13:15:02,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:02,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 13:15:02,449 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:15:02,449 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:15:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:02,450 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:15:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:15:02,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:02,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:02,451 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:15:02,451 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:15:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:02,452 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:15:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:15:02,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:02,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:02,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:02,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:15:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-23 13:15:02,454 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-11-23 13:15:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:02,454 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-23 13:15:02,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 13:15:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:15:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:15:02,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:02,455 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:02,455 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:02,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 972880423, now seen corresponding path program 34 times [2018-11-23 13:15:02,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:02,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:02,465 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:02,465 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:02,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:02,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:02,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:02,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:02,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:03,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {9208#true} call ULTIMATE.init(); {9208#true} is VALID [2018-11-23 13:15:03,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {9208#true} ~__return_main~0 := 0;~__return_60~0 := 0; {9208#true} is VALID [2018-11-23 13:15:03,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {9208#true} assume true; {9208#true} is VALID [2018-11-23 13:15:03,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9208#true} {9208#true} #28#return; {9208#true} is VALID [2018-11-23 13:15:03,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {9208#true} call #t~ret2 := main(); {9208#true} is VALID [2018-11-23 13:15:03,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {9208#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {9208#true} is VALID [2018-11-23 13:15:03,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {9208#true} assume !!(1 <= ~main__n~0); {9208#true} is VALID [2018-11-23 13:15:03,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {9208#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:03,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {9234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:15:03,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {9238#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:03,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {9242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:03,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {9246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:03,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {9250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:03,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {9254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:03,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {9258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:03,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {9262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:03,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {9266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:03,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {9270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:03,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {9274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:03,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {9278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:03,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {9282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:03,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {9286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:03,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {9290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:03,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {9294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:03,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {9298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:03,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {9302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:03,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {9306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:03,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {9310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:03,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {9314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:03,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {9318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:03,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {9322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:03,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {9326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:03,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {9330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:03,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {9334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:03,818 INFO L273 TraceCheckUtils]: 34: Hoare triple {9338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:03,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {9342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:03,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {9346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:03,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {9350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:03,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {9354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:03,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {9358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:03,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {9362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:03,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {9366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} is VALID [2018-11-23 13:15:03,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {9370#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9374#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:03,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {9374#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {9209#false} is VALID [2018-11-23 13:15:03,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {9209#false} assume !false; {9209#false} is VALID [2018-11-23 13:15:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:03,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:03,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-23 13:15:03,851 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-23 13:15:03,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:03,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:15:03,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:03,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:15:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:15:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:15:03,892 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states. [2018-11-23 13:15:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,337 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:15:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:15:07,338 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-23 13:15:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:15:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-23 13:15:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:15:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-23 13:15:07,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2018-11-23 13:15:07,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:07,385 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:15:07,385 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:15:07,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:15:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:15:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 13:15:07,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:07,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 13:15:07,477 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 13:15:07,477 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 13:15:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,479 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-23 13:15:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:15:07,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:07,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:07,479 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 13:15:07,480 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 13:15:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:07,480 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-23 13:15:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:15:07,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:07,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:07,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:07,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:15:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-23 13:15:07,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-11-23 13:15:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:07,483 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-23 13:15:07,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:15:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:15:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:15:07,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:07,483 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:07,484 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:07,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 94459568, now seen corresponding path program 35 times [2018-11-23 13:15:07,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:07,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:07,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:07,493 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:07,493 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:07,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:07,587 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 13:15:07,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:07,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:08,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {9653#true} call ULTIMATE.init(); {9653#true} is VALID [2018-11-23 13:15:08,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {9653#true} ~__return_main~0 := 0;~__return_60~0 := 0; {9653#true} is VALID [2018-11-23 13:15:08,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {9653#true} assume true; {9653#true} is VALID [2018-11-23 13:15:08,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9653#true} {9653#true} #28#return; {9653#true} is VALID [2018-11-23 13:15:08,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {9653#true} call #t~ret2 := main(); {9653#true} is VALID [2018-11-23 13:15:08,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {9653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {9653#true} is VALID [2018-11-23 13:15:08,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {9653#true} assume !!(1 <= ~main__n~0); {9653#true} is VALID [2018-11-23 13:15:08,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {9653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:08,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {9679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:15:08,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {9683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:08,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {9687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:08,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {9691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:08,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {9695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:08,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {9699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:08,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {9703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:08,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {9707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:08,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {9711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:08,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {9715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:08,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {9719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:08,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {9723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:08,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {9727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:08,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {9731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:08,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {9735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:08,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {9739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:08,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {9743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:08,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {9747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:08,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {9751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:08,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {9755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:08,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {9759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:08,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {9763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:08,697 INFO L273 TraceCheckUtils]: 30: Hoare triple {9767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:08,698 INFO L273 TraceCheckUtils]: 31: Hoare triple {9771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:08,699 INFO L273 TraceCheckUtils]: 32: Hoare triple {9775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:08,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {9779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:08,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {9783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:08,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {9787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:08,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {9791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:08,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {9795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:08,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {9799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:08,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {9803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:08,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {9807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:08,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {9811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:08,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {9815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9819#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} is VALID [2018-11-23 13:15:08,709 INFO L273 TraceCheckUtils]: 43: Hoare triple {9819#(and (<= main_~main__i~0 36) (= main_~main__sum~0 630) (<= 35 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9823#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:08,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {9823#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {9654#false} is VALID [2018-11-23 13:15:08,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {9654#false} assume !false; {9654#false} is VALID [2018-11-23 13:15:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:08,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:08,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-11-23 13:15:08,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2018-11-23 13:15:08,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:08,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 13:15:08,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 13:15:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 13:15:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:15:08,775 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 39 states. [2018-11-23 13:15:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:12,351 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 13:15:12,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:15:12,351 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2018-11-23 13:15:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:15:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-23 13:15:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:15:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-23 13:15:12,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2018-11-23 13:15:12,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:12,400 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:15:12,400 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:15:12,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:15:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:15:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 13:15:12,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:12,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 13:15:12,507 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:15:12,507 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:15:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:12,508 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:15:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:15:12,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:12,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:12,509 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 13:15:12,509 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 13:15:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:12,510 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:15:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:15:12,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:12,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:12,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:12,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:15:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-23 13:15:12,511 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-11-23 13:15:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:12,511 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-23 13:15:12,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 13:15:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:15:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:15:12,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:12,512 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:12,512 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1366783161, now seen corresponding path program 36 times [2018-11-23 13:15:12,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:12,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:12,521 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:12,522 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:12,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:12,764 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:15:12,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:12,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:13,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {10108#true} call ULTIMATE.init(); {10108#true} is VALID [2018-11-23 13:15:13,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {10108#true} ~__return_main~0 := 0;~__return_60~0 := 0; {10108#true} is VALID [2018-11-23 13:15:13,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {10108#true} assume true; {10108#true} is VALID [2018-11-23 13:15:13,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10108#true} {10108#true} #28#return; {10108#true} is VALID [2018-11-23 13:15:13,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {10108#true} call #t~ret2 := main(); {10108#true} is VALID [2018-11-23 13:15:13,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {10108#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {10108#true} is VALID [2018-11-23 13:15:13,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {10108#true} assume !!(1 <= ~main__n~0); {10108#true} is VALID [2018-11-23 13:15:13,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {10108#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10134#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:13,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {10134#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10138#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:13,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {10138#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10142#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:13,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {10142#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10146#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:13,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {10146#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10150#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:13,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {10150#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10154#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:13,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {10154#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10158#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:13,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {10158#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10162#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:13,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {10162#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10166#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:13,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {10166#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10170#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:13,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {10170#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10174#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:13,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {10174#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10178#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:13,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {10178#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10182#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:13,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {10182#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10186#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:13,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {10186#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10190#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:13,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {10190#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10194#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:13,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {10194#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10198#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:13,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {10198#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10202#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:13,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {10202#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10206#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:13,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {10206#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10210#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:13,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {10210#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10214#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:13,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {10214#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10218#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:13,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {10218#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10222#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:13,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {10222#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10226#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:13,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {10226#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10230#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:13,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {10230#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10234#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:13,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {10234#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10238#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:13,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {10238#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10242#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:13,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {10242#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10246#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:13,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {10246#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10250#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:13,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {10250#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10254#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:13,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {10254#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10258#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:13,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {10258#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10262#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:13,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {10262#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10266#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:13,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {10266#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10270#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:13,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {10270#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10274#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:13,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {10274#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10278#(and (<= main_~main__i~0 37) (<= 36 main_~main__n~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:13,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {10278#(and (<= main_~main__i~0 37) (<= 36 main_~main__n~0) (= main_~main__sum~0 666))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10282#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:13,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {10282#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {10109#false} is VALID [2018-11-23 13:15:13,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {10109#false} assume !false; {10109#false} is VALID [2018-11-23 13:15:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-11-23 13:15:13,938 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2018-11-23 13:15:13,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:13,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:15:13,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:13,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:15:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:15:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:15:13,999 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 40 states. [2018-11-23 13:15:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:17,657 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:15:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:15:17,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2018-11-23 13:15:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:15:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-23 13:15:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:15:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-23 13:15:17,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2018-11-23 13:15:17,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:17,704 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:15:17,704 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:15:17,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:15:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:15:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 13:15:17,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:17,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 13:15:17,838 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 13:15:17,838 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 13:15:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:17,839 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-23 13:15:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:15:17,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:17,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:17,840 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 13:15:17,840 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 13:15:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:17,841 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-23 13:15:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:15:17,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:17,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:17,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:17,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:15:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 13:15:17,843 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-11-23 13:15:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:17,843 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 13:15:17,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 13:15:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:15:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:15:17,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:17,844 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:17,844 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:17,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 579332496, now seen corresponding path program 37 times [2018-11-23 13:15:17,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:17,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:17,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:17,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:17,853 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:17,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:17,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:17,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:18,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {10573#true} call ULTIMATE.init(); {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {10573#true} ~__return_main~0 := 0;~__return_60~0 := 0; {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {10573#true} assume true; {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10573#true} {10573#true} #28#return; {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {10573#true} call #t~ret2 := main(); {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {10573#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {10573#true} is VALID [2018-11-23 13:15:18,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {10573#true} assume !!(1 <= ~main__n~0); {10573#true} is VALID [2018-11-23 13:15:18,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {10573#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10599#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:18,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {10599#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10603#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:18,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {10603#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10607#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:18,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {10607#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10611#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:18,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {10611#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10615#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:18,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {10615#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10619#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:18,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {10619#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10623#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:18,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {10623#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10627#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:18,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {10627#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10631#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:18,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {10631#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10635#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:18,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {10635#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10639#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:19,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {10639#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10643#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:19,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {10643#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10647#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:19,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {10647#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10651#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:19,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10655#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:19,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {10655#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10659#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:19,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {10659#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10663#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:19,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {10663#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10667#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:19,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {10667#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10671#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:19,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {10671#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10675#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:19,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {10675#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10679#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:19,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {10679#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10683#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:19,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {10683#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10687#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:19,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {10687#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10691#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:19,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {10691#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10695#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:19,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {10695#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10699#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:19,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {10699#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10703#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:19,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {10703#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10707#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:19,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {10707#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10711#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:19,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {10711#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10715#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:19,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {10715#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10719#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:19,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {10719#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10723#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:19,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {10723#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10727#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:19,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {10727#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10731#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:19,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {10731#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10735#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:19,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {10735#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10739#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:19,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {10739#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10743#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:19,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {10743#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10747#(and (<= 37 main_~main__n~0) (= main_~main__sum~0 703) (<= main_~main__i~0 38))} is VALID [2018-11-23 13:15:19,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {10747#(and (<= 37 main_~main__n~0) (= main_~main__sum~0 703) (<= main_~main__i~0 38))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10751#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:19,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {10751#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {10574#false} is VALID [2018-11-23 13:15:19,023 INFO L273 TraceCheckUtils]: 47: Hoare triple {10574#false} assume !false; {10574#false} is VALID [2018-11-23 13:15:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:19,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:19,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-11-23 13:15:19,048 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-11-23 13:15:19,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:19,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 13:15:19,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:19,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 13:15:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:15:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:15:19,091 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 41 states. [2018-11-23 13:15:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:22,898 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 13:15:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:15:22,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-11-23 13:15:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:15:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 13:15:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:15:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 13:15:22,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2018-11-23 13:15:22,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:22,947 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:15:22,947 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:15:22,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:15:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:15:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 13:15:23,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:23,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 13:15:23,039 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:15:23,040 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:15:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:23,041 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:15:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:15:23,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:23,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:23,041 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:15:23,042 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:15:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:23,043 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:15:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:15:23,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:23,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:23,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:23,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:15:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-23 13:15:23,044 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-11-23 13:15:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-23 13:15:23,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 13:15:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:15:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:15:23,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:23,045 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:23,046 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:23,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 779375719, now seen corresponding path program 38 times [2018-11-23 13:15:23,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:23,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:23,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:23,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:23,055 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:23,055 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:23,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:23,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:23,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:23,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:23,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:24,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {11048#true} call ULTIMATE.init(); {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {11048#true} ~__return_main~0 := 0;~__return_60~0 := 0; {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {11048#true} assume true; {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11048#true} {11048#true} #28#return; {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {11048#true} call #t~ret2 := main(); {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {11048#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {11048#true} is VALID [2018-11-23 13:15:24,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {11048#true} assume !!(1 <= ~main__n~0); {11048#true} is VALID [2018-11-23 13:15:24,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {11048#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11074#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:24,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {11074#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11078#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:24,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {11078#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11082#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:24,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {11082#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11086#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:24,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {11086#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11090#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:24,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {11090#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11094#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:24,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {11094#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11098#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:24,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {11098#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11102#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:24,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {11102#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11106#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:24,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {11106#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11110#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:24,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {11110#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11114#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:24,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {11114#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11118#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:24,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {11118#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11122#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:24,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {11122#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11126#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:24,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {11126#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11130#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:24,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {11130#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11134#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:24,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {11134#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11138#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:24,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {11138#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11142#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:24,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {11142#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11146#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:24,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {11146#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11150#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:24,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {11150#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11154#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:24,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {11154#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11158#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:24,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {11158#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11162#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:24,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {11162#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11166#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:24,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {11166#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11170#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:24,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {11170#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11174#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:24,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {11174#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11178#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:24,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {11178#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11182#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:24,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {11182#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11186#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:24,816 INFO L273 TraceCheckUtils]: 36: Hoare triple {11186#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11190#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:24,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {11190#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11194#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:24,818 INFO L273 TraceCheckUtils]: 38: Hoare triple {11194#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11198#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:24,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {11198#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11202#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:24,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {11202#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11206#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:24,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {11206#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11210#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:24,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {11210#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11214#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:24,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {11214#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11218#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:24,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {11218#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11222#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:24,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {11222#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11226#(and (= main_~main__sum~0 741) (<= 38 main_~main__n~0) (<= main_~main__i~0 39))} is VALID [2018-11-23 13:15:24,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {11226#(and (= main_~main__sum~0 741) (<= 38 main_~main__n~0) (<= main_~main__i~0 39))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11230#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:24,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {11230#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {11049#false} is VALID [2018-11-23 13:15:24,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {11049#false} assume !false; {11049#false} is VALID [2018-11-23 13:15:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:24,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:24,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-11-23 13:15:24,851 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2018-11-23 13:15:24,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:24,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:15:24,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:15:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:15:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:15:24,897 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 42 states. [2018-11-23 13:15:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:29,079 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:15:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:15:29,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2018-11-23 13:15:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:15:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 13:15:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:15:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 13:15:29,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2018-11-23 13:15:29,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:29,135 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:15:29,135 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:15:29,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:15:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:15:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 13:15:29,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:29,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 13:15:29,238 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:15:29,238 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:15:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:29,239 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 13:15:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:15:29,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:29,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:29,240 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:15:29,240 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:15:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:29,240 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 13:15:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:15:29,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:29,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:29,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:29,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:15:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 13:15:29,242 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-11-23 13:15:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:29,242 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 13:15:29,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:15:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:15:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:15:29,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:29,242 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:29,243 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:29,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1609218960, now seen corresponding path program 39 times [2018-11-23 13:15:29,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:29,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:29,250 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:29,251 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:29,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:29,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:30,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 13:15:30,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:30,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:31,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {11533#true} call ULTIMATE.init(); {11533#true} is VALID [2018-11-23 13:15:31,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {11533#true} ~__return_main~0 := 0;~__return_60~0 := 0; {11533#true} is VALID [2018-11-23 13:15:31,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {11533#true} assume true; {11533#true} is VALID [2018-11-23 13:15:31,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11533#true} {11533#true} #28#return; {11533#true} is VALID [2018-11-23 13:15:31,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {11533#true} call #t~ret2 := main(); {11533#true} is VALID [2018-11-23 13:15:31,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {11533#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {11533#true} is VALID [2018-11-23 13:15:31,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {11533#true} assume !!(1 <= ~main__n~0); {11533#true} is VALID [2018-11-23 13:15:31,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {11533#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11559#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:31,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {11559#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11563#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:15:31,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {11563#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11567#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:31,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {11567#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11571#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:31,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {11571#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11575#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:31,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {11575#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11579#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:31,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {11579#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11583#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:31,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {11583#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11587#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:31,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {11587#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11591#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:31,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {11591#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11595#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:31,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {11595#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11599#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:31,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {11599#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11603#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:31,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {11603#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11607#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:31,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {11607#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11611#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:31,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {11611#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11615#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:31,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {11615#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11619#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:31,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {11619#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11623#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:31,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {11623#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11627#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:31,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {11627#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11631#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:31,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {11631#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11635#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:31,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {11635#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11639#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:31,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {11639#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11643#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:31,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {11643#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11647#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:31,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {11647#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11651#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:31,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {11651#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11655#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:31,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {11655#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11659#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:31,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {11659#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11663#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:31,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {11663#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11667#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:31,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {11667#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11671#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:31,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {11671#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11675#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:31,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {11675#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11679#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:31,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {11679#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11683#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:31,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {11683#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11687#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:31,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {11687#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11691#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:31,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {11691#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11695#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:31,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {11695#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11699#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:31,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {11699#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11703#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:31,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {11703#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11707#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:31,857 INFO L273 TraceCheckUtils]: 45: Hoare triple {11707#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11711#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:15:31,858 INFO L273 TraceCheckUtils]: 46: Hoare triple {11711#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11715#(and (<= main_~main__i~0 40) (<= 39 main_~main__n~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:15:31,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {11715#(and (<= main_~main__i~0 40) (<= 39 main_~main__n~0) (= main_~main__sum~0 780))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11719#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:31,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {11719#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {11534#false} is VALID [2018-11-23 13:15:31,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {11534#false} assume !false; {11534#false} is VALID [2018-11-23 13:15:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:31,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:31,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-11-23 13:15:31,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2018-11-23 13:15:31,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:31,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 13:15:31,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:31,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 13:15:31,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 13:15:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:15:31,932 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 43 states. [2018-11-23 13:15:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:36,368 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 13:15:36,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 13:15:36,369 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2018-11-23 13:15:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:15:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 13:15:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:15:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 13:15:36,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2018-11-23 13:15:36,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:36,432 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:15:36,432 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:15:36,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:15:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:15:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 13:15:36,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:36,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 13:15:36,551 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 13:15:36,551 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 13:15:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:36,553 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:15:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:15:36,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:36,553 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 13:15:36,553 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 13:15:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:36,554 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:15:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:15:36,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:36,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:36,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:36,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:15:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-23 13:15:36,556 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-11-23 13:15:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:36,556 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-23 13:15:36,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 13:15:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:15:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:15:36,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:36,557 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:36,557 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:36,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:36,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1653757319, now seen corresponding path program 40 times [2018-11-23 13:15:36,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:36,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:36,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:36,566 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:36,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:36,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:37,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:37,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:37,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:38,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {12028#true} call ULTIMATE.init(); {12028#true} is VALID [2018-11-23 13:15:38,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {12028#true} ~__return_main~0 := 0;~__return_60~0 := 0; {12028#true} is VALID [2018-11-23 13:15:38,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {12028#true} assume true; {12028#true} is VALID [2018-11-23 13:15:38,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12028#true} {12028#true} #28#return; {12028#true} is VALID [2018-11-23 13:15:38,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {12028#true} call #t~ret2 := main(); {12028#true} is VALID [2018-11-23 13:15:38,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {12028#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {12028#true} is VALID [2018-11-23 13:15:38,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {12028#true} assume !!(1 <= ~main__n~0); {12028#true} is VALID [2018-11-23 13:15:38,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {12028#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:38,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {12054#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12058#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:38,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {12058#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:38,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {12062#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:38,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {12066#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:38,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {12070#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:38,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {12074#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:38,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {12078#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:38,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {12082#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:38,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {12086#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:38,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {12090#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:38,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {12094#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:38,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {12098#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:38,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {12102#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:38,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {12106#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:38,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {12110#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:38,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {12114#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:38,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {12118#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:38,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {12122#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:38,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {12126#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:38,564 INFO L273 TraceCheckUtils]: 27: Hoare triple {12130#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12134#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:38,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {12134#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12138#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:38,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {12138#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12142#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:38,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {12142#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12146#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:38,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {12146#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12150#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:38,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {12150#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12154#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:38,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {12154#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12158#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:38,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {12158#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12162#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:38,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {12162#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12166#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:38,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {12166#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12170#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:38,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {12170#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12174#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:38,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {12174#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12178#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:38,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {12178#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12182#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:38,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {12182#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12186#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:38,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {12186#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12190#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:38,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {12190#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12194#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:38,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {12194#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12198#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:38,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {12198#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12202#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:38,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {12202#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12206#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:15:38,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {12206#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12210#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:15:38,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {12210#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12214#(and (<= 40 main_~main__n~0) (<= main_~main__i~0 41) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:15:38,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {12214#(and (<= 40 main_~main__n~0) (<= main_~main__i~0 41) (= main_~main__sum~0 820))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12218#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:38,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {12218#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {12029#false} is VALID [2018-11-23 13:15:38,583 INFO L273 TraceCheckUtils]: 50: Hoare triple {12029#false} assume !false; {12029#false} is VALID [2018-11-23 13:15:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:38,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:38,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-11-23 13:15:38,609 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2018-11-23 13:15:38,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:38,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 13:15:38,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:38,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 13:15:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 13:15:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:15:38,656 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 44 states. [2018-11-23 13:15:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:43,245 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:15:43,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 13:15:43,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2018-11-23 13:15:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:15:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-23 13:15:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:15:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-23 13:15:43,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2018-11-23 13:15:43,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:43,299 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:15:43,299 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:15:43,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 13:15:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:15:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 13:15:43,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:43,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 13:15:43,415 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:15:43,415 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:15:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:43,417 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 13:15:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:15:43,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:43,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:43,418 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:15:43,418 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:15:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:43,418 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 13:15:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:15:43,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:43,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:43,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:43,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:15:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-23 13:15:43,420 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-11-23 13:15:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:43,420 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-23 13:15:43,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 13:15:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:15:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:15:43,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:43,420 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:43,421 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:43,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -273193136, now seen corresponding path program 41 times [2018-11-23 13:15:43,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:43,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:43,429 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:43,430 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:43,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:43,569 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 13:15:43,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:43,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:45,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {12533#true} call ULTIMATE.init(); {12533#true} is VALID [2018-11-23 13:15:45,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {12533#true} ~__return_main~0 := 0;~__return_60~0 := 0; {12533#true} is VALID [2018-11-23 13:15:45,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {12533#true} assume true; {12533#true} is VALID [2018-11-23 13:15:45,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12533#true} {12533#true} #28#return; {12533#true} is VALID [2018-11-23 13:15:45,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {12533#true} call #t~ret2 := main(); {12533#true} is VALID [2018-11-23 13:15:45,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {12533#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {12533#true} is VALID [2018-11-23 13:15:45,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {12533#true} assume !!(1 <= ~main__n~0); {12533#true} is VALID [2018-11-23 13:15:45,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {12533#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12559#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:45,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {12559#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12563#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:15:45,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {12563#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12567#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:45,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {12567#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:45,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {12571#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12575#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:45,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {12575#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12579#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:45,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {12579#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12583#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:45,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {12583#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12587#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:45,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {12587#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12591#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:45,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {12591#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12595#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:45,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {12595#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12599#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:45,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {12599#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12603#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:45,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {12603#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12607#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:45,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {12607#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12611#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:45,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {12611#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12615#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:45,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {12615#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12619#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:45,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {12619#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12623#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:45,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {12623#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12627#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:45,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {12627#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12631#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:45,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {12631#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12635#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:45,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {12635#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12639#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:45,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {12639#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12643#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:45,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {12643#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12647#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:45,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {12647#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12651#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:45,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {12651#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12655#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:45,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {12655#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12659#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:45,220 INFO L273 TraceCheckUtils]: 33: Hoare triple {12659#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12663#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:45,221 INFO L273 TraceCheckUtils]: 34: Hoare triple {12663#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12667#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:45,222 INFO L273 TraceCheckUtils]: 35: Hoare triple {12667#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12671#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:45,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {12671#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12675#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:45,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {12675#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12679#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:45,225 INFO L273 TraceCheckUtils]: 38: Hoare triple {12679#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12683#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:45,226 INFO L273 TraceCheckUtils]: 39: Hoare triple {12683#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12687#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:45,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {12687#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12691#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:45,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {12691#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12695#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:45,228 INFO L273 TraceCheckUtils]: 42: Hoare triple {12695#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12699#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:45,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {12699#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12703#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:45,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {12703#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12707#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:45,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {12707#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12711#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:15:45,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {12711#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12715#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:15:45,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {12715#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12719#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:15:45,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {12719#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12723#(and (= main_~main__sum~0 861) (<= 41 main_~main__n~0) (<= main_~main__i~0 42))} is VALID [2018-11-23 13:15:45,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {12723#(and (= main_~main__sum~0 861) (<= 41 main_~main__n~0) (<= main_~main__i~0 42))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12727#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:45,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {12727#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {12534#false} is VALID [2018-11-23 13:15:45,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {12534#false} assume !false; {12534#false} is VALID [2018-11-23 13:15:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:45,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-11-23 13:15:45,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2018-11-23 13:15:45,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:45,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 13:15:45,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 13:15:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 13:15:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 13:15:45,313 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 45 states. [2018-11-23 13:15:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,155 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 13:15:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 13:15:50,155 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2018-11-23 13:15:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:15:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 13:15:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:15:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 13:15:50,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2018-11-23 13:15:50,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:50,210 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:15:50,210 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:15:50,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:15:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:15:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 13:15:50,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:50,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 13:15:50,327 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:15:50,328 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:15:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,329 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:15:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:15:50,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:50,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:50,329 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:15:50,329 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:15:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,330 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:15:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:15:50,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:50,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:50,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:50,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:15:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-23 13:15:50,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-11-23 13:15:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:50,332 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-23 13:15:50,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 13:15:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:15:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 13:15:50,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:50,333 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:50,333 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:50,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 120884903, now seen corresponding path program 42 times [2018-11-23 13:15:50,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,342 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:50,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:50,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:50,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:50,947 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-11-23 13:15:50,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:52,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {13048#true} call ULTIMATE.init(); {13048#true} is VALID [2018-11-23 13:15:52,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {13048#true} ~__return_main~0 := 0;~__return_60~0 := 0; {13048#true} is VALID [2018-11-23 13:15:52,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {13048#true} assume true; {13048#true} is VALID [2018-11-23 13:15:52,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13048#true} {13048#true} #28#return; {13048#true} is VALID [2018-11-23 13:15:52,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {13048#true} call #t~ret2 := main(); {13048#true} is VALID [2018-11-23 13:15:52,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {13048#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {13048#true} is VALID [2018-11-23 13:15:52,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {13048#true} assume !!(1 <= ~main__n~0); {13048#true} is VALID [2018-11-23 13:15:52,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {13048#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13074#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:52,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {13074#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13078#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:52,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {13078#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13082#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:52,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {13082#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13086#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:52,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {13086#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13090#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:52,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {13090#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13094#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:52,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {13094#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13098#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:52,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {13098#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13102#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:52,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {13102#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13106#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:52,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {13106#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13110#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:52,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {13110#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13114#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:52,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {13114#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13118#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:52,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {13118#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13122#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:52,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {13122#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13126#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:52,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {13126#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13130#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:52,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {13130#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13134#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:52,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {13134#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13138#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:52,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {13138#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13142#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:52,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {13142#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13146#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:52,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {13146#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13150#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:52,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {13150#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13154#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:52,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {13154#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13158#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:52,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {13158#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13162#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:52,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {13162#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13166#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:52,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {13166#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13170#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:52,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {13170#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13174#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:52,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {13174#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13178#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:52,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {13178#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13182#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:52,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {13182#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13186#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:52,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {13186#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13190#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:52,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {13190#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13194#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:52,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {13194#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13198#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:52,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {13198#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13202#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:52,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {13202#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13206#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:52,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {13206#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13210#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:52,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {13210#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13214#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:52,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {13214#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13218#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:52,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {13218#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13222#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:52,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {13222#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13226#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:15:52,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {13226#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13230#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:15:52,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {13230#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13234#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:15:52,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {13234#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13238#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:15:52,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {13238#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13242#(and (<= main_~main__i~0 43) (<= 42 main_~main__n~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:15:52,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {13242#(and (<= main_~main__i~0 43) (<= 42 main_~main__n~0) (= main_~main__sum~0 903))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13246#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:52,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {13246#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {13049#false} is VALID [2018-11-23 13:15:52,419 INFO L273 TraceCheckUtils]: 52: Hoare triple {13049#false} assume !false; {13049#false} is VALID [2018-11-23 13:15:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:52,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:52,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-11-23 13:15:52,445 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2018-11-23 13:15:52,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:52,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 13:15:52,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:52,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 13:15:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 13:15:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:15:52,496 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 46 states. [2018-11-23 13:15:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:57,513 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:15:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 13:15:57,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2018-11-23 13:15:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:15:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-23 13:15:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:15:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-23 13:15:57,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2018-11-23 13:15:57,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:57,570 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:15:57,570 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:15:57,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:15:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:15:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 13:15:57,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:57,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 13:15:57,692 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 13:15:57,692 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 13:15:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:57,694 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 13:15:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:15:57,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:57,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:57,695 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 13:15:57,695 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 13:15:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:57,695 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 13:15:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:15:57,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:57,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:57,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:57,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:15:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 13:15:57,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-11-23 13:15:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:57,697 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 13:15:57,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 13:15:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:15:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:15:57,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:57,698 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:57,698 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:57,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash -547597776, now seen corresponding path program 43 times [2018-11-23 13:15:57,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,707 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:15:57,707 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:15:57,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:15:57,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:57,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:59,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {13573#true} call ULTIMATE.init(); {13573#true} is VALID [2018-11-23 13:15:59,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {13573#true} ~__return_main~0 := 0;~__return_60~0 := 0; {13573#true} is VALID [2018-11-23 13:15:59,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {13573#true} assume true; {13573#true} is VALID [2018-11-23 13:15:59,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13573#true} {13573#true} #28#return; {13573#true} is VALID [2018-11-23 13:15:59,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {13573#true} call #t~ret2 := main(); {13573#true} is VALID [2018-11-23 13:15:59,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {13573#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {13573#true} is VALID [2018-11-23 13:15:59,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {13573#true} assume !!(1 <= ~main__n~0); {13573#true} is VALID [2018-11-23 13:15:59,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {13573#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13599#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:15:59,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {13599#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13603#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:15:59,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {13603#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13607#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:15:59,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {13607#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13611#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:15:59,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {13611#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13615#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:15:59,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {13615#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13619#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:15:59,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {13619#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13623#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:15:59,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {13623#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13627#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:15:59,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {13627#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13631#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:15:59,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {13631#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13635#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:15:59,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {13635#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13639#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:15:59,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {13639#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13643#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:15:59,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {13643#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13647#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:15:59,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {13647#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13651#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:15:59,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {13651#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13655#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:15:59,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {13655#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13659#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:15:59,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {13659#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13663#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:15:59,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {13663#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13667#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:15:59,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {13667#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13671#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:15:59,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {13671#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13675#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:15:59,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {13675#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13679#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:15:59,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {13679#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13683#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:15:59,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {13683#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13687#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:15:59,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {13687#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13691#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:15:59,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {13691#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13695#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:15:59,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {13695#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13699#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:15:59,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {13699#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13703#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:15:59,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {13703#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13707#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:15:59,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {13707#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13711#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:15:59,296 INFO L273 TraceCheckUtils]: 36: Hoare triple {13711#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13715#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:15:59,297 INFO L273 TraceCheckUtils]: 37: Hoare triple {13715#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13719#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:15:59,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {13719#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13723#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:15:59,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {13723#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13727#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:15:59,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {13727#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13731#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:15:59,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {13731#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13735#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:15:59,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {13735#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13739#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:15:59,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {13739#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13743#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:15:59,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {13743#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13747#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:15:59,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {13747#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13751#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:15:59,305 INFO L273 TraceCheckUtils]: 46: Hoare triple {13751#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13755#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:15:59,306 INFO L273 TraceCheckUtils]: 47: Hoare triple {13755#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13759#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:15:59,307 INFO L273 TraceCheckUtils]: 48: Hoare triple {13759#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13763#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:15:59,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {13763#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13767#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:15:59,309 INFO L273 TraceCheckUtils]: 50: Hoare triple {13767#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13771#(and (<= 43 main_~main__n~0) (= main_~main__sum~0 946) (<= main_~main__i~0 44))} is VALID [2018-11-23 13:15:59,310 INFO L273 TraceCheckUtils]: 51: Hoare triple {13771#(and (<= 43 main_~main__n~0) (= main_~main__sum~0 946) (<= main_~main__i~0 44))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13775#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:15:59,311 INFO L273 TraceCheckUtils]: 52: Hoare triple {13775#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {13574#false} is VALID [2018-11-23 13:15:59,311 INFO L273 TraceCheckUtils]: 53: Hoare triple {13574#false} assume !false; {13574#false} is VALID [2018-11-23 13:15:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:59,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:15:59,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-11-23 13:15:59,337 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2018-11-23 13:15:59,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:59,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 13:15:59,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:59,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 13:15:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 13:15:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:15:59,408 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 47 states. [2018-11-23 13:16:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:04,709 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-23 13:16:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 13:16:04,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2018-11-23 13:16:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:16:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-23 13:16:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:16:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-23 13:16:04,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2018-11-23 13:16:04,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:04,765 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:16:04,765 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:16:04,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:16:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:16:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 13:16:04,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:04,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 13:16:04,891 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 13:16:04,891 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 13:16:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:04,892 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:16:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:16:04,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:04,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:04,893 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 13:16:04,893 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 13:16:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:04,894 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:16:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:16:04,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:04,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:04,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:04,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:16:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-23 13:16:04,895 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-11-23 13:16:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:04,895 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-23 13:16:04,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 13:16:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:16:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:16:04,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:04,896 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:04,896 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:04,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash 204275655, now seen corresponding path program 44 times [2018-11-23 13:16:04,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,904 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:04,905 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:04,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:04,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:04,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:05,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:06,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2018-11-23 13:16:06,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {14108#true} ~__return_main~0 := 0;~__return_60~0 := 0; {14108#true} is VALID [2018-11-23 13:16:06,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2018-11-23 13:16:06,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #28#return; {14108#true} is VALID [2018-11-23 13:16:06,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret2 := main(); {14108#true} is VALID [2018-11-23 13:16:06,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {14108#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {14108#true} is VALID [2018-11-23 13:16:06,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {14108#true} assume !!(1 <= ~main__n~0); {14108#true} is VALID [2018-11-23 13:16:06,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {14108#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14134#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:06,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {14134#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14138#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:16:06,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {14138#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14142#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:06,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {14142#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14146#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:06,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {14146#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14150#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:06,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {14150#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14154#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:06,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {14154#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14158#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:06,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {14158#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14162#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:06,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {14162#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14166#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:06,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {14166#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14170#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:06,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {14170#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14174#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:06,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {14174#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14178#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:06,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {14178#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14182#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:06,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {14182#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14186#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:06,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {14186#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14190#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:06,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {14190#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14194#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:06,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {14194#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14198#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:06,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {14198#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14202#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:06,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {14202#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14206#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:06,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {14206#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14210#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:06,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {14210#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14214#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:06,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {14214#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14218#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:06,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {14218#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14222#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:06,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {14222#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14226#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:06,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {14226#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14230#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:06,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {14230#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14234#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:06,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {14234#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14238#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:06,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {14238#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14242#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:06,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {14242#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14246#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:06,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {14246#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14250#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:06,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {14250#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14254#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:06,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {14254#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14258#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:06,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {14258#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14262#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:06,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {14262#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14266#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:06,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {14266#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14270#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:06,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {14270#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14274#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:06,704 INFO L273 TraceCheckUtils]: 43: Hoare triple {14274#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14278#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:06,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {14278#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14282#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:06,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {14282#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14286#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:06,707 INFO L273 TraceCheckUtils]: 46: Hoare triple {14286#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14290#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:06,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {14290#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14294#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:06,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {14294#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14298#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:06,710 INFO L273 TraceCheckUtils]: 49: Hoare triple {14298#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14302#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:06,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {14302#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14306#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:06,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {14306#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14310#(and (<= 44 main_~main__n~0) (<= main_~main__i~0 45) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:06,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {14310#(and (<= 44 main_~main__n~0) (<= main_~main__i~0 45) (= main_~main__sum~0 990))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14314#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:06,713 INFO L273 TraceCheckUtils]: 53: Hoare triple {14314#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {14109#false} is VALID [2018-11-23 13:16:06,714 INFO L273 TraceCheckUtils]: 54: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2018-11-23 13:16:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:06,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-11-23 13:16:06,738 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-23 13:16:06,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:06,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 13:16:06,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:06,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 13:16:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 13:16:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:16:06,790 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 48 states. [2018-11-23 13:16:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,303 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:16:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 13:16:12,304 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2018-11-23 13:16:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:16:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-23 13:16:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:16:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-23 13:16:12,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 60 transitions. [2018-11-23 13:16:12,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:12,361 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:16:12,361 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:16:12,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 13:16:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:16:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 13:16:12,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:12,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 13:16:12,478 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:16:12,479 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:16:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,480 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 13:16:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:16:12,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:12,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:12,481 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:16:12,481 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:16:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,482 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 13:16:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:16:12,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:12,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:12,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:12,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:16:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 13:16:12,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-11-23 13:16:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:12,483 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 13:16:12,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 13:16:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:16:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:16:12,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:12,484 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:12,484 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:12,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2037515536, now seen corresponding path program 45 times [2018-11-23 13:16:12,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:12,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:12,492 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:12,492 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:12,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:12,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:14,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-23 13:16:14,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:14,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:16,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {14653#true} call ULTIMATE.init(); {14653#true} is VALID [2018-11-23 13:16:16,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {14653#true} ~__return_main~0 := 0;~__return_60~0 := 0; {14653#true} is VALID [2018-11-23 13:16:16,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {14653#true} assume true; {14653#true} is VALID [2018-11-23 13:16:16,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14653#true} {14653#true} #28#return; {14653#true} is VALID [2018-11-23 13:16:16,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {14653#true} call #t~ret2 := main(); {14653#true} is VALID [2018-11-23 13:16:16,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {14653#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {14653#true} is VALID [2018-11-23 13:16:16,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {14653#true} assume !!(1 <= ~main__n~0); {14653#true} is VALID [2018-11-23 13:16:16,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {14653#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:16,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {14679#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-23 13:16:16,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {14683#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:16,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {14687#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:16,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {14691#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:16,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {14695#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:16,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {14699#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:16,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {14703#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:16,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {14707#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:16,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {14711#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:16,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {14715#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:16,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {14719#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:16,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {14723#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:16,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {14727#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:16,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {14731#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:16,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {14735#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:16,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {14739#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:16,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {14743#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:16,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {14747#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:16,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {14751#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:16,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {14755#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:16,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {14759#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:16,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {14763#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:16,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {14767#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:16,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {14771#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:16,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {14775#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:16,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {14779#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:16,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {14783#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:16,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {14787#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:16,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {14791#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:16,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {14795#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:16,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {14799#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:16,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {14803#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:16,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {14807#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:16,681 INFO L273 TraceCheckUtils]: 41: Hoare triple {14811#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:16,681 INFO L273 TraceCheckUtils]: 42: Hoare triple {14815#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14819#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:16,683 INFO L273 TraceCheckUtils]: 43: Hoare triple {14819#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14823#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:16,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {14823#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14827#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:16,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {14827#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14831#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:16,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {14831#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14835#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:16,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {14835#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14839#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:16,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {14839#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14843#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:16,689 INFO L273 TraceCheckUtils]: 49: Hoare triple {14843#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14847#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:16,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {14847#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14851#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:16,691 INFO L273 TraceCheckUtils]: 51: Hoare triple {14851#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14855#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:16,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {14855#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14859#(and (<= main_~main__i~0 46) (= main_~main__sum~0 1035) (<= 45 main_~main__n~0))} is VALID [2018-11-23 13:16:16,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {14859#(and (<= main_~main__i~0 46) (= main_~main__sum~0 1035) (<= 45 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14863#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:16,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {14863#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {14654#false} is VALID [2018-11-23 13:16:16,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {14654#false} assume !false; {14654#false} is VALID [2018-11-23 13:16:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:16,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-11-23 13:16:16,720 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-11-23 13:16:16,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:16,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 13:16:16,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:16,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 13:16:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 13:16:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 13:16:16,813 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 49 states. [2018-11-23 13:16:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,423 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 13:16:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 13:16:22,423 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-11-23 13:16:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:16:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 13:16:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:16:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 13:16:22,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 61 transitions. [2018-11-23 13:16:22,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,481 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:16:22,481 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:16:22,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:16:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:16:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 13:16:22,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:22,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 13:16:22,603 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:16:22,603 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:16:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,604 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:16:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:16:22,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:22,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:22,605 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:16:22,605 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:16:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,606 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:16:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:16:22,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:22,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:22,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:22,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:16:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-23 13:16:22,608 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-11-23 13:16:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:22,608 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-23 13:16:22,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 13:16:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:16:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:16:22,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:22,609 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:22,609 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:22,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1261590297, now seen corresponding path program 46 times [2018-11-23 13:16:22,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:22,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:22,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:22,618 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:22,618 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:22,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:23,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:23,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:23,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:24,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {15208#true} call ULTIMATE.init(); {15208#true} is VALID [2018-11-23 13:16:24,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {15208#true} ~__return_main~0 := 0;~__return_60~0 := 0; {15208#true} is VALID [2018-11-23 13:16:24,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {15208#true} assume true; {15208#true} is VALID [2018-11-23 13:16:24,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15208#true} {15208#true} #28#return; {15208#true} is VALID [2018-11-23 13:16:24,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {15208#true} call #t~ret2 := main(); {15208#true} is VALID [2018-11-23 13:16:24,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {15208#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {15208#true} is VALID [2018-11-23 13:16:24,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {15208#true} assume !!(1 <= ~main__n~0); {15208#true} is VALID [2018-11-23 13:16:24,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {15208#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:24,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {15234#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15238#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:16:24,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {15238#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:24,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {15242#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:24,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {15246#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:24,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {15250#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:24,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {15254#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:24,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {15258#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:24,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {15262#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:24,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {15266#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:24,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {15270#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:24,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {15274#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:24,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {15278#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:24,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {15282#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:24,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {15286#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:24,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {15290#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:24,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {15294#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:24,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {15298#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:24,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {15302#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:24,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {15306#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:24,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {15310#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:24,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {15314#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:24,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {15318#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:24,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {15322#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:24,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {15326#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:24,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {15330#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:24,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {15334#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:24,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {15338#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:24,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {15342#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:24,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {15346#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:24,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {15350#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:24,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {15354#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:24,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {15358#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:24,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {15362#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:24,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {15366#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15370#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:24,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {15370#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15374#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:24,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {15374#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15378#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:24,665 INFO L273 TraceCheckUtils]: 44: Hoare triple {15378#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15382#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:24,666 INFO L273 TraceCheckUtils]: 45: Hoare triple {15382#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15386#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:24,666 INFO L273 TraceCheckUtils]: 46: Hoare triple {15386#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15390#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:24,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {15390#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15394#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:24,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {15394#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15398#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:24,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {15398#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15402#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:24,669 INFO L273 TraceCheckUtils]: 50: Hoare triple {15402#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15406#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:24,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {15406#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15410#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:24,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {15410#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15414#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-23 13:16:24,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {15414#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15418#(and (= main_~main__sum~0 1081) (<= main_~main__i~0 47) (<= 46 main_~main__n~0))} is VALID [2018-11-23 13:16:24,672 INFO L273 TraceCheckUtils]: 54: Hoare triple {15418#(and (= main_~main__sum~0 1081) (<= main_~main__i~0 47) (<= 46 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15422#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:24,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {15422#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {15209#false} is VALID [2018-11-23 13:16:24,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {15209#false} assume !false; {15209#false} is VALID [2018-11-23 13:16:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:24,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:24,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-11-23 13:16:24,698 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-11-23 13:16:24,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:24,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 13:16:24,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:24,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 13:16:24,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 13:16:24,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:16:24,768 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 50 states. [2018-11-23 13:16:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,629 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:16:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 13:16:30,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-11-23 13:16:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:16:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-23 13:16:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:16:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-23 13:16:30,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2018-11-23 13:16:30,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:30,690 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:16:30,690 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:16:30,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 13:16:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:16:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 13:16:30,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:30,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 13:16:30,813 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:16:30,814 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:16:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,815 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-23 13:16:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:16:30,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,816 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:16:30,816 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:16:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,817 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-23 13:16:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:16:30,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:30,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:16:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-23 13:16:30,818 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-11-23 13:16:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:30,818 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-23 13:16:30,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 13:16:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:16:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:16:30,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:30,819 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:30,819 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:30,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash -454656016, now seen corresponding path program 47 times [2018-11-23 13:16:30,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:30,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:30,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:30,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,828 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:30,828 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:30,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:16:30,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-11-23 13:16:30,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:30,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:32,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {15773#true} call ULTIMATE.init(); {15773#true} is VALID [2018-11-23 13:16:32,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {15773#true} ~__return_main~0 := 0;~__return_60~0 := 0; {15773#true} is VALID [2018-11-23 13:16:32,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {15773#true} assume true; {15773#true} is VALID [2018-11-23 13:16:32,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15773#true} {15773#true} #28#return; {15773#true} is VALID [2018-11-23 13:16:32,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {15773#true} call #t~ret2 := main(); {15773#true} is VALID [2018-11-23 13:16:32,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {15773#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {15773#true} is VALID [2018-11-23 13:16:32,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {15773#true} assume !!(1 <= ~main__n~0); {15773#true} is VALID [2018-11-23 13:16:32,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {15773#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:32,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {15799#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15803#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:16:32,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {15803#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:32,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {15807#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:32,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {15811#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:32,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {15815#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:32,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {15819#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:32,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {15823#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:32,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {15827#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:32,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {15831#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:32,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {15835#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:32,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {15839#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:32,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {15843#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:32,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {15847#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:32,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {15851#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:32,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {15855#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:32,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {15859#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:32,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {15863#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:32,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {15867#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:32,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {15871#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:32,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {15875#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:32,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {15879#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:32,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {15883#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:32,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {15887#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:32,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {15891#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:32,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {15895#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:32,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {15899#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:32,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {15903#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:32,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {15907#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:32,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {15911#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:32,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {15915#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:32,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {15919#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:32,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {15923#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:32,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {15927#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15931#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:32,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {15931#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15935#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:32,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {15935#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15939#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:32,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {15939#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15943#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:32,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {15943#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15947#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:32,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {15947#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15951#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:32,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {15951#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15955#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:32,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {15955#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15959#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:32,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {15959#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15963#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:32,909 INFO L273 TraceCheckUtils]: 49: Hoare triple {15963#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15967#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:32,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {15967#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15971#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:32,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {15971#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15975#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:32,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {15975#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15979#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-23 13:16:32,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {15979#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15983#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-23 13:16:32,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {15983#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15987#(and (<= 47 main_~main__n~0) (<= main_~main__i~0 48) (= main_~main__sum~0 1128))} is VALID [2018-11-23 13:16:32,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {15987#(and (<= 47 main_~main__n~0) (<= main_~main__i~0 48) (= main_~main__sum~0 1128))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {15991#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:32,915 INFO L273 TraceCheckUtils]: 56: Hoare triple {15991#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {15774#false} is VALID [2018-11-23 13:16:32,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {15774#false} assume !false; {15774#false} is VALID [2018-11-23 13:16:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:32,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:32,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-11-23 13:16:32,941 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2018-11-23 13:16:32,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:32,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 13:16:33,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:33,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 13:16:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 13:16:33,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 13:16:33,001 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 51 states. [2018-11-23 13:16:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,055 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-23 13:16:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 13:16:39,056 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2018-11-23 13:16:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:16:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 13:16:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:16:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 13:16:39,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2018-11-23 13:16:39,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:39,123 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:16:39,123 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:16:39,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:16:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:16:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 13:16:39,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:39,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 13:16:39,246 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:16:39,247 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:16:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,248 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:16:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:16:39,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,249 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 13:16:39,249 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 13:16:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,249 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:16:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:16:39,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:39,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:16:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-23 13:16:39,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-11-23 13:16:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:39,251 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-23 13:16:39,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 13:16:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:16:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 13:16:39,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:39,252 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:39,252 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:39,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1209497081, now seen corresponding path program 48 times [2018-11-23 13:16:39,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:39,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,261 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:39,261 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:39,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:39,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:16:39,892 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 13:16:39,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:39,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:41,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {16348#true} call ULTIMATE.init(); {16348#true} is VALID [2018-11-23 13:16:41,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {16348#true} ~__return_main~0 := 0;~__return_60~0 := 0; {16348#true} is VALID [2018-11-23 13:16:41,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {16348#true} assume true; {16348#true} is VALID [2018-11-23 13:16:41,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16348#true} {16348#true} #28#return; {16348#true} is VALID [2018-11-23 13:16:41,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {16348#true} call #t~ret2 := main(); {16348#true} is VALID [2018-11-23 13:16:41,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {16348#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {16348#true} is VALID [2018-11-23 13:16:41,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {16348#true} assume !!(1 <= ~main__n~0); {16348#true} is VALID [2018-11-23 13:16:41,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {16348#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {16374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:41,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {16374#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16378#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:16:41,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {16378#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:41,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {16382#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:41,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {16386#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:41,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {16390#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:41,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {16394#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:41,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {16398#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:41,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {16402#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:41,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {16406#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:41,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {16410#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:41,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {16414#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:41,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {16418#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:41,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {16422#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:41,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {16426#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:41,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {16430#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:41,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {16434#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:41,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {16438#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:41,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {16442#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:41,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {16446#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:41,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {16450#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:41,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {16454#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:41,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {16458#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:41,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {16462#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:41,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {16466#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:41,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {16470#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:41,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {16474#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:41,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {16478#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:41,513 INFO L273 TraceCheckUtils]: 35: Hoare triple {16482#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:41,514 INFO L273 TraceCheckUtils]: 36: Hoare triple {16486#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:41,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {16490#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:41,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {16494#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:41,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {16498#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16502#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:41,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {16502#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16506#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:41,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {16506#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16510#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:41,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {16510#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16514#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:41,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {16514#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16518#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:41,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {16518#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16522#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:41,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {16522#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16526#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:41,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {16526#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16530#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:41,523 INFO L273 TraceCheckUtils]: 47: Hoare triple {16530#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16534#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:41,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {16534#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16538#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:41,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {16538#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16542#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:41,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {16542#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16546#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:41,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {16546#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16550#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:41,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {16550#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16554#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-23 13:16:41,528 INFO L273 TraceCheckUtils]: 53: Hoare triple {16554#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16558#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-23 13:16:41,529 INFO L273 TraceCheckUtils]: 54: Hoare triple {16558#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16562#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} is VALID [2018-11-23 13:16:41,530 INFO L273 TraceCheckUtils]: 55: Hoare triple {16562#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16566#(and (<= 48 main_~main__n~0) (= main_~main__sum~0 1176) (<= main_~main__i~0 49))} is VALID [2018-11-23 13:16:41,531 INFO L273 TraceCheckUtils]: 56: Hoare triple {16566#(and (<= 48 main_~main__n~0) (= main_~main__sum~0 1176) (<= main_~main__i~0 49))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16570#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:41,532 INFO L273 TraceCheckUtils]: 57: Hoare triple {16570#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {16349#false} is VALID [2018-11-23 13:16:41,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {16349#false} assume !false; {16349#false} is VALID [2018-11-23 13:16:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:41,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-11-23 13:16:41,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-11-23 13:16:41,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:41,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 13:16:41,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:41,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 13:16:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 13:16:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:16:41,631 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 52 states. [2018-11-23 13:16:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:48,056 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:16:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 13:16:48,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-11-23 13:16:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:16:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-23 13:16:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:16:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-23 13:16:48,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 64 transitions. [2018-11-23 13:16:48,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:48,115 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:16:48,115 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:16:48,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 13:16:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:16:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 13:16:48,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:48,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 13:16:48,311 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 13:16:48,311 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 13:16:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:48,313 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 13:16:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:16:48,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:48,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:48,314 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 13:16:48,314 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 13:16:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:48,315 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 13:16:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:16:48,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:48,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:48,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:48,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:16:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-23 13:16:48,317 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-11-23 13:16:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:48,317 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-23 13:16:48,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 13:16:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:16:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:16:48,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:48,318 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:48,318 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:48,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1160233680, now seen corresponding path program 49 times [2018-11-23 13:16:48,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:48,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:48,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:48,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:48,328 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:16:48,328 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:16:48,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:16:48,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:48,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:50,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {16933#true} call ULTIMATE.init(); {16933#true} is VALID [2018-11-23 13:16:50,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {16933#true} ~__return_main~0 := 0;~__return_60~0 := 0; {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {16933#true} assume true; {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16933#true} {16933#true} #28#return; {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {16933#true} call #t~ret2 := main(); {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {16933#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {16933#true} assume !!(1 <= ~main__n~0); {16933#true} is VALID [2018-11-23 13:16:50,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {16933#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {16959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-23 13:16:50,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {16959#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16963#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-23 13:16:50,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {16963#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-23 13:16:50,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {16967#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-23 13:16:50,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {16971#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-23 13:16:50,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {16975#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-23 13:16:50,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {16979#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-23 13:16:50,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {16983#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-23 13:16:50,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {16987#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-23 13:16:50,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {16991#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-23 13:16:50,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {16995#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {16999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-23 13:16:50,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {16999#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-23 13:16:50,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {17003#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-23 13:16:50,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {17007#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-23 13:16:50,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {17011#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-23 13:16:50,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {17015#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-23 13:16:50,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {17019#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-23 13:16:50,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {17023#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-23 13:16:50,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {17027#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-23 13:16:50,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {17031#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-23 13:16:50,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {17035#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-23 13:16:50,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {17039#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-23 13:16:50,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {17043#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-23 13:16:50,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {17047#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-23 13:16:50,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {17051#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-23 13:16:50,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {17055#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-23 13:16:50,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {17059#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-23 13:16:50,183 INFO L273 TraceCheckUtils]: 34: Hoare triple {17063#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-23 13:16:50,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {17067#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-23 13:16:50,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {17071#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-23 13:16:50,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {17075#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-23 13:16:50,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {17079#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17083#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-23 13:16:50,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {17083#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17087#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-23 13:16:50,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {17087#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17091#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-23 13:16:50,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {17091#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17095#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2018-11-23 13:16:50,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {17095#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17099#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} is VALID [2018-11-23 13:16:50,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {17099#(and (= main_~main__sum~0 630) (= 36 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17103#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} is VALID [2018-11-23 13:16:50,191 INFO L273 TraceCheckUtils]: 44: Hoare triple {17103#(and (= 37 main_~main__i~0) (= main_~main__sum~0 666))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17107#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} is VALID [2018-11-23 13:16:50,192 INFO L273 TraceCheckUtils]: 45: Hoare triple {17107#(and (= main_~main__sum~0 703) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17111#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} is VALID [2018-11-23 13:16:50,192 INFO L273 TraceCheckUtils]: 46: Hoare triple {17111#(and (= main_~main__sum~0 741) (= 39 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17115#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2018-11-23 13:16:50,193 INFO L273 TraceCheckUtils]: 47: Hoare triple {17115#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17119#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} is VALID [2018-11-23 13:16:50,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {17119#(and (= 41 main_~main__i~0) (= main_~main__sum~0 820))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17123#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} is VALID [2018-11-23 13:16:50,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {17123#(and (= main_~main__sum~0 861) (= 42 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17127#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} is VALID [2018-11-23 13:16:50,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {17127#(and (= 43 main_~main__i~0) (= main_~main__sum~0 903))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17131#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} is VALID [2018-11-23 13:16:50,197 INFO L273 TraceCheckUtils]: 51: Hoare triple {17131#(and (= main_~main__sum~0 946) (= 44 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17135#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} is VALID [2018-11-23 13:16:50,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {17135#(and (= 45 main_~main__i~0) (= main_~main__sum~0 990))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17139#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} is VALID [2018-11-23 13:16:50,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {17139#(and (= 46 main_~main__i~0) (= main_~main__sum~0 1035))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17143#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} is VALID [2018-11-23 13:16:50,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {17143#(and (= main_~main__sum~0 1081) (= 47 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17147#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} is VALID [2018-11-23 13:16:50,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {17147#(and (= main_~main__sum~0 1128) (= 48 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17151#(and (= 49 main_~main__i~0) (= main_~main__sum~0 1176))} is VALID [2018-11-23 13:16:50,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {17151#(and (= 49 main_~main__i~0) (= main_~main__sum~0 1176))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {17155#(and (= main_~main__sum~0 1225) (<= 49 main_~main__n~0) (<= main_~main__i~0 50))} is VALID [2018-11-23 13:16:50,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {17155#(and (= main_~main__sum~0 1225) (<= 49 main_~main__n~0) (<= main_~main__i~0 50))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (1 + ~main__n~0) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {17159#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:16:50,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {17159#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {16934#false} is VALID [2018-11-23 13:16:50,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {16934#false} assume !false; {16934#false} is VALID [2018-11-23 13:16:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:50,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:50,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-11-23 13:16:50,241 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 60 [2018-11-23 13:16:50,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:50,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 13:16:50,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 13:16:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 13:16:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 13:16:50,300 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 53 states.